Cod sursa(job #2549424)
| Utilizator | Data | 17 februarie 2020 17:57:44 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int dim = 19;
int n, k, sol[dim];
void bkt(int l)
{
if(l > k)
{
for(int i = 1;i <= k;i++)
out<<sol[i]<<' ';
out<<'\n';
}
else
{
for(int i = sol[l - 1] + 1;i <= n - k + l;i++)
{
sol[l] = i;
bkt(l + 1);
}
}
}
int main()
{
in>>n>>k;
bkt(1);
return 0;
}
