Cod sursa(job #2500360)
Utilizator | Data | 27 noiembrie 2019 19:27:47 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int n,m;
int x[16];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void back(int k){
if(k==m+1){
for(int i=1;i<=m;i++){
fout<<x[i]<<" ";
}
fout<<"\n";
}
else{
for(int i=x[k-1]+1;i<=n;i++){
x[k] = i;
back(k+1);
}
}
}
int main(){
fin>>n>>m;
back(1);
return 0;
}