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