Cod sursa(job #3307268)
| Utilizator | Data | 19 august 2025 15:11:14 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, m, x[20];
ifstream f("combinari.in");
ofstream g("combinari.out");
int afis()
{
for(int i = 1; i <= m; i++)
g << x[i] << ' ';
g << '\n';
}
void bt(int k)
{
if(k <= m)
{
for(int i = x[k - 1] + 1; i <= n - m + k; i++)
{
x[k] = i;
bt(k + 1);
}
}
else afis();
}
int main()
{
f >> n >> m;
bt(1);
f.close();
g.close();
return 0;
}
