2007885_wa.cpp

北大大牛代码 1240道题的原代码 超级权威

# include <iostream>
# include <cstdio>
using namespace std;

bool mark;
static long f[] = {362880,40320,5040,720,120,24,6,2,1,1};

void solve(long N)
{
	for(int i = 0; i < 10; i++)
	{	
		if(N>=f[i])
			N -= f[i];
		if(N==0)
		{
			mark = 1;
			return ;
		}
	}
}

int main()
{
	long N;

	while(cin>>N&&N!=-1)
	{
		mark = 0;
		if(!N)
		{
			printf("NO\n");
			continue;
		}
		solve(N);
		if(mark)
			printf("YES\n");
		else
			printf("NO\n");
	}
	return 1;
}