[Codeforces]Codeforces Round #460 (Div. 2)

Supermarket

找最便宜的就行

Solution

Perfect Number

暴力做

Solution

Seat Arrangement

注意当k=1时，横着和竖着是同一种方案

Solution

Substring

dp[i][j]表示在节点i结束，字母j最多有多少个，按拓扑排序的顺序计算

Solution

Congruence Equation

Solution

A Game With Numbers

跟SG游戏解决思路差不多

Solution