/ OPS / 题库 /

Superprime Rib

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.

#格式#
##输入格式##
A single line with the number N.
N=0 means the end.

##输出格式##
The superprime ribs of length N, printed in ascending order one per line.

#样例1#
##样例输入1##

4

##样例输出1##

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

#限制#
1000ms
32768KB

#提示#

#来源#

信息

ID
1272
难度
5
分类
category1 点击显示
标签
递交数
0
已通过
0
通过率
?
上传者