Algorithm/acmicpc.net/source/3023.cpp at master · tdm1223/Algorithm · GitHub

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
// 3023. 마술사 이민혁
// 2019.05.21
// 구현
#include<iostream>

using namespace std;

char d[51][51];
char card[102][102];
int main()
{
	int r, c;
	cin >> r >> c;
	for (int i = 0; i < r; i++)
	{
		for (int j = 0; j < c; j++)
		{
			cin >> d[i][j];
			card[i][j] = d[i][j];
		}
	}
	int a, b;
	cin >> a >> b;
	// 아래 대칭
	for (int i = r; i < r * 2; i++)
	{
		for (int j = 0; j < c; j++)
		{
			card[i][j] = d[r * 2 - i - 1][j];
		}
	}
	// 오른쪽 대칭
	for (int i = 0; i < r; i++)
	{
		for (int j = c; j < c * 2; j++)
		{
			card[i][j] = d[i][c * 2 - j - 1];
		}
	}
	// 대각선 대칭
	for (int i = r; i < r * 2; i++)
	{
		for (int j = c; j < c * 2; j++)
		{
			card[i][j] = d[r * 2 - i - 1][c * 2 - j - 1];
		}
	}
	if (card[a - 1][b - 1] == '#')
	{
		card[a - 1][b - 1] = '.';
	}
	else
	{
		card[a - 1][b - 1] = '#';
	}
	for (int i = 0; i < r * 2; i++)
	{
		for (int j = 0; j < c * 2; j++)
		{
			cout << card[i][j];
		}
		cout << endl;
	}
	return 0;
}