Cod sursa(job #423789)
Utilizator | Data | 24 martie 2010 12:07:38 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int v[20],n,k;
void post()
{ for(int i=1;i<=k;i++)g<<v[i]<<' ';
g<<'\n';
}
void bek(int p)
{ for(int i=v[p-1]+1;i<=n-k+p;i++) { v[p]=i;
if(p==k)post();
else bek(p+1);
}
}
int main()
{ f>>n>>k;
bek(1);
return 0;
}