Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- #define MAX 10
- int x[MAX],nr[MAX],m,i,k;
- void init(int k)
- {
- x[k]=0;
- }
- int succesor(int k)
- {
- if(x[k]<nr[k])
- return 1;
- else
- return 0;
- }
- int continuare(int k)
- {
- if(k<m+1)
- return 1;
- return 0;
- }
- int solutie(int k)
- {
- if(k==m+1)
- return 1;
- else
- return 0;
- }
- void afisare()
- {
- for(int i=1;i<=m;++i)
- cout<<x[i]<<' ';
- cout<<'\n';
- }
- void backtracking()
- {
- int k=1;
- init(1);
- while(k)
- if(solutie(k))
- afisare(),--k;
- else
- if(succesor(k))
- {
- ++x[k];
- if(continuare(k))
- ++k;
- }
- else
- init(k),--k;
- }
- int main()
- {
- cout<<"m= "; cin>>m;
- cout<<"Numarul de elemente ";
- for (i=1;i<=m;++i)
- {
- cout<<"ale multimii "<<i<<" = ";
- cin>>nr[i];
- }
- backtracking();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement