Pagini recente » Cod sursa (job #1108355) | Cod sursa (job #2924252) | Cod sursa (job #1916295) | Cod sursa (job #2705521) | Cod sursa (job #173551)
Cod sursa(job #173551)
#include<stdio.h>
long int s[1001],n,c,k;
void back(long int c)
{long int i,j;
int ok;
if(c==k)
{for(i=1;i<=k;i++)
printf("%ld",s[i]);
printf("\n");
}
else
{for(i=1;i<=n;i++)
{ok=1;
for(j=1;j<=c;j++)
if(s[j]==i)
{ok=0;
break;
}
if(ok)
{s[c+1]=i;
back(c+1);
}
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%ld %ld",&n,&k);
back(0);
return 0;
}