Cod sursa(job #780245)
Utilizator | Data | 20 august 2012 08:30:28 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,c[25];
void comb(int p);
int main()
{
f>>n>>k;
comb(1);
f.close();
g.close();
return 0;
}
void comb(int p){
int i;
if(p>k){
for(i=1;i<=k;i++)
g<<c[i]<<' ';
g<<'\n';}
else{
for(i=c[p-1]+1;i<=n-k+p;i++){
c[p]=i;
comb(p+1);}}}