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