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 flag = 1;
  15. for (int i = 1, j = 1; i <= n; ++i) {
  16. for (int j = 1; j <= m; ++j) {
  17. if (mt[i][m / 2 + 1] != mt[n / 2 + 1][m / 2 + 1] ||
  18. (mt[n / 2 + 1][j] != mt[n / 2 + 1][m / 2 + 1])) {
  19. flag = 0;
  20. i = n + 1;
  21. j = m + 1;
  22. }
  23. }
  24. }
  25. if (flag == 1) {
  26. cout << "Da";
  27. } else {
  28. cout << "Nu";
  29. }
  30. return 0;
  31. }
Success #stdin #stdout 0.01s 5264KB
stdin
3 5
1 2 0 4 5
0 0 0 0 0
1 2 0 4 5
stdout
Da