Pagini recente » Cod sursa (job #636971) | Fmi no Stress 10 | Cod sursa (job #2433909) | Cod sursa (job #2572218) | Cod sursa (job #1872576)
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n, k, x[8];
bool cond()
{
for(int i = 1; i < k; ++i)
if(x[i] == x[k]) return 0;
return 1;
}
void afis()
{
for(int i = 1; i <= n; ++i)
g<<x[i]<<' ';
g<<'\n';
}
void backt()
{
k++;
for(int i = 1; i <= n; ++i)
{
x[k] = i;
if(cond())
{
if(k == n) afis();
else backt();
}
}
k--;
}
int main()
{
f>>n;
backt();
return 0;
}