Cod sursa(job #2013057)
| Utilizator | Data | 20 august 2017 13:15:29 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<stdio.h>
#define MAXN 19
void bkt(int cap,int size);
FILE*fin,*fout;
int N,K;
int v[MAXN];
int main()
{
fin=fopen("combinari.in","r");
fout=fopen("combinari.out","w");
fscanf(fin,"%d%d",&N,&K);
bkt(1,1);
fclose(fin);
fclose(fout);
return 0;
}
void bkt(int cap,int size)
{
if(size==K+1)
{
for(int i=1;i<=K;i++)
{
fprintf(fout, "%d ", v[i]);
}
fprintf(fout, "\n");
return;
}
for(int i=cap;i<=N;i++)
{
v[size]=i;
bkt(i+1,size+1);
}
}
