ZOJ-1954

又是无意中瞄到的水题，顺手A之，模拟下硬搞就行，无算法纯找规律

#include<stdio.h>

int main()
{
	int dir[6][2] =
	{
	{ -1, 1 },
	{ -1, 0 },
	{ 0, -1 },
	{ 1, -1 },
	{ 1, 0 },
	{ 0, 1 } };
	int x[100000], y[100000];
	x[1] = y[1] = 0;
	int index = 2, i, j, circle = 1;
	while (index < 100000)
	{
		x[index] = x[index - 1] + dir[5][0];
		y[index] = y[index - 1] + dir[5][1];
		index++;
		for (i = 0; i < circle - 1 && index < 100000; i++)
		{
			x[index] = x[index - 1] + dir[0][0];
			y[index] = y[index - 1] + dir[0][1];
			index++;
		}
		for (j = 1; j < 6 && index < 100000; j++)
			for (i = 0; i < circle && index < 100000; i++)
			{
				x[index] = x[index - 1] + dir[j][0];
				y[index] = y[index - 1] + dir[j][1];
				index++;
			}
		circle++;
	}
	while (scanf("%d", &i) != EOF)
		printf("%d %d\n", x[i], y[i]);
	return 0;
}