Cod sursa(job #1304592)
| Utilizator | Data | 29 decembrie 2014 00:03:46 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
int a[20];
int n,k;
FILE *fin,*fout;
void ver()
{
for(int i=1;i<=k;i++) fprintf(fout,"%d ",a[i]);
fprintf(fout,"\n");
}
void bcs(int pos)
{
if(pos==k+1) ver();
else
{
for(int i=a[pos-1]+1;i<=n;i++)
{
a[pos]=i;
bcs(pos+1);
}
}
}
int main()
{
fin=fopen("combinari.in","r");
fout=fopen("combinari.out","w");
fscanf(fin,"%d%d",&n,&k);
bcs(1);
}
