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