Cod sursa(job #1478689)
Utilizator | Data | 29 august 2015 12:11:22 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
# include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m,v[20];
void back(int k){
if(k==m+1){
for(int i=1;i<=m;i++){
fout<<v[i]<<" ";
}
fout<<"\n";
}
else{
for(int i=1;i<=n;i++){
if(i>v[k-1]){
v[k]=i;
back(k+1);
}
}
}
}
int main () {
fin>>n>>m;
back(1);
return 0;
}