Cod sursa(job #1978598)
Utilizator | Data | 8 mai 2017 11:25:02 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <stack>
#include <cstdlib>
#include <ctime>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int NMax = 1e5 + 5;
int N,K;
int v[20];
void backT(int);
int main() {
in>>N>>K;
backT(1);
in.close();
out.close();
return 0;
}
void backT(int idx) {
if (idx == K+1) {
for (int i=1;i <= K;++i) {
out<<v[i]<<' ';
}
out<<'\n';
return;
}
for (int k=v[idx-1]+1;k <= N;++k) {
v[idx] = k;
backT(idx+1);
}
}