Pagini recente » Cod sursa (job #170070) | Cod sursa (job #485775) | Cod sursa (job #606614) | Cod sursa (job #1271680) | Cod sursa (job #979544)
Cod sursa(job #979544)
#include<iostream>
#include<stdio.h>
using namespace std;
int sol[100],n;
FILE *f,*g;
int valid(int k)
{int i;
for(i=1;i<k;i++)
if(sol[k]==sol[i]) return 0;
return 1;
}
int back(int k)
{
int i;
if(k==n+1)
{for(i=1;i<=n;i++)
fprintf(g,"%d ",sol[i]);
fprintf(g,"\n");
}
else
{
while(sol[k]<n)
{sol[k]++;
if(valid(k))
back(k+1);
}
}
}
int main()
{f=fopen("permutari.in","r");
g=fopen("permutari.out","w");
fscanf(f,"%d",&n);
back(1);
}