Cod sursa(job #1164239)
Utilizator | Radu Szasz SRadu | Data | 1 aprilie 2014 22:51:05 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int N, K;
int V[20];
bool taken[20];
void back(int poz) {
if(poz == K) {
for(int i = 0; i < K; i++)
out << V[i] << " ";
out << "\n";
return;
}
for(int i = (poz ? V[poz - 1] : 1); i <= N; i++) {
if(taken[i]) continue;
V[poz] = i;
taken[i] = true;
back(poz + 1);
taken[i] = false;
}
}
int main() {
in >> N >> K;
back(0);
}