Cod sursa(job #154225)
Utilizator | Data | 11 martie 2008 00:01:00 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
# include <stdio.h>
int st[20];
int N,K;
FILE *f=fopen("combinari.in","r"),*g=fopen("combinari.out","w");
void back(int k)
{
int i,j;
if (k==K+1){
for (j=1;j<=K;j++)
fprintf(g,"%d ",st[j]);
fprintf(g,"\n");
}
else {
for (i=st[k-1]+1;i<=N;i++)
{
st[k]=i;
back(k+1);
}
}
}
int main()
{
fscanf(f,"%d %d",&N,&K);
fclose(f);
back(1);
fclose(g);
return 0;
}