Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int st[11], n;
- int v[]={0,1,3,7};
- bool prim(int x)
- {
- if(x<2) return 0;
- for(int i=2;i*i<=x;i++)
- if(x%i==0) return 0;
- return 1;
- }
- bool valid(int k)
- {
- if(k==1&&st[k]==0) return 0;
- return 1;
- }
- bool solutie(int k)
- {
- return k==n;
- }
- void afis(int k)
- {
- int x=0, i;
- for(i=1;i<=k;i++)
- x=x*10+st[i];
- if(prim(x))
- {
- cout<<x<<endl;
- }
- }
- void back(int k)
- {
- int i;
- for(i=0;i<=3;i++)
- {
- st[k]=v[i];
- if(valid(k))
- if(solutie(k))
- afis(k);
- else
- back(k+1);
- }
- }
- int main()
- {
- cin>>n;
- back(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement