Cod sursa(job #3321647)
| Utilizator | Data | 10 noiembrie 2025 18:38:40 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
const int NMAX = 18;
int n, m, x[NMAX + 1];
void afisare()
{
for (int i = 1; i <= m; i++)
g << x[i] << ' ';
g << '\n';
}
void bkt(int k)
{
if (k == m + 1)
afisare();
else
{
for (int i = x[k - 1] + 1; i <= n - m + k; i++)
{
x[k] = i;
bkt(k + 1);
}
}
}
int main()
{
f >> n >> m;
bkt(1);
f.close();
g.close();
return 0;
}
