0
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 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 91 92 93 94
#include <iostream>
#include <string>
using namespace std;
int main ()
{
int n,m;
char c[10][10];
cin >> n >> m;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
cin >> c[i][j];
}
}
c[0][0] = 'E';
c[n-1][0] = 'D';
c[0][m-1] = 'F';
c[n-1][m-1] = 'C';
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (c[i][j] == 'A')
{
if (j == 0) {c[i][j] = 'B';} else
{if (i>0 && c[i][j-1] != 'A' && c[i][j-1] != 'D' && c[i][j-1] != 'E' && (c[i-1][j] == 'E' || c[i-1][j] == 'F' || c[i-1][j] == 'B')) c[i][j] = 'B';}
}
else
{
if (c[i][j] == 'B')
{
if (i == 0) {c[i][j] = 'A';} else
{if (j>0 && c[i-1][j] != 'B' && c[i-1][j] != 'F' && c[i-1][j] != 'E' && (c[i][j-1] == 'D' || c[i][j-1] == 'F' || c[i][j-1] == 'A')) c[i][j] = 'A';}
}
else
{ //уголки
if (i==0 && j > 0)
{
if (c[i][j-1] == 'A' || c[i][j-1] == 'E') c[i][j] = 'F'; else c[i][j] = 'E';
}
else
{
if (i==n-1 && j > 0)
{
if (c[i][j-1] == 'A' || c[i][j-1] == 'D') c[i][j] = 'C'; else c[i][j] = 'D';
}
else
{
if (j==0 && i > 0)
{
if (c[i-1][j] == 'B' || c[i-1][j] == 'E') c[i][j] = 'D'; else c[i][j] = 'E';
}
else
{
if (j==m-1 && i > 0)
{
if (c[i-1][j] == 'B' || c[i-1][j] == 'F') c[i][j] = 'C'; else c[i][j] = 'F';
}
else
{
if ((c[i-1][j] == 'B' || c[i-1][j] == 'F') && (c[i][j-1] == 'A' || c[i][j-1] == 'D')) c[i][j] = 'C';
else
{
if (c[i-1][j] == 'B' || c[i-1][j] == 'E') c[i][j] = 'D';
else
{
if (c[i][j-1] == 'A' || c[i][j-1] == 'E') c[i][j] = 'F';
else c[i][j] = 'E';
}
}
}
}
}
}
}
}
}
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
cout << c[i][j];
}
cout << endl;
}
}
http://vk.com/photo70606856_365037363
Пройдено 77 тестов из 85
Запостил:
yury99 ,
26.04.2015 (Updated 28.03.2018 )
Комментарии (0) RSS