Cod sursa(job #377296)
Utilizator | Data | 23 decembrie 2009 22:20:52 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
const char InFile[]="combinari.in";
const char OutFile[]="combinari.out";
int sol[20],n,m,len;
ofstream fout(OutFile);
void back(int k){
if(k>m){
for(register int i=1;i<=m;++i){
fout<<sol[i]<<" ";
}
fout<<"\n";
}else{
if(sol[k-1]!=n){
for(register int i=sol[k-1]+1;i<=n;++i){
sol[k]=i;
back(k+1);
}
}
}
}
int main(){
ifstream fin(InFile);
fin>>n>>m;
fin.close();
back(1);
fout.close();
return 0;
}