Pagini recente » Cod sursa (job #1129809) | Cod sursa (job #334669) | Cod sursa (job #856563) | Cod sursa (job #848913) | Cod sursa (job #1362126)
#include <fstream>
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<<endl;
}
bool ok(int k)
{int i;
for (i=1;i<k;i++)
if (sol[i]==sol[k]) return false;
return true;
}
void bac(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;
}