WOJ1216-Superprime Rib

Butchering Farmer John's cows always yields the best prime rib. You can tell prime ribs by looking at the digits lovingly stamped across them, one by one, by FJ and the USDA. Farmer John ensures that a purchaser of his prime ribs gets really prime ribs because when sliced from the right, the numbers on the ribs continue to stay prime right down to the last rib, e.g.:

7 3 3 1

The set of ribs denoted by 7331 is prime; the three ribs 733 are prime; the two ribs 73 are prime, and, of course, the last rib, 7, is prime. The number 7331 is called a superprime of length 4.

Write a program that accepts a number N 1 <=N<=8 of ribs and prints all the superprimes of that length.

The number 1 (by itself) is not a prime number.

输入格式

The input contains multiple test cases.
For each test case:
A single line with the number N.

输出格式

For each test case,The superprime ribs of length N, printed in ascending order one per line.

样例输入

4

样例输出

2333233923932399293931193137373337393793379759397193733173337393

#include<stdio.h> #include<math.h>int IsPrime(long int n){double k;    int i;    k=sqrt((double)n);    for(i=2;i<=k;++i)        if(n%i==0) return 0;    return 1;}void AddDigit(long int n,int curDigit,int finalDigit){    ++curDigit;    long int t=n;    int i;    for(i=1;i<=9;i+=2){t=t*10+i;        if(IsPrime(t)==1)            if(curDigit==finalDigit)            printf("%d\n",t);            else AddDigit(t,curDigit,finalDigit);        t=n;    }}int main(){int n,i,num[4]={2,3,5,7};    while(scanf("%d",&n)!=EOF){        if(n==1)        printf("2\n3\n5\n7\n");        else        for(i=0;i<4;++i)        AddDigit(num[i],1,n);}    return 0;}