作者:
sixB (6B)
2026-08-23 01:06:28今天 很難過
phone interview被洗臉
久違打開力扣找手感QQ
今天的是easy 寫個昨天的
蠻好寫的 hard爽題==
很直覺的二分搜 交集加加減減 然後就找到了
我連compress都有想到 神了
using ll = long long;
class Solution {
public:
void select(int k, vector<ll>& coins, vector<vector<ll>>& dst){
int n = coins.size();
std::string bitmask(k, 1);
bitmask.resize(n, 0);
//cout << endl << k << endl;
vector<ll> cur;
do {
ll mul = 1;
for (int i = 0; i < n; i++) // [0..n-1] integers
{
if (bitmask[i]) mul = lcm(mul, coins[i]);
}
dst[k].emplace_back(mul);
//cout << mul << " ";
} while (std::prev_permutation(bitmask.begin(), bitmask.end()));
ranges::sort(dst[k]);
//compress(dst[k]);
}
void compress(vector<ll>& coins){
int n = coins.size();
for(int i = n-1; i > 0; i