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.

### INPUT FORMAT

A single line with the number N.

```4
```

### OUTPUT FORMAT

The superprime ribs of length N, printed in ascending order one per line.

```2333
2339
2393
2399
2939
3119
3137
3733
3739
3793
3797
5939
7193
7331
7333
7393
```

## My Solution

/*
ID: codetri1
LANG: C
*/
#include <stdio.h>
#include <math.h>

FILE *in,*out;

int isprime(int a){
int i;
if (a==1) return 0;
for (i=2;i<=sqrt(a);i++) if (a%i==0) return 0;
return 1;
}

int find(int digit,int num,int n){
int i;
if (digit>n) fprintf(out,"%d\n",num);
else for (i=1;i<=9;i+=2) if (isprime(num*10+i)) find(digit+1,num*10+i,n);
}

int main(){
in=fopen("sprime.in","r");
out=fopen("sprime.out","w");
int i,n;
fscanf(in,"%d",&n);
find(2,2,n);
find(1,0,n);
return 0;
}