Cod sursa(job #3183060)
| Utilizator | Data | 10 decembrie 2023 15:52:20 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m, x[20];
void prelsol()
{
for(int i = 1; i <= m; i++)
fout << x[i] << ' ';
fout << '\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 prelsol();
}
int main()
{
fin >> n >> m;
bt(1);
fin.close();
fout.close();
return 0;
}
