Cod sursa(job #3198007)
| Utilizator | Data | 27 ianuarie 2024 22:44:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream in ("combinari.in");
ofstream out("combinari.out");
// auto& in = cin;
// auto& out = cout;
const int N = 20;
int n, k, sol[N];
bool taken[N];
void show() {
for(int i = 1; i <= k; i++)
out<<sol[i]<<" ";
out<<endl;
}
void bkt(int p, int last) {
if(p > k) {show(); return;}
for(int i = last + 1; i <= n; i++)
if(!taken[i]) {
taken[i] = true;
sol[p] = i;
bkt(p + 1, i);
taken[i] = false;
}
}
int main(){
in>>n>>k;
bkt(1, 0);
return 0;
}
