Pagini recente » Cod sursa (job #2683140) | Cod sursa (job #1902529) | Cod sursa (job #2330529) | Cod sursa (job #2624227) | Cod sursa (job #2118470)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int sol[1000], n, k, a[10000], i;
void afis()
{
int i;
for (i=1; i<=n; i++)
g<<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 back(int k)
{
int i;
if (k>n)
afis();
else
for (i=1; i<=n; i++)
{sol[k]=i;
if (ok(k))
back(k+1);}
}
int main()
{
f>>n;
back(1);
}