Pagini recente » Algoritmiada 2011 - Clasament Runda 2, Clasele 10-12 | Cod sursa (job #1386698) | Cod sursa (job #659041) | Borderou de evaluare (job #3035661) | Cod sursa (job #1393550)
#include <fstream>
using namespace std;
FILE *f=fopen("permutari.in","r");
FILE *g=fopen("permutari.out","w");
int n,p[10],viz[10];
void perm(int k);
void write();
int main()
{
fscanf(f,"%d",&n);
perm(1);
return 0;
}
void perm(int k)
{
int i=0;
if (k==n+1)
write();
else
{
for (i=1;i<=n;i++)
if (!viz[i])
{
p[k]=i;
viz[i]=1;
perm(k+1);
viz[i]=0;
}
}
}
void write()
{
for (int i=1;i<=n;i++)
fprintf(g,"%d ",p[i]);
fprintf(g,"\n");
}