Cod sursa(job #1148223)
Utilizator | Data | 20 martie 2014 16:38:24 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
using namespace std;
FILE*f=fopen("combinari.in","r");
FILE*g=fopen("combinari.out","w");
int n,k,sol[20];
void bkt(int x)
{
if (x==k+1)
{
for (register int i=1;i<x;i++)
fprintf(g,"%d ",sol[i]);
fprintf(g,"\n");
return;
}
for (register int j=sol[x-1]+1;j<=n;j++)
{
sol[x]=j;
bkt(x+1);
}
}
int main()
{
fscanf(f,"%d %d",&n,&k);
bkt(1);
return 0;
}