Cod sursa(job #200249)
Utilizator | Data | 22 iulie 2008 21:06:46 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<stdio.h>
FILE *fout;
int n,m,s[20];
void afis(){
int i;
for(i=1;i<=m;i++)
fprintf(fout,"%d ",s[i]);
fprintf(fout,"\n");
}
void btk(){
int k,up;
k=1;s[k]=0;
while(k){
up=0;
while(!up&&s[k]<n){
s[k]++;
up=1;
}
if(up)
if(k==m) afis();
else {k++;s[k]=s[k-1];}
else k--;
}
}
int main(){
freopen("combinari.in","r",stdin);
fout=fopen("combinari.out","w");
scanf("%d%d",&n,&m);
btk();
return 0;
}