Cod sursa(job #334541)
| Utilizator | Data | 27 iulie 2009 10:55:25 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
FILE *f,*g;
int sol[20],n,k;
void back(int p)
{ int i;
{ if (p==k+1)
for(i=1;i<=k;i++)
fprintf(g,"%d ",sol[i]);
fprintf(g,"\n");
}
{sol[p]=0;
for(i=sol[p-1]+1;i<=n;i++)
{ sol[p]=i;
back(p+1);
}
}
}
int main()
{ f=fopen("combinari.in","r");
g=fopen("combinari.out","w");
fscanf(f,"%d %d",&n,&k);
back(1);
return 0;
}
