1.5.3---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.

PROGRAM NAME: sprime

INPUT FORMAT

A single line with the number N.

SAMPLE INPUT (file sprime.in)

4

OUTPUT FORMAT

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

SAMPLE OUTPUT (file sprime.out)

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

（翻译来自于百度文库）

农民约翰母牛总是产生最好的肋骨。 
你能通过农民约翰和美国农业部标记在每根肋骨上的数字认出它们。 
农民约翰确定他卖给买方的是真正的质数肋骨,是因为从右边开始切下肋骨,每次还剩下的肋骨上的数字都组成一个质数,举例来说: 7 3 3 1 
全部肋骨上的数字 7331是质数;三根肋骨 733是质数;二根肋骨 73 是质数;当然,最后一根肋骨 7 也是质数。 
7331 被叫做长度 4 的特殊质数。 
写一个程序对给定的肋骨的数目 N (1<=N<=8),求出所有的特殊质数。 数字1不被看作一个质数。

/*
ID:******
PROG:sprime
LANG:C++
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstring>
using namespace std;
int st[9];//st[i]表示高i位的测试结果
int length;//记录要求规模
ofstream fout ("sprime.out");
ifstream fin ("sprime.in");
int prime(int test){//判断是否为质数
for(int i=2;i<=sqrt((double)test);i++)
if(test%i==0) return 0;
return 1;
}
void rib(int now){//测试过程
int temp;
for(int j = 0;j <= 9;j ++)//测试第now位的值
{
temp = st[length - now-1] * 10 + j;//now位测试实例为前now-1位的结果加第now位的测试值
if(prime(temp))
{
st[length - now] = temp;//如果符合要求则记录此测试结果 
if(now == 1)//最后一位的处理
fout<<temp<<endl;
else
rib(now - 1);//非最后一位则进入下一位的测试
}
}

}
int main(){
fin>>length;
for(int ii = 2; ii <=7 ;ii ++)//最高位
{
if(prime(ii))
{
st[0] = ii;
rib(length - 1);//开始搜索
}
}
return 0;
}