fork download
copy 
  1. #include <vector>
  2. #include <list>
  3. #include <map>
  4. #include <set>
  5. #include <queue>
  6. #include <deque>
  7. #include <stack>
  8. #include <bitset>
  9. #include <algorithm>
  10. #include <functional>
  11. #include <numeric>
  12. #include <utility>
  13. #include <sstream>
  14. #include <iostream>
  15. #include <iomanip>
  16. #include <cstdio>
  17. #include <cmath>
  18. #include <cstdlib>
  19. #include <ctime>
  20. #include <cstring>
  21. #include <math.h> 
  22. #define lli long long int
  23.  
  24.  
  25.  
  26. using namespace std;
  27.  
  28. int main(){
  29. 	int n;
  30. 	cin >> n;
  31. 	string s[1000];
  32. 	string word;
  33. 	bool check = false;
  34. 	bool done = false;
  35. 	for(int i = 1; i <= n; i++){
  36. 		cin >> word;
  37. 		s[i] = word;
  38. 		if(s[i][0] == s[i][1] && s[i][0] == 'O' || s[i][3] == s[i][4] && s[i][3] == 'O' && !done){
  39. 			if(s[i][0] == s[i][1]){
  40. 				s[i][0] = '+';
  41. 				s[i][1] = '+';
  42. 				check = true;
  43.  
  44. 			}
  45. 			else{
  46. 				s[i][3] = '+';
  47. 				s[i][4] = '+';
  48. 				check = true;
  49.  
  50. 			}
  51.  
  52. 			done = true;
  53. 		}
  54. 	}
  55. 	if(check){
  56. 			cout << "YES" << endl;
  57. 			for(int i = 1; i <= n; i++){
  58. 				cout << s[i] << endl;
  59. 			}
  60. 	}
  61. 	else{
  62. 		cout << "NO" << endl;
  63. 	}
  64.  
  65.  
  66. }
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88.  
  89.  
  90.  
Success #stdin #stdout 0s 3476KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
NO
https://ideone.com/He9UCX
language:
C++14 (gcc 8.3)
created:
8 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!