Cod sursa(job #2345693)
| Utilizator | Data | 16 februarie 2019 16:47:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int a[20];
int n,k;
void backtracking(int lvl,int prec){
if (lvl==k+1){
for (int i=1;i<=k;i++) fout<<a[i]<<" ";
fout<<'\n';
}
else{
for (int i=prec+1;i<=n;i++){
a[lvl]=i;
backtracking(lvl+1,i);
}
}
}
int main(){
fin>>n>>k;
backtracking(1,0);
return 0;
}
