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