欧拉计划Problem 37

The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3.

Find the sum of the only eleven primes that are both truncatable from left to right and right to left.

NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.


#define N 1000000
#define M 10


bool isPrime(int x)
{
if (x == 1)
{
return false;
}
for (int i = 2; i*i <= x; i++)
{
if (x % i == 0)
{
return false;
}
}
return true;
}


void tranmit(char R[],char L[])
{
for (int i = 1; i < strlen(R); i++)
{
R[i-1] = R[i];
}
R[i-1] = '\0';
L[strlen(L)-1] = '\0';
}


int main()
{
clock_t ts,te;
ts=clock();
int answer = 0;
char L[M],R[M];
int i,j,count = 0;
bool s[N];
bool b = true;
for (i = 0; i < N; i++)
{
s[i] = false;
}
for (i = 2; i < N; i++)
{
if (isPrime(i) == true)
{
s[i] = true;
}
}
for (i = 23; i < N; i+=2)
{
if (s[i] == true)
{
sprintf(R,"%d",i);
strcpy(L,R);
int len = strlen(L);
for (j = 1; j < len; j++)
{
tranmit(R,L);
if (s[atoi(L)] == false || s[atoi(R)] == false)
{
b = false;
break;
}
}
if (b == true)
{
answer += i;
count++;
if (count == 11)
{
break;
}
}
b = true;
}
}
printf("\nanswer %d",answer);
te=clock();
printf("\ntime difference: %ds\n",(te-ts)/CLOCKS_PER_SEC);
getchar();
return 0;
}