Cod sursa(job #2134046)
Utilizator | Data | 17 februarie 2018 16:13:47 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int n, i, v[20], k;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void back(int niv){
if(niv > k){
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;
v[0] = 0;
back(1);
return 0;
}