2400.cpp

自己的ac代码 在acm.zju.edu.cn 上的题目

#include<stdio.h>
#include<string.h>
#include<math.h>
/*int main()
{
	int i,j,k;
	char prime[100];
	memset(prime,1,sizeof(prime));
	__int64 big,c,d;
	for(i=2;i<=10;i++)if(prime[i])
	{
		for(j=i*2;j<=100;j+=i)prime[j]=0;
	}
	c=4;
	for(i=2;i<=63;i++,c*=2)if(prime[i])
	{
		
		big=c-1;k=0;
		int flag=0;
		for(j=2;j<sqrt(double(big));j++)
		{
			if(big%j==0)
			{
				flag=1;
				k++;
				if(k!=1)printf(" * ");
				printf("%d",j);
				big/=j;
				j--;
			}
		}
		if(flag==1)
		{
			printf(" * ");
			printf("%I64d",big);
			printf(" = %I64d = ( 2 ^ %d ) - 1\n",c-1,i);
		}
	}
	return 0;
}
*/
int main()
{
	char s[10][100]=
	{
	"23 * 89 = 2047 = ( 2 ^ 11 ) - 1",
	"47 * 178481 = 8388607 = ( 2 ^ 23 ) - 1",
	"233 * 1103 * 2089 = 536870911 = ( 2 ^ 29 ) - 1",
	"223 * 616318177 = 137438953471 = ( 2 ^ 37 ) - 1",
	"13367 * 164511353 = 2199023255551 = ( 2 ^ 41 ) - 1",
	"431 * 9719 * 2099863 = 8796093022207 = ( 2 ^ 43 ) - 1",
	"2351 * 4513 * 13264529 = 140737488355327 = ( 2 ^ 47 ) - 1",
	"6361 * 69431 * 20394401 = 9007199254740991 = ( 2 ^ 53 ) - 1",
	"179951 * 3203431780337 = 576460752303423487 = ( 2 ^ 59 ) - 1"
	};
	int a[10]={11,23,29,37,41,43,47,53,59};
	int n;
	scanf("%d",&n);
	int i;
	for(i=0;i<9;i++)
	{
		if(a[i]>n)break;
		printf("%s\n",s[i]);
	}
	return 0;
}