Pagini recente » Cod sursa (job #50440) | Cod sursa (job #1310051) | Cod sursa (job #887920) | Cod sursa (job #1469710) | Cod sursa (job #1389801)
#include <fstream>
#include <iostream>
using namespace std;
int a[10001],sol[10001],i,k,n;
ifstream f("permutari.in");
ofstream g("permutari.out");
void afis()
{
int i;
for (i=1; i<=n; i++)
g<<a[sol[i]]<<" ";
g<<"/n";
}
bool ok(int k)
{
int i;
for (i=1; i<k; i++)
if (sol[i]==sol[k]) return false;
return true;
}
void back(int k)
{
int i;
if (k>n) afis();
else
for (i=1; i<=n; i++)
{
sol[k]=i;
if (ok(k)) bac(k+1);
}
}
int main()
{
f>>n;
k=n;
for (i=1; i<=n; i++) a[i]=i;
bac(1);
return 0;
}