Pagini recente » Cod sursa (job #1167827) | Cod sursa (job #1807223) | Cod sursa (job #1276143) | Cod sursa (job #943623) | Cod sursa (job #1013154)
#include <iostream>
#include <fstream>
using namespace std;
long sol[10];
long n;
ofstream g("permutari.out");
void back1 (long k)
{
long i,j;
bool ok;
if (k==n)
{
for (i=1;i<=n;i++)
g<<sol[i]<<" ";
g<<endl;
}
else
for (i=1;i<=n;i++)
{
ok=1;
for (j=1;j<=k;j++)
if (sol[j]==sol[i])
{
ok=0;
j=k+1;
}
if (ok)
{
sol[k+1]=i;
back1 (k+1);
}
}
}
int main()
{
ifstream f ("permutari.in");
ofstream g ("permutari.out");
f>>n;
back1(0);
f.close();
g.close();
return 0;
}