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