Cod sursa(job #807637)
Utilizator | Data | 5 noiembrie 2012 13:26:45 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int sol[20];
int n,k;
void bkt(int nr,int pos){
int i;
if(pos==k+1){
for(i=1;i<=k;++i){
out<<sol[i]<<" ";
}
out<<"\n";
return;
}
for(i=nr;i<=n;++i){
sol[pos]=i;
bkt(i+1,pos+1);
}
}
int main(){
in>>n>>k;
bkt(1,1);
return 0;
}