Cod sursa(job #2839392)
Utilizator | Data | 25 ianuarie 2022 20:57:50 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int dim=10;
int n,k,sol[dim],fv[dim];
void backtracking(int pas){
for(int i=sol[pas-1]+1;i<=n;i++){
sol[pas]=i;
if(pas==k){
for(int j=1;j<=k;j++){
fout<<sol[j]<<' ';
}
fout<<'\n';
}
else{
backtracking(pas+1);
}
}
}
signed main(){
fin>>n>>k;
backtracking(1);
}