Pagini recente » Borderou de evaluare (job #1794929) | Borderou de evaluare (job #2958324) | Borderou de evaluare (job #308307) | Borderou de evaluare (job #1575072) | Cod sursa (job #568980)
Cod sursa(job #568980)
#include <fstream>
#include <stdio.h>
using namespace std;
int a[10],b[10];
void back(int k,int len)
{
int i;
if(k-1==len)
{
for(i=1;i<=len;i++)
printf("%d",a[i]);
printf("\n");
}
else for(i=1;i<=len;i++)
{
if(!b[i])
{
a[k]=i;
b[i]=1;
back(k+1,len);
b[i]=0;
}
}
}
int main()
{
freopen("kfib.in","r",stdin);
freopen("kfib.out","w",stdout);
int n;
scanf("%d",&n);
back(1,n);
return 0;
}