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