题目链接:http://bailian.openjudge.cn/practice/2928
# include <stdio.h>
int number1(int num)
{
int n=0,num_back=num;
while(num!=0)
{
n=10*n+num%10;
num=num/10;
}
if(num_back==n)
return 1;
else
return 0;
}
int main()
{
int i,j,r,q,w,count,p;
int N,num;
int c[1000];
while(scanf("%d",&num)!=EOF)
{
if(num<11||num>1000)
break;
count=0,p=0;
for(i=11,j=0;i<=num;i++)
{
q=2;
w=1;
do
{
r=i%q;
if(r==0)
w=0;
else
q++;
}while(q*q<=i&&w!=0);
if(w==1)
{
count++;
c[j]=i;
j++;
}
}
if(count==0)
printf("0");
else
{
for(i=0;i<count;i++)
{
N=number1(c[i]);
if(N==1)
p++;
}
printf("%d\n",p);
}
}
return 0;
}