这是一道关于游戏策略的问题，玩家需要在无限长的数轴上通过购买不同卡片来增加跳跃能力，目标是能到达任意位置。题目描述了卡片的跳跃长度和成本，并提供了样例输入和输出，解答需要找到最小成本的卡片组合，使得能够跳到所有位置。如果无法达成目标，则输出-1。解题思路涉及到了最小公倍数和成本优化。
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are also n cards, each card has 2 attributes: length li and cost ci. If she pays ci dollars then she can apply i-th card. After applying i-th card she becomes able to make jumps of length li, i. e. from cell x to cell (x - li) or cell (x + li).
She wants to be able to jump to any cell on the tape (possibly, visiting some intermediate cells). For achieving this goal, she wants to buy some cards, paying as little money as possible.
If this is possible, calculate the minimal cost.
Input
The first line contains an integer n (1
最低0.47元/天 解锁文章
1677
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
