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