fork download
copy 
  1. //#include<bits/stdc++.h>
  2. #include<iostream>
  3. #include<string>
  4. #include<iomanip>
  5. #include<cmath>
  6. #include<algorithm>
  7. using namespace std;
  8. //Do whatever you can ^^
  9. int max(int arr[],int n)
  10. {
  11. 	int max = arr[0];
  12. 	for (int i = 1; i < n; i++)
  13. 	{
  14. 		if (max < arr[i])
  15. 			max = arr[i];
  16. 	}
  17. 	return max;
  18. }
  19. int min(int arr[], int n)
  20. {
  21. 	int min = arr[0];
  22. 	for (int i = 1; i < n; i++)
  23. 	{
  24. 		if (min> arr[i])
  25. 			min = arr[i];
  26. 	}
  27. 	return min;
  28. }
  29. bool valid(int i, int j, int n, int m)
  30. {
  31. 	if (i >= 0 && j >= 0 && i <= n - 1 && j <= m - 1)
  32. 		return 1;
  33. 	else
  34. 		return 0;
  35. }
  36. int main()
  37. {
  38. 	//cout << fixed << setprecision(9);	
  39. 	//freopen("Files.in", "r", stdin);
  40. 	//freopen("Files.out", "w", stdout);
  41. 	std::ios_base::sync_with_stdio(NULL);
  42. 	cin.tie(NULL); cout.tie(NULL);
  43. 	char arr[100][100];
  44. 	int r, c;
  45. 	cin >> r >> c;
  46. 	for (int i = 0; i < r; i++)
  47. 	{
  48. 		for (int j = 0; j < c; j++)
  49. 		{
  50. 			cin >> arr[i][j];
  51. 		}
  52. 	}
  53. 	for (int i = 0; i < r; i++)
  54. 	{
  55. 		for (int j = 0; j < c; j++)
  56. 		{
  57. 			if (arr[i][j] == 'o')
  58. 			{
  59.                  arr[i][j]='x';
  60.  
  61. 				if (valid(i - 1, j - 1, r, c) && arr[r - 1][c - 1] == '.')
  62. 				{
  63.  
  64. 					arr[i - 1][j - 1] = 'x';
  65. 				}
  66. 				if (valid(i - 1, j, r, c) && arr[i - 1][j] == '.')
  67. 				{
  68.  
  69. 					arr[i - 1][j] = 'x';
  70. 				}
  71. 				if (valid(i - 1, j + 1, r, c) && arr[i - 1][j + 1] == '.')
  72. 				{
  73.  
  74. 					arr[i - 1][j + 1] = 'x';
  75. 				}
  76. 				if (valid(i, j - 1, r, c) && arr[i][j - 1] == '.')
  77. 				{
  78.  
  79. 					arr[i][j - 1] = 'x';
  80. 				}
  81. 				if (valid(i, j + 1, r, c) && arr[i][j + 1] == '.')
  82. 				{
  83. 					arr[i][j + 1] = 'x';
  84. 				}
  85. 				if (valid(i + 1, j - 1, r, c) && arr[i + 1][j - 1] == '.')
  86. 				{
  87.  
  88. 					arr[i + 1][j - 1] = 'x';
  89. 				}
  90. 				if (valid(i + 1, j, r, c) && arr[i + 1][j] == '.')
  91. 				{
  92.  
  93. 					arr[i + 1][j] = 'x';
  94. 				}
  95. 				if (valid(i + 1, j + 1, r, c) && arr[i + 1][j + 1] == '.')
  96. 				{
  97.  
  98. 					arr[i + 1][j + 1] = 'x';
  99. 				}
  100. 			}
  101. 		}
  102. 	}
  103. 	for (int i = 0; i < r; i++)
  104. 	{
  105. 		for (int j = 0; j < c; j++)
  106. 		{
  107. 			cout << arr[i][j] ;
  108. 		}
  109. 		cout << '\n';
  110. 	}
  111. //	system("pause");
  112. }
Success #stdin #stdout 0s 15240KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
....................
.....xxxxxxxxxxxxxxx
xxxxxxxxxxxxxxxxxxxx
xxxxxxxxxxxxxxxxxxxx
xxxxx...............
....................
....................
https://ideone.com/YpfbKP
language:
C++14 (gcc 8.3)
created:
5 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!