Cod sursa(job #156055)
Utilizator | Data | 12 martie 2008 12:25:22 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<stdio.h>
FILE*fin=fopen("combinari.in","r");
FILE*fout=fopen("combinari.out","w");
int n,k,sol[30];
void back(int p)
{
int i;
for(i=sol[p-1]+1;i<=n;i++)
{
sol[p]=i;
if(p==k)
{
for(int j=1;j<=k;j++)
fprintf(fout,"%d%c",sol[j],' ');
fprintf(fout,"\n");
}
else back(p+1);
}
}
int main()
{
fscanf(fin,"%d%d",&n,&k);
fclose(fin);
sol[0]=0;
back(1);
fclose(fout);
return 0;
}