Cod sursa(job #1418204)
| Utilizator | Data | 12 aprilie 2015 12:58:49 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
#include <stdlib.h>
#define MAXN 19
FILE*fi,*fout;
int v[MAXN],n,k;
void comb(int x){
int i;
if(x==k+1){
for(i=1;i<=k;i++)
fprintf(fout,"%d " ,v[i]);
fprintf(fout,"\n");
}
else
for(i=v[x-1]+1;i<=n-(k-x);i++){
v[x]=i;
comb(x+1);
}
}
int main(){
fi=fopen("combinari.in" ,"r");
fout=fopen("combinari.out" ,"w");
fscanf(fi,"%d%d" ,&n,&k);
comb(1);
fclose(fi);
fclose(fout);
return 0;
}
