Pagini recente » Diferente pentru onis-2014/clasament-final intre reviziile 22 si 21 | Atasamentele paginii Poligon6 | Borderou de evaluare (job #3268851) | Cod sursa (job #2752186) | Cod sursa (job #1169114)
#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";} }