Cod sursa(job #2277075)
Utilizator | Data | 5 noiembrie 2018 19:34:28 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,x[20];
void bkt(int pas){
if(pas>k){
for(int i=1;i<=k;i++)
fout<<x[i]<<" ";
fout<<"\n";
}else{
for(int i=x[pas-1]+1;i<=n;i++){
x[pas]=i;
bkt(pas+1);
}
}
}
int main(){
fin>>n>>k;
bkt(1);
return 0;
}