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