Pagini recente » Cod sursa (job #1715363) | Cod sursa (job #1056557) | Cod sursa (job #536807) | Cod sursa (job #890185) | Cod sursa (job #2450561)
#include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <queue>
#include <tuple>
#include <limits>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int main()
{
vector<int>vp;
int n;
fin >> n;
for (int i = 1; i <= n; i++) vp.push_back(i);
do
{
for (int i = 0; i < n; i++)
fout << vp[i] << ' ';
fout << '\n';
} while (next_permutation(vp.begin(), vp.end()));
}