CODE:

#include	

int main(void)
{
	int number;

	for (number = 3; number <= 1000000; ++number)
	{
		int x, x1, y1, x2, y2;
		int exists = 0;
		for (x = 1; x * x * x < number; ++x)
		{
			int y;
			for (y = x + 1; x * x * x + y * y * y < number; ++y)
				;
			if (x * x * x + y * y * y == number)
			{
				++exists;
				if (exists == 1)
				{
					x1 = x;
					y1 = y;
				}
				else if (exists == 2)
				{
					x2 = x;
					y2 = y;
				}
			}
		}

		switch (exists)
		{
		case 0:
			printf("%d : 分解不可\n", number);
			break;
		case 1:
			printf("%d : %d ^ 3 + %d ^ 3 のみに分解可能\n", number, x1, y1);
			break;
		case 2:
			printf("%d : %d ^ 3 + %d ^ 3 と %d ^ 3 + %d ^ 3 に分解可能\n", number, x1, y1, x2, y2);
			break;
		default:
			printf("%d : %d 通りに分解可能\n", number, exists);
			break;
		}
	}

	return 0;
}