Pagini recente » Cod sursa (job #1510121) | Istoria paginii problema/aiacuhexagoane | Diferente pentru problema/distractie intre reviziile 2 si 3 | Cod sursa (job #2061134) | Cod sursa (job #1169116)
#include <fstream>
#include <vector>
#include <algorithm>
int main() { std::ifstream f("permutari.in"); std::ofstream g("permutari.out"); int n = 1; f >> n; std::vector<int> x(n); int i; for (i=0; i<n; i++) {x[i] = i+1; g << i+1;} g << "\n"; while (next_permutation(x.begin(), x.end())) {for (i=0; i<n; i++) g << x[i]; g << "\n";} }