Cod sursa(job #1179882)
Utilizator | Data | 29 aprilie 2014 15:09:11 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
///COMBINARI
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
vector<int> comb; ///K+1
int N, K;
void backTrack(int k) { /// k=1
if(k>K) {
for(int i=1; i<=K; i++)
fout<<comb[i]<<' ';
fout<<'\n';
}
else {
for(int i=comb[k-1]+1; i<=N; i++) {
comb[k]=i;
backTrack(k+1);
}
}
}
int main() {
fin>>N>>K;
comb.resize(K+1);
comb[0]=0;
backTrack(1);
return 0;
}