Cod sursa(job #1516904)
Utilizator | Data | 3 noiembrie 2015 18:30:19 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int max=18;
int n, k, v[19];
void bkt(int i)
{
if(i<=k)
{
for(int j=v[i-1]+1;j<=n;++j)
{
v[i]=j;
bkt(i+1);
}
}
else
{
for(int i=1;i<=k;i++)
{
out<<v[i]<<' ';
}
out<<'\n';
}
}
int main(){
in>>n>>k;
bkt(1);
return 0;
}