Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- void tipar(int *x,unsigned n)
- {
- static unsigned nr_sol = 1;
- std::cout << "Solutia numarul " << nr_sol++ << ": ";
- for (int i = 1; i < n; i++)
- std::cout << x[i] << " ";
- std::cout << endl;
- }
- bool conditie(int *x, unsigned k)
- {
- for (int i = 1; i < k;i++)
- if (x[k] == x[i])return false;
- return true;
- }
- void ciur_prim(int *v, unsigned nr_numere)
- {
- unsigned i = 0;
- int prim[100];
- for (int t = 2; t <= 100; t++)
- prim[i] = 1;
- for (int c = 2; c <= 100; c++)
- {
- for (int j = c*c; j < 100; j += c)
- prim[j] = 0;
- }
- int ok = 2,vf = 1,cont=0;
- for (int i = 2; i <= 100; i++)
- {
- if (prim[i] && ok % 2 == 0)
- {
- v[vf++] = i;
- cont++;
- }
- if (prim[i])
- ok++;
- if (cont == nr_numere)
- break;
- }
- }
- void bkt(int *x, int *prim, unsigned k, unsigned n)
- {
- if (k == n+1)
- tipar(x, k);
- else
- for (int i = 1; i <= n; i++)
- {
- x[k] = prim[i];
- if (conditie(x, k))
- bkt(x,prim,k+1,n);
- }
- }
- void main(void)
- {
- int v[10],x[10];
- unsigned n;
- std::cin >> n;
- ciur_prim(v, n);
- bkt(x,v, 1, n);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement