Codeforces Round 960 (Div. 2)

比赛链接

Problems AC
A. Submission Bait
B. Array Craft
C. Mad MAD Sum
D. Grid Puzzle
E1. Catch the Mole(Easy Version)
E2. Catch the Mole(Hard Version)
F. Polygonal Segments

C

题目 Mad MAD Sum 是否是做两次的暗示呢()

D

实际上是个简单 dp 讨论题

Author

TosakaUCW

Posted on

2024-07-21

Updated on

2024-09-05

Licensed under

Comments