Cod sursa(job #2362228)
| Utilizator | Data | 3 martie 2019 00:33:40 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | pregatire_cls12_oji | Marime | 0.5 kb |
#include <bits/stdc++.h>
#define len 19
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
typedef unsigned short ushort;
ushort N, K, sol[len];
void type()
{
for(ushort i = 1; i <= K;)
out << sol[i++] << ' ';
out << '\n';
}
void back(ushort k)
{
for(ushort i = sol[k - 1] + 1; i <= N; ++i)
{
sol[k] = i;
k == K ? type() : back(k + 1);
}
}
int main()
{
in >> N >> K;
back(1);
return 0;
}
