Pagini recente » Cod sursa (job #1439381) | Cod sursa (job #2546978) | Cod sursa (job #2777738) | Cod sursa (job #1896311) | Cod sursa (job #1923667)
#include <bits/stdc++.h>
using namespace std;
int factorial(int s)
{
if (s<=1){return 1;}
else {return s*factorial(s-1);}
}
int main()
{
ifstream input;
input.open("permutari.in");
int n;
input>>n;
vector<int> v;
for (int i=1;i<=n;i++){
v.push_back(i);
}
for (auto it=v.begin();it!=v.end();it++){
cout<<*it<<" ";
}
cout<<'\n';
int k=1;
while(k<factorial(n)){
next_permutation(v.begin(),v.end());
for (auto it=v.begin();it!=v.end();it++){
cout<<*it<<" ";
}
cout<<'\n';
k++;
}
input.close();
}