Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int x[100],a[100],n,k,i,as,ev;
- void init(int k)
- {
- x[k]=0;
- }
- int succesor(int k)
- {
- if(x[k]<a[k]){x[k]++;return 1;}
- else return 0;
- }
- int valid(int k)
- {
- return 1;
- }
- int solutie(int k)
- {
- return(k==n);
- }
- void tipar(int k)
- {
- for(i=1;i<=k;i++)cout<<x[i]<<" ";
- cout<<endl;
- }
- void bt()
- {
- k=1;init(k);
- while(k!=0)
- {
- as=1;
- ev=0;
- while(as==1&&ev==0)
- {
- as=succesor(k);
- if(as==1)ev=valid(k);
- }
- if(ev==1)if(solutie(k)==1)tipar(k);
- else{k++;init(k);}
- else k--;
- }
- }
- int main()
- {
- cin>>n;
- for(i=1;i<=n;i++)
- cin>>a[i];
- bt();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement