Cod sursa(job #163919)
Utilizator | Nicolae Titus nicolaetitus12 | Data | 23 martie 2008 12:08:31 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
FILE *f,*fout;
int a[100],n,k;
void back(int p)
{for (int i=(p==1?1:(a[p-1]+1));i<=n;i++)
{a[p]=i;
if(p==k)
{for (int j=1;j<=k;j++)fprintf(fout,"%d ",a[j]);
fprintf(fout,"\n");
}
else
back(p+1);
}
}
int main ()
{f=fopen("combinari.in","r");
fout=fopen("combinari.out","w");
fscanf(f,"%d%d",&n,&k);
back(1);
fclose(fout);
return 0;
}