2015-2016 6th BSUIR Open Programming Contest. Final

Problem A

Solved by zerol. 00:22 (+)

Problem B

Unsolved.

Problem C

Solved by zerol. 01:17 (+)

Problem D

Unsolved.

Problem E

Solved by ultmaster. 00:44 (+)

题意：现在规定一种选举的规则，如果 $n$ 个人能等分成 $k$ 组，那么这 $k$ 组可以递归的等分，并各自选举出一个代表，这些代表再投票，决定当前选取的结果。现在要黑幕划分，使得用尽可能少的实际支持数赢得选举。

题解：枚举因数暴搜一下就好了。要记忆化。

Problem F

Unsolved.

Problem G

Solved by kblack. 02:00 (+)

Problem H

Solved by ultmaster. 00:04 (+)

哈！我也能抢到签到！

Problem I

Solved by ???. 04:09 (+15)

ultmaster: 我写了个能输出决策树的暴力，据说发现了一万个遗漏的情况。

Problem J

Unsolved.