Cod sursa(job #3310656)
| Utilizator | Data | 15 septembrie 2025 18:12:24 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int NMAX = 21;
int v[NMAX], n, k;
void afisare()
{
int i;
for(i = 1; i <= k; i++)
fout<< v[i]<<" ";
fout<<'\n';
}
void bkt(int poz)
{
int i;
for(i = v[poz-1]+1; i <= n; i++)
{
v[poz] = i;
if(poz == k)
afisare();
else
bkt(poz+1);
}
}
int main()
{
fin>> n>> k;
bkt(1);
fin.close();
fout.close();
return 0;
}
