Cod sursa(job #2980660)
Utilizator | Data | 16 februarie 2023 18:28:46 | |
---|---|---|---|
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 n,m,st[20];
void afis(){
for(int i=1;i<=m;i++) fout<<st[i]<<' ';
fout<<'\n';
}
void back(int k){
for(int i=st[k-1]+1;i<=n;i++){
st[k]=i;
if(k<=m){
if(k==m) afis();
else back(k+1);
}
}
}
int main(){
fin>>n>>m;
back(1);
return 0;
}
/*
4 3
*/