Cod sursa(job #2748846)
| Utilizator | Data | 3 mai 2021 19:37:28 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
int st[22],n,k;
ifstream in("combinari.in");
ofstream out("combinari.out");
void afisare()
{
int i;
for(i=1;i<=k;
++i)
out<<st[i]<<" ";
out<<'\n';
}
void bkt(int vf){
int i;
if(vf==k+1)
afisare();
else
for(i=st[vf-1]+1;i<=n;++i)
{
st[vf]=i;
bkt(vf+1);
}
}
int main()
{
in>>n>>k;
bkt(1);
return 0;
}
