fork download
  1. #include <stdio.h>
  2.  
  3. const int MAX = 100;
  4.  
  5. int main(void)
  6. {
  7. int A[MAX][MAX];
  8. int i, j, y, x, n = 0, m = 0, result;
  9.  
  10. printf("Enter n [1, %d], m [1, %d]: ", MAX, MAX);
  11. scanf("%d%d", &n, &m);
  12.  
  13. for (i = 0; i < n; ++i) {
  14. for (j = 0; j < m; ++j) {
  15. printf("Enter a[%d][%d] ", i, j);
  16. scanf("%d", &A[i][j]);
  17. }
  18. }
  19.  
  20. for (i = 0; i < n; ++i)
  21. for (j = 0; j < m; ++j)
  22. for (y = 0; y < n; ++y)
  23. for (x = 0; x < m; ++x)
  24. if (y != i && x != j && A[i][j] == A[y][x]) {
  25. printf("%d\n%d %d\t %d %d\n", A[i][j], i, j, y, x);
  26. return 0;
  27. }
  28. printf("No equal elements found\n");
  29.  
  30. return 0;
  31.  
  32. }
  33.  
Success #stdin #stdout 0s 9432KB
stdin
3 2
1 5
6 3
5 7
stdout
Enter n [1, 100], m [1, 100]: Enter a[0][0] Enter a[0][1] Enter a[1][0] Enter a[1][1] Enter a[2][0] Enter a[2][1] 5
0 1	 2 0