Pagini recente » Cod sursa (job #1517216) | Cod sursa (job #1819204) | Monitorul de evaluare | Cod sursa (job #1612881) | Cod sursa (job #1513891)
#include <iostream>
#include <fstream>
#define nmax 9
using namespace std;
ifstream fi("permutari.in");
ofstream fo("permutari.out");
int n, k;
int st[nmax];
void read();
void back(int k);
int main()
{
read();
back(1);
fi.close();
fo.close();
return 0;
}
void read()
{
fi >> n;
}
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 back(int k)
{
for (int i = 1; i <= n; i++)
{
st[k] = i;
if (check(k))
{
if (k == n)
write();
else
back(k+1);
}
}
}