Cod sursa(job #2393378)
| Utilizator | Data | 31 martie 2019 13:30:25 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
void afisare();
int n, k, v[20];
void bkt(int i)
{
if(i == k+1)
afisare();
else for(int j=v[i-1]+1; j<=n; j++)
{
v[i] = j;
bkt(i+1);
}
}
int main()
{
fin >> n >> k;
bkt(1);
return 0;
}
void afisare()
{
for(int i=1; i<=k; i++)
fout << v[i] << ' ';
fout << '\n';
}
