fork download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. const int MAX_LENGTH = 30000;
  5.  
  6. int main() {
  7. int n, m, v[MAX_LENGTH + 1];
  8. cin >> n >> m;
  9. for (int i = 1; i <= n; ++i) {
  10. cin >> v[i] ;
  11. //cout << v[i] <<" ";
  12. }
  13. //cout << 5 / 2;
  14. int counter = 0;
  15. for (int i = 1, aux = 0; i <= n ; ++i, ++aux) {
  16. if (v[i] != v[n - aux]) {
  17. ++counter;
  18. }
  19. }
  20.  
  21.  
  22. cout <<counter << "\n";
  23. int i = 1;
  24. int modifPos = 0, newVal = 0;
  25. while (i++ <= m){
  26. int newCounter = 0;
  27. cin >> modifPos >> newVal;
  28. for (int i = 1; i <= n; ++i) {
  29. if (i == modifPos) {
  30. v[i] = newVal;
  31. }
  32. }
  33. for (int i = 1, aux = 0; i <= n ; ++i, ++aux) {
  34. cout << v[i] << " " << v[n - aux] <<"\n";
  35. if (v[i] != v[n - aux]) {
  36. ++newCounter;
  37. }
  38. }
  39. //cout << newCounter << "\n";
  40. //cout << modifPos << newVal << "\n";
  41. // ++i;
  42. cout << "\n";
  43. }
  44. return 0;
  45. }
Success #stdin #stdout 0.01s 5288KB
stdin
7 5
1 2 3 4 5 6 7 
2 0 
3 1 
4 0 
7 1 
6 1 
stdout
6
1 7
0 6
3 5
4 4
5 3
6 0
7 1

1 7
0 6
1 5
4 4
5 1
6 0
7 1

1 7
0 6
1 5
0 0
5 1
6 0
7 1

1 1
0 6
1 5
0 0
5 1
6 0
1 1

1 1
0 1
1 5
0 0
5 1
1 0
1 1