Pagini recente » Cod sursa (job #395380) | Cod sursa (job #392782) | Borderou de evaluare (job #2879275) | Borderou de evaluare (job #369753) | Cod sursa (job #1050954)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("permutari.in");
ofstream g ("permutari.out");
int n,sol[9];
void bk (int k)
{
int ok;
if (k==n+1)
{
for(int i=1;i<=n;i++)
g<<sol[i]<<' ';
g<<'\n';
}
else
{
for (int i=1;i<=n;i++)
{
ok=1;
sol[k]=i;
for (int j=1;j<k;j++)
if (sol[j]==sol[k])
{
ok=0;
j=k+1;
}
if(ok)
bk(k+1);
}
}
}
int main()
{
f>>n;
bk(1);
f.close();
g.close();
return 0;
}