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