Pagini recente » Infoarena Monthly 2014 - Solutii Runda 2 | Monitorul de evaluare | Cod sursa (job #3292868) | Cod sursa (job #3284450) | Cod sursa (job #3293889)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
vector<int> v;
int main()
{
int n;
cin>>n;
for(int i = 1; i <= n; ++i)
v.push_back(i);
for (int i = 0; i < n; ++i)
cout << v[i] << ' ';
cout<<"\n";
while(next_permutation(v.begin(), v.end()))
{
for (int i = 0; i < n; ++i)
cout << v[i] << ' ';
cout << '\n';
}
return 0;
}