Cod sursa(job #153613)
Utilizator | Data | 10 martie 2008 17:17:08 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream.h>
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,c[40];
void combinari(int);
void afisare();
int main()
{ f>>n>>m;
combinari(1);
return 0;
}
void combinari(int k)
{ if(k-1==m)
afisare();
else
for(int i=c[k-1]+1;i<=n-m+k;i++)
{ c[k]=i;
combinari(k+1);
}
}
void afisare()
{ for(int i=1;i<=m;i++)
g<<c[i]<<' '; g<<"\n";
}