Cod sursa(job #2499961)
Utilizator | Data | 27 noiembrie 2019 00:08:11 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m,a[20];
void bk(int k){
if(k>m){
for(int i=1;i<=m;i++)
fout<<a[i]<<" ";
fout<<"\n";
return;
}
for(int i=a[k-1]+1;i<=n;i++){
a[k]=i;
bk(k+1);
}
}
int main(){
fin>>n>>m;
bk(1);
return 0;
}