Cod sursa(job #2923628)
Utilizator | Data | 16 septembrie 2022 21:57:02 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int NMAX = 20;
int N, K;
int v[NMAX];
void Afisare()
{
for(int i = 1; i <= K; ++i)
fout << v[i] << ' ';
fout << '\n';
}
void Back(int level)
{
if(level > K) {
Afisare();
return;
}
for(int i = v[level - 1] + 1; i <= N; ++i) {
v[level] = i;
Back(level + 1);
}
}
int main()
{
fin >> N >> K;
Back(1);
return 0;
}