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