fork download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. const int MAX_SIZE = 9;
  5.  
  6. int main() {
  7. int n, m, mt[MAX_SIZE + 1][MAX_SIZE + 1];
  8. cin >> n >> m;
  9. for (int i = 1; i <= n; ++i) {
  10. for (int j = 1; j <= m; ++j) {
  11. cin >> mt[i][j];
  12. }
  13. }
  14. int middleElement = mt[n / 2 + 1][m / 2 + 1];
  15. int flag = 1;
  16. for (int i = 1; i <= n; ++i) {
  17. if (mt[i][m / 2 + 1] != middleElement) {
  18. flag = 0;
  19. i = n + 1;
  20. }
  21. }
  22. for (int j = 1; j <= m; ++j) {
  23. if (mt[n / 2 + 1][j] != middleElement) {
  24. flag = 0;
  25. j = m + 1;
  26. }
  27. }
  28. if (flag == 1) {
  29. cout << "Da";
  30. } else {
  31. cout << "Nu";
  32. }
  33. return 0;
  34. }
Success #stdin #stdout 0.01s 5276KB
stdin

3 5
1 2 3 4 5
3 3 0 3 3
1 2 3 4 5  -> NU
 

stdout
Nu