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