#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
int i,j,k,n,m;
int prime[10010],p[10010],num,d[10010];
bool pd(int x){
m=d[(int)sqrt(x)];
for(j=1;j<=m;j++)
if(x%prime[j]==0)
return false;
return true;
}
void dfs(int x,int y){
if(y==n)
printf("%d\n",x);
for(i=1;i<=9;i+=2)
if(i!=5){
k=x*10+i;
if(pd(k)){
dfs(k,y+1);
}
}
}
int main(){
freopen("sprime.in","r",stdin);
freopen("sprime.out","w",stdout);
scanf("%d",&n);
p[1]=1;
for(i=2;i<=10000;i++){
j=i;
if(p[i]) continue;
while(j<=10000){
j+=i;
p[j]=1;
}
}
for(i=2;i<=10000;i++)
if(!p[i]){
prime[++num]=i;
d[i]=num;
}
else d[i]=d[i-1];
dfs(2,1);
dfs(3,1);
dfs(5,1);
dfs(7,1);
return 0;
}
usaco sprime
最新推荐文章于 2017-07-11 13:18:08 发布