Cod sursa(job #681217)
| Utilizator | Data | 16 februarie 2012 19:38:25 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
int v[20];
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
int n, k, i, st;
scanf("%d %d",&n,&k);
st=1;
v[st]=0;
while(st>0){
v[st]++;
if(v[st]>n){
st--;
v[st]++;
}
if(st==k && v[st]<=n){
for(i=1; i<=k; ++i)
printf("%d ",v[i]);
printf("\n");
}
else{
if(v[st]>n){
v[st]=0;
st--;
}
else{
st++;
v[st]=v[st-1];
}
}
}
}
