fork(1) download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. const int MAX_SIZE = 10;
  5. const int STRANGE_NO = 29;
  6. int main() {
  7. int n, m, mt[MAX_SIZE + 1][MAX_SIZE + 1];
  8. cin >> n >> m;
  9. for (int i = 0; i < n; ++i) {
  10. for (int j = 0; j < m; ++j) {
  11. cin >> mt[i][j];
  12. }
  13. }
  14. int strangeCol = 0, strangeApar = 0;// sau putem pune mt[n][n] = 0 in loc de strangeApar si mt[n][m] = 0 in loc de strangeCol
  15. for (int i = 0; i < m; ++i) {
  16. mt[m][m] = 0;
  17. for (int j = 0; j < n; ++j) {
  18. if (mt[j][i] == STRANGE_NO) {
  19. ++mt[m][m];
  20. }
  21. }
  22. if(mt[n][m] > strangeApar) {
  23. strangeApar = mt[m][m];
  24. strangeCol = i;
  25. }
  26. }
  27. cout << strangeCol;
  28. return 0;
  29. }
Success #stdin #stdout 0.01s 5308KB
stdin
4 3 
12 50 43
29 29 29 
21 19 29
39 49 28 
stdout
2