Hi all. I've been trying some bitmask+DP problems lately, and I've found one that is a little too challenging for me: [problem:510D]. I looked at the editorial, and tghe first thing they tell us is that the problem reduces to finding a set of lengtghs such that GCD is 1 and has minimal cost. Would anyone be so kind to explain how this works? Thanks in advance.
