Cod sursa(job #2949803)
| Utilizator | Data | 1 decembrie 2022 19:01:36 | |
|---|---|---|---|
| Problema | Combinari | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
int main() {
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k; f >> n >> k;
for(int mask=0; mask<(1<<n); mask++) {
if(__builtin_popcount(mask) != k) continue;
for(int bit=0; bit<n; bit++)
if((1<<bit) & mask) g << bit+1 << " ";
g << "\n";
}
return 0;
}
