Cod sursa(job #2278313)
Utilizator | Data | 7 noiembrie 2018 17:13:53 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,sol[21],k;
void prelucrare(int k)
{
for(int i=1;i<=k;i++) out<<sol[i]<<" ";
if(k>0)out<<'\n';
}
void bkt(int p)
{
if(p-1==k)
{
prelucrare(p-1);
return;
}
for(int i=1+sol[p-1];i<=n;i++)
{
sol[p]=i;
bkt(p+1);
}
}
int main()
{
in>>n>>k;
bkt(1);
return 0;
}