Cod sursa(job #2999865)
Utilizator | Data | 11 martie 2023 17:14:50 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k;
int v[20];
void afis(){
for(int i=1;i<=k;++i)
g<<v[i]<<" ";
g<<'\n';
}
void bkt(int pas){
for(int i=v[pas-1]+1;i<=n-k+pas;++i){
v[pas]=i;
if(pas<k)
bk(pas+1);
else
afis();
}
}
int main()
{
f>>n>>k;
bkt(1);
return 0;
}