Pagini recente » Cod sursa (job #1860176) | Cod sursa (job #1921880) | Cod sursa (job #90156) | Cod sursa (job #1460198) | Cod sursa (job #3274018)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
int n, v[11];
void afis()
{
for (int i = 1; i <= n; i++)
fout << v[i] << " ";
fout << '\n';
}
bool verif(int k)
{
int f[11];
fill(f, f + 10, 0);
for (int i = 1; i <= k; i++)
f[v[i]]++;
for (int i = 1; i <= 9; i++)
if (f[i] > 1)
return false;
return true;
}
void bt(int k)
{
if (k > n)
afis();
else
{
for (int i = 1; i <= n; i++)
{
v[k] = i;
if (verif(k))
{
cout << "LOL";
bt(k + 1);
}
}
}
}
int main()
{
fin >> n;
bt(1);
return 0;
}