Cod sursa(job #422991)
| Utilizator | Data | 23 martie 2010 13:24:42 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
FILE *f=fopen("combinari.in","r");
FILE *g=fopen("combinari.out","w");
int x[19],n,m;
void tipar(int k) {
int i;
for(i=1;i<=k;i++)
fprintf(g,"%d ",x[i]);
fprintf(g,"\n");
}
void comb() {
int k;
k=1;
x[k]=0;
while(k>0)
if(x[k]<n) {
x[k]++;
if(k==m)
tipar(k);
else {
k++;
x[k]=x[k-1];
}
}
else
k--;
}
int main() {
fscanf(f,"%d%d",&n,&m);
comb();
return 0;
}
