fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. const long long MaxN= 105;
  4. long long n,m,a[MaxN][MaxN], b[MaxN][MaxN], c[MaxN][MaxN];
  5. int main()
  6. {
  7. ios_base::sync_with_stdio(0);
  8. cin.tie(0);
  9. cin >> n >> m;
  10. for (long long i=1; i<=n; i++)
  11. {
  12. for (long long j=1; j<=m;j++)
  13. {
  14. cin >> a[i][j];
  15. }
  16. }
  17. long long ans_1= 0,ans_2=0;
  18. for (long long i=1; i<=n; i++)
  19. {
  20. for (long long j=1; j<=m; j++)
  21. {
  22. if(a[i][j]%2==0) // chẵn
  23. {
  24. if(i%2==j%2)
  25. {
  26. b[i][j]=a[i][j]+1;
  27. c[i][j]=a[i][j];
  28. ans_1++;
  29. }
  30. else
  31. {
  32. b[i][j]=a[i][j];
  33. c[i][j]=a[i][j]+1;
  34. ans_2++;
  35. }
  36. }
  37. else
  38. {
  39. if(i%2!=j%2)
  40. {
  41. b[i][j]=a[i][j]+1;
  42. c[i][j]=a[i][j];
  43. ans_1++;
  44. }
  45. else
  46. {
  47. b[i][j]=a[i][j];
  48. c[i][j]=a[i][j]+1;
  49. ans_2++;
  50. }
  51. }
  52. }
  53. }
  54. if(ans_2<ans_1)
  55. {
  56. for (long long i=1; i<=n ;i++)
  57. {
  58. for (long long j=1; j<=m; j++)
  59. {
  60. cout << c[i][j] << " " ;
  61. }
  62. cout << "\n";
  63. }
  64. }
  65. else if(ans_2>ans_1)
  66. {
  67. for (long long i=1; i<=n ;i++)
  68. {
  69. for (long long j=1; j<=m; j++)
  70. {
  71. cout << b[i][j] << " " ;
  72. }
  73. cout << "\n";
  74. }
  75. }
  76. else
  77. {
  78. if(b[1][1]>c[1][1])
  79. {
  80. for (long long i=1; i<=n ;i++)
  81. {
  82. for (long long j=1; j<=m; j++)
  83. {
  84. cout << c[i][j] << " " ;
  85. }
  86. cout << "\n";
  87. }
  88. }
  89. else
  90. {
  91. for (long long i=1; i<=n ;i++)
  92. {
  93. for (long long j=1; j<=m; j++)
  94. {
  95. cout << b[i][j] << " " ;
  96. }
  97. cout << "\n";
  98. }
  99. }
  100. }
  101. }
Success #stdin #stdout 0s 5304KB
stdin
Standard input is empty
stdout
Standard output is empty