Pagini recente » Cod sursa (job #733482) | Cod sursa (job #2653109) | Cod sursa (job #2931322) | Cod sursa (job #2464072) | Cod sursa (job #1131945)
#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f,*g;
int n,S[30];
int F[30];
void back(int k)
{
int i,j,t;
if(k==n)
{
for(i=1;i<=n;++i)
fprintf(g,"%d ",S[i]);
fprintf(g,"\n");
}
else
for(i=1;i<=n;++i)
{
S[k+1]=i;
t=1;
if (F[i]==1)
t=0;
if(t==1)
{
++F[i];
back(k+1);
--F[i];
}
}
}
int main()
{
f=fopen("permutari.in","r");
g=fopen("permutari.out","w");
fscanf(f,"%d",&n);
back(0);
fclose(f);
fclose(g);
return 0;
}