2007825_ac_15ms_48k.cpp

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

#include<stdio.h>

long int a[10];

long int fac(int x)
{
	int total = 1, s;
	for(s = 1;s <= x;s++)
	{
	total *= s;
	}
return(total);
}

int judge(int x)
{
	
	if(x==0) {return 0;goto end;}
	int j;
	for(j = 9;j >= -1;j--)
	{
		if(x==0) {return 1;break;}
		if(x >= a[j]) x -= a[j];
	}
return 0;
end:
;
}


void main()
{
	long int i, n, m;
	
	a[0] = 1;

	for(i = 1;i <= 9;i++)
	{
		a[i] = fac(i);
	}
	
	scanf("%d",&n);
	
	while(n >= 0)
	{
		m = judge(n); 
		if(m==0)printf("NO\n");
		if(m==1)printf("YES\n");
		
		scanf("%d",&n);
	}
}