Pagini recente » Cod sursa (job #2959015) | Clasament Teme ACM Unibuc 2013 | Cod sursa (job #1306395) | Cod sursa (job #3258269) | Cod sursa (job #1550709)
#include <iostream>
#include <fstream>
using namespace std;
int n;
int st[9];
ifstream fi("permutari.in");
ofstream fo("permutari.out");
bool check(int k)
{
for (int i = 1; i < k; i++)
if (st[i] == st[k])
return false;
return true;
}
void write()
{
for (int i = 1; i <= n; i++)
fo << st[i] << " ";
fo << "\n";
}
void perm(int k)
{
for (int i = 1; i <= n; i++)
{
st[k] = i;
if (check(k))
{
if (k == n)
write();
else
perm(k + 1);
}
}
}
int main()
{
fi >> n;
perm(1);
fi.close();
fo.close();
return 0;
}