Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //sa se genere totae numerele de k cifre ( 1 - 10 ) care au cifrele in ordine strict cresctoare si sunt nr prime
- #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;
- }
- se citeste un vector. sa se verifice daca toate elem. vectorului sunt nr prime afisand da sau nu
- #include <iostream>
- #include <fstream>
- #include <cmath>
- using namespace std;
- ifstream f("date.in");
- ofstream g("date.out");
- int v[100],n;
- int verif (int x)
- {
- int nrp=0,nri=0,i,c;
- while (x)
- {
- c=x%10;
- if (c%2==0)
- nrp+=c;
- else
- nri+=c;
- x=x/10;
- }
- if (nrp>nri)
- return 1;
- return 0;
- }
- int prim(int x)
- {
- int i;
- if (x<=1)
- return 0;// nu e prim
- if (x%2==0 && x!=2)
- return 0;// nu e prim
- for (i=3;i<=sqrt(x);i=i+2)
- if (x%i==0)
- return 0; // nu e prim
- return 1; // e prim
- }
- int div(int s,int d)
- {
- if (s==d)
- {
- if (prim(v[s])==1)
- return 1;
- else
- return 0;
- }
- else
- {
- int mij;
- mij=(s+d)/2;
- return div(s,mij) + div(mij+1,d);
- }
- }
- int main()
- {
- int i;
- cin>>n;
- for (i=1;i<=n;i++)
- cin>>v[i];
- if ( div(1,n) == n)
- cout<<"DA";
- else
- cout<<"NU";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement