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