Cod sursa(job #2304222)
Utilizator | Data | 17 decembrie 2018 18:56:23 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m, k, sol[20], v[20];
void back(int niv){
if(niv>m){
for(int i=1; i<=m; i++){
fout<<sol[i]<<" ";
}
fout<<"\n";
}else{
for(int i=sol[niv-1]+1; i<=n; i++){
if(v[i]==0){
sol[niv]=i;
back(niv+1);
}
}
}
}
int main(){
fin>>n>>m;
back(1);
}