U E D R , A S I H C RSS

Scheduled Walk/승균

Roach 큐

~cpp 
#include <iostream>
using namespace std;
void main()
{
	int roach[16][16];
	int a,b;
	char move[1000];

	for (int l = 0; l < 16; l++)
	{	
		for (int k = 0; k < 16; k++)
			roach[l][k] = 0;
	} 
	
	cin >> move;
	cin >> a;
	cin >> b;
	roach[a][b] = 1;

	
	for (int i = 0; move[i]!='\0'; i++)
	{	
		if (move[i] == '6')
		{	
			a++;
		    roach[a][b] += 1;
		}
		else if(move[i] == '8')
		{	
			b--;
		    roach[a][b] += 1;
		}
		else if (move[i] == '4')
		{	
			a--;
		    roach[a][b] += 1;
		}
		else if (move[i] == '2')
		{	
			b++;
		    roach[a][b] += 1;
		}
		else if (move[i] == '1')
		{	
			a--;
			b++;
		    roach[a][b] += 1;
		}
		else if (move[i] == '3')
		{	
			a++;
			b++;
		    roach[a][b] += 1;
		}
		else if (move[i] == '7')
		{	
			a--;
			b--;
		    roach[a][b] += 1;
		}
		else if (move[i] == '9')
		{	
			a++;
			b--;
		    roach[a][b] += 1;
		}
		else
			exit(0);
	}

	for (l = 0; l < 16; l++)
	{	
		for (int k = 0; k < 16; k++)
		{	
			cout.width(3);
			cout << roach[k][l];
		}

		cout << endl;
	}
}

주의 : 정해진 틀을 넘어서면 사라집니다 -_-;;;;
Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:27:59
Processing time 0.0107 sec