Cod sursa(job #155310)
Utilizator | Robert Hangu Robybrasov | Data | 11 martie 2008 21:03:10 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
int st[18],n,k;
FILE *f,*g;
void comb(int p)
{
int i,j;
for (i=st[p-1]+1; i<=n; i++)
{
st[p]=i;
if (p==k)
{
for (j=1; j<=k; j++) fprintf(g,"%d ",st[j]);
fprintf(g,"\n");
}
else comb(p+1);
}
}
int main()
{
f=fopen("combinari.in","r");
g=fopen("combinari.out","w");
fscanf(f,"%d %d",&n,&k);
st[0]=0;
comb(1);
return 0;
}