Pagini recente » Egyptian Fractions | Cod sursa (job #1621747) | Cod sursa (job #1576838) | Cod sursa (job #1952758) | Cod sursa (job #1372805)
#include <bits/stdc++.h>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int v[10],n,k,i,j;
void write()
{
for(int i=1;i<=n;++i)
g<<v[i]<<" ";
g<<endl;
}
bool valid(int k)
{
for(int i=1;i<k;++i)
if(v[i]==v[k])
return false;
return true;
}
void backt(int k)
{
for(int i=1;i<=n;++i)
{
v[k]=i;
if(valid(k))
{
if(k==n)
write();
else
backt(k+1);
}
}
}
int main()
{
f>>n;
backt(1);
return 0;
}