Pagini recente » Cod sursa (job #2693785) | Borderou de evaluare (job #1516736) | Cod sursa (job #1609031) | Cod sursa (job #721407) | Cod sursa (job #311520)
Cod sursa(job #311520)
#include<stdio.h>
int main()
{int k=1,up,i,m,n,s[30];
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
for (s[k]=0;k;)
{
up=0;
while(!up&&s[k]<n-m+k)
{
s[k]++;
up=1;
}
if(up)
if(k==m)
{ for(i=1;i<=m;i++)
printf("%d ",s[i]);
printf("\n");
}
else k++,s[k]=s[k-1];
else
k--;
}
return 0;
}