Pagini recente » Cod sursa (job #3031454) | Cod sursa (job #1040573) | Cod sursa (job #1074) | Cod sursa (job #883319) | Cod sursa (job #2685054)
#include <fstream>
#define MAX 18
using namespace std;
int v[MAX + 1], f[MAX + 1], n, m;
ifstream fin ( "combinari.in" );
ofstream fout ( "combinari.out" );
void bkt ( int k ) {
if ( k == m + 1 ) {
for ( int i = 1; i <= m; i++ )
fout << v[i] << ' ';
fout << '\n';
} else {
for ( int i = v[k - 1] + 1; i <= n; i++ ) {
if ( f[i] == 0 ) {
v[k] = i;
f[i] = 1;
bkt ( k + 1 );
f[i] = 0;
}
}
}
}
// n = 4
// m = 3
int main() {
fin >> n >> m;
bkt ( 1 );
return 0;
}