Cod sursa(job #2913414)
Utilizator | Data | 14 iulie 2022 12:43:34 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, x[101];
void afisare()
{
for(int i = 1; i <= k; i++)
fout << x[i] << " ";
fout << "\n";
}
void back(int pas)
{
for(int i = x[pas - 1] + 1; i <= n - (k - pas); i++)
{
x[pas] = i;
if(pas == k)
afisare();
else
back(pas + 1);
}
}
int main()
{
fin >> n >> k;
back(1);
return 0;
}