Cod sursa(job #2790102)
| Utilizator | Data | 28 octombrie 2021 14:20:41 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, st[20];
void write(int top)
{
for(int i = 1; i < top; i ++)
fout << st[i] << " ";
fout << '\n';
}
void Back(int top)
{
if(top == k + 1)
write(top);
else
{
for(int i = st[top - 1] + 1; i <= n; i ++)
{
st[top] = i;
Back(top + 1);
}
}
}
int main()
{
fin >> n >> k;
Back(1);
return 0;
}
