Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <cmath>
- using namespace std;
- ifstream f("date.in");
- ofstream g("date.out");
- int st[10],k;
- void init()
- {
- cin>>k;
- }
- int prim(int x)
- {
- int i;
- if (x<=1)
- return 0;// nu e prim
- if (x%2==0)
- return 0;// nu e prim
- for (i=2;i<=sqrt(x);i++)
- if (x%i==0)
- return 0; // nu e prim
- return 1; // e prim
- }
- int valid(int p)
- {
- int i;
- for (i=1;i<p;i++)
- if (st[i]>=st[p])
- return 0;
- return 1;
- }
- int solutie(int p)
- {
- if (p!=k)
- return 0;
- int nr=0,i;
- return 1;
- }
- void afis()
- {
- int i,nr=0;
- for (i=1;i<=k;i++)
- nr=nr*10+st[i];
- if (prim(nr)==1)
- {cout<<nr;
- cout<<'\n';
- }
- }
- void backt(int p)
- {
- int i;
- for (i=1;i<=9;i++)
- {
- st[p]=i;
- if (valid(p))
- if (solutie(p))
- afis();
- else
- backt(p+1);
- }
- }
- int main()
- {
- init();
- backt(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement