Need help with 510D (Fox and Jumping)

Revision en2, by szawinis, 2016-06-19 08:44:17

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

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English szawinis 2016-06-19 08:44:17 4
en1 English szawinis 2016-06-19 08:43:42 397 Initial revision (published)