Cod sursa(job #871199)
| Utilizator | Data | 4 februarie 2013 16:15:00 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<stdio.h>
FILE *in,*out;
int n,k,st[19],p;
void back(int k);
void tipar (int k);
int main(void)
{
in=fopen("combinari.in","rt");
out=fopen("combinari.out","wt");
fscanf(in,"%d%d",&n,&p);
back(1);
fclose(in);
fclose(out);
return 0;
}
void back(int k)
{
for(st[k]=st[k-1]+1;st[k]<=n;++st[k])
{
if(k==p)
tipar(k);
else
back(k+1);
}
}
void tipar (int k)
{
for(int i=1;i<=p;++i)
fprintf(out,"%d ",st[i]);
fprintf(out,"\n");
}
