Cod sursa(job #588074)
| Utilizator | Data | 6 mai 2011 21:14:21 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <cstdio>
FILE *g=fopen("combinari.in","r");
FILE *z=fopen("combinari.out","w");
using namespace std;
int n,k,st[900];
void afisare ()
{
for(int i=1;i<=k;i++)
fprintf(z,"%d ",st[i]);
fprintf(z,"\n");
}
void back(int niv)
{
int i;
for(i=1;i<=n;i++)
{
st[niv]=i;
if(st[niv-1]<st[niv] or niv==1)
{
if(niv==k)
afisare();
back(niv+1);
}
}
}
int main()
{
fscanf(g,"%d%d",&n,&k);
fclose(g);
back(1);
fclose(z);
return 0;
}
