Pagini recente » Cod sursa (job #73606) | Cod sursa (job #1515499) | Cod sursa (job #1005878) | Cod sursa (job #3248427) | Cod sursa (job #1419517)
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int NMAX = 19;
int N, K, v[NMAX+2];
void Afis() {
for( int i = 1; i <= K; ++i ) out << v[i] << ' ';
out << '\n';
}
void BKT( int pas ) {
if( pas == K+1 ) Afis();
else {
for( int i = v[pas-1] + 1; i <= N - ( K-pas ); ++i ) {
v[pas] = i;
BKT( pas+1 );
}
}
}
int main() {
in >> N >> K;
BKT( 1 );
return 0;
}