tanasaradu

Untitled

Jan 8th, 2018
100
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.26 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4. int n , m , a[105][105] , mx = -1 , mn = 1000001 , b[105][105];
  5. inline int Verificare_Linie(int x)
  6. {
  7. for(int i = 1 ; i <= m ; i++)
  8. if(a[x][i] == mx || a[x][i] == mn)
  9. return 1;
  10. return 0;
  11. }
  12. inline int Verificare_Coloana(int x)
  13. {
  14. for(int i = 1 ; i <= n ; i++)
  15. {
  16. if(a[i][x] == mx || a[i][x] == mn)
  17. return 1;
  18. }
  19. return 0;
  20. }
  21. int main()
  22. {
  23. cin >> n >> m;
  24. for(int i = 1 ; i <= n ; i++)
  25. for(int j = 1 ; j <= m ; j++)
  26. {
  27. cin >> a[i][j];
  28. b[i][j] = a[i][j];
  29. mx = max(mx , a[i][j]);
  30. mn = min(mn , a[i][j]);
  31. }
  32. for(int i = 1 ; i <= n ; i++)
  33. if(Verificare_Linie(i) == 1)
  34. for(int j = 1 ; j <= m ; j++)
  35. b[i][j] = - 1;
  36. for(int j = 1 ; j <= m ; j++)
  37. if(Verificare_Coloana(j))
  38. for(int i = 1 ; i <= n ; i++)
  39. b[i][j] = - 1;
  40. for(int i = 1 ; i <= n ; i++)
  41. {
  42. bool ok = 0;
  43. for(int j = 1 ; j <= m ; j++)
  44. if(b[i][j] != - 1)
  45. {
  46. cout << b[i][j] << " ";
  47. ok = 1;
  48. }
  49. if(ok == 1)
  50. cout << "\n";
  51. }
  52. return 0;
  53. }
Advertisement
Add Comment
Please, Sign In to add comment