Cod sursa(job #2668712)
Utilizator | Data | 5 noiembrie 2020 11:01:54 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, m, x[20];
void BK(int k)
{
for(int i = k; i <= n; i++)
{
x[k] = i;
if(x[k] > x[k - 1])
{
if(k == m)
{
for(int i = 1; i <= k; i++)
fout << x[i] <<' ';
fout<<'\n';
}
else
BK(k+1);
}
}
}
int main()
{
fin >> n >> m;
BK(1);
return 0;
}