Cod sursa(job #2640463)
Utilizator | Data | 6 august 2020 15:45:22 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, sol[25], m;
void afis(){
for(int i = 1; i <= m; i++)
out<<sol[i]<<" ";
out<<"\n";
}
void bkt(int k){
if(k == m)
afis();
for(int i = sol[k] + 1; i <= n; i++){
sol[k + 1] = i;
bkt(k + 1);
}
}
int main(){
in>>n>>m;
bkt(0);
}