Pagini recente » Cod sursa (job #2407944) | Cod sursa (job #2022054) | Cod sursa (job #2139531) | Infoarena Monthly 2014 - Solutii Runda 3 | Cod sursa (job #761443)
Cod sursa(job #761443)
#include <fstream>
#include <iostream>
using namespace std;
#define NMAX 32
bool v[NMAX];
int N, K;
ifstream in("combinari.in");
ofstream out("combinari.out");
void print(){
for(int i = 1; i <= N; ++i)
if(v[i])
out << i << " ";
out << endl;
}
void back(int i, int n){
if(n == K && i > N)
print();
if(i > N)
return;
v[i] = true;
back(i+1, n+1);
v[i] = false;
back(i+1, n);
}
int main(){
in >> N >> K;
back(1, 0);
return 0;
}