Cod sursa(job #2020426)
| Utilizator | Data | 10 septembrie 2017 09:30:28 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.8 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, sol[20];
void afis()
{
for(int i = 1; i <= k; ++i) g << sol[i] << " ";
g << '\n';
}
void bkt(int nivel)
{
if(nivel == 1)
{
for(int i = 1; i <= n; ++i)
{
sol[nivel] = i;
bkt(nivel + 1);
}
}
else
{
for(int i = sol[nivel - 1] + 1; i <= n; ++i)
{
sol[nivel] = i;
if(nivel == k) afis();
else bkt(nivel + 1);
}
}
}
int main()
{
f >> n >> k;
bkt(1);
return 0;
}
