Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- ifstream in ("permutari2.in");
- ofstream out ("permutari2.out");
- int n, x[10], v[10];
- int valid (int i)
- {
- for (int k=1; k<i; k++)
- if (v[k]==v[i])
- return 0;
- return 1;
- }
- void afis()
- {
- for (int k=1; k<=n; k++)
- out<<x[v[k]]<<" ";
- out<<endl;
- }
- void Back ()
- {
- int i=1;
- while (i)
- {
- v[i]++;
- if (v[i]>n)
- {
- v[i]=0;
- i--;
- }
- else
- if (valid(i))
- {
- if (i==n)
- afis();
- i++;
- }
- }
- }
- int main()
- {
- in>>n;
- for(int i=1; i<=n; i++)
- in>>x[i];
- sort(x+1, x+n+1);
- Back ();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement