Cod sursa(job #2771660)
| Utilizator | Data | 28 august 2021 15:58:47 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int N, K, x[19];
void read()
{
f >> N >> K;
}
bool valid(int k)
{
return x[k] > x[k - 1];
}
void afis()
{
for(int i = 1; i <= K; i++)
g << x[i] << ' ';
g << '\n';
}
void backt(int k)
{
for(int i = x[k - 1] + 1; i <= N; i++)
{
x[k] = i;
if(k == K)
afis();
else
backt(k + 1);
}
}
int main()
{
read();
backt(1);
return 0;
}
