Pagini recente » Cod sursa (job #2542524) | Cod sursa (job #3227152) | Cod sursa (job #565136) | Cod sursa (job #109159) | Cod sursa (job #3159107)
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define ll long long
#define ull unsigned long long
#define nmax 5000006
#define MOD 1999999973
#define INF 2123456789
//#define fin cin
//#define fout cout
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n;
int sol[nmax];
int fr[nmax];
void Afis()
{
for (int i = 1; i <= n; i++)
fout << sol[i] << " ";
fout << "\n";
}
void Back(int k)
{
for (int i = 1; i <= n; i++)
if (!fr[i])
{
sol[k] = i;
fr[i] = 1;
if (k == n)
Afis();
else
Back(k + 1);
fr[i] = 0;
}
}
int main()
{
fin >> n;
Back(1);
fin.close();
fout.close();
return 0;
}