Pagini recente » Cod sursa (job #2814933) | Cod sursa (job #2077377) | Cod sursa (job #1249956) | Cod sursa (job #1876633) | Cod sursa (job #1308230)
#include<iostream>
#include<stdio.h>
using namespace std;
int n,v,i,sol[10];
FILE *f,*g;
int valid(int k)
{
for(i=1;i<k;i++)
if(sol[i]==sol[k])
return 0;
return 1;
}
int back(int k)
{
if(k==n+1)
{
for(i=1;i<=n;i++)
fprintf(g,"%d ",sol[i]);
fprintf(g,"\n");
}
else
{
sol[k]=0;
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);
}