Cod sursa(job #1605253)
Utilizator | Data | 18 februarie 2016 21:08:56 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,V[20];
void write(){
for(int i=1;i<=k;i++){
out<<V[i]<<" ";
}
out<<"\n";
}
void bkt(int dgt){
if(dgt==k+1){
write();
}
else{
for(int i=V[dgt-1]+1;i<=n;i++){
V[dgt]=i;
bkt(dgt+1);
}
}
}
int main(){
in>>n>>k;
bkt(1);
}