Pagini recente » Cod sursa (job #1241465) | Cod sursa (job #2623025) | Cod sursa (job #75595) | Cod sursa (job #3157242) | Cod sursa (job #282659)
Cod sursa(job #282659)
#include <stdio.h>
int st[10],i,k,n,ev,as,m;
int main()
{freopen("combinari.in","r",stdin);freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
st[1]=0;k=1;
while(k)
{if(st[k]<n){st[k]++;as=1;}else as=0;
ev=1;if(st[k]<st[k-1])ev=0;
for(i=1;i<k;i++)if(st[i]==st[k])ev=0;
if(as){if(ev)if(k==m){for(i=1;i<=m;i++)printf("%d ",st[i]);printf("\n");}
else {k++;st[k]=0;}
}
else k--;
}
fclose(stdin);fclose(stdout);
return 0;
}