Cod sursa(job #801032)
Utilizator | Vlad Dimulescu vladvaldez | Data | 23 octombrie 2012 10:37:37 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
FILE *f,*g;
using namespace std;
int c,n,k,x[1000];
void afis(int k)
{
int i;
for (i=1;i<=k;i++)
fprintf(g,"%d ",x[i]);
fprintf(g,"\n");
}
void back(int k)
{
int i;
for (i=x[k-1]+1;i<=n;i++)
{
x[k]=i;
if (k==c) afis(k);
else back(k+1);
}
}
int main()
{
f=fopen("combinari.in","r");
g=fopen("combinari.out","w");
fscanf(f,"%d %d",&n,&c);
back(1);
return 0;
}