Pagini recente » Istoria paginii runda/test_unu/clasament | Istoria paginii runda/in_time/clasament | Istoria paginii runda/test_casian2/clasament | Atasamentele paginii oni-2015-11-12 | Cod sursa (job #2110693)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int main ()
{
int N;
vector<int> v;
in >> N;
for (int i = 1; i <= N; ++i)
v.push_back(i);
do {
for (int i = 0; i < N; ++i)
out << v[i] << ' ';
out << '\n';
} while (next_permutation(v.begin(), v.end()));
}