Cod sursa(job #1566253)
| Utilizator | Data | 11 ianuarie 2016 22:07:48 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
int limit[20];
int sol[20];
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
int n,k,i;
scanf("%d %d",&n,&k);
for(i=1;i<=k;++i) sol[i]=i;
for(i=k;i>0;--i) limit[i]=n+i-k;
while(1)
{ for(i=1;i<k;++i) printf("%d ",sol[i]);
printf("%d\n",sol[i]);
for(i=k;i>0 && sol[i]==limit[i];--i);
sol[i]++;
if(!i) break;
for(++i;i<=k;++i) sol[i]=sol[i-1]+1;
}
return 0;
}
