Pagini recente » Borderou de evaluare (job #2468135) | Borderou de evaluare (job #1180060) | Cod sursa (job #458058) | Cod sursa (job #2779855) | Cod sursa (job #590899)
Cod sursa(job #590899)
#include<stdio.h>
int st[20],n,k;
int back(int p)
{
int i;
if(p==k+1)
{
for(i=1;i<=k;i++)
printf("%d ",st[i]);
printf("\n");
}else
for(i=st[p-1]+1;i<=n-k+p;i++)
{
st[p]=i;
back(p+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(1);
return 0;
}