XIX Russia Team Open, High School Programming Contest

Problem A

Solved by Weaver_zhu. 00:10 (+)

Problem B

Solved by Xiejiadong. 02:22 (+)

字符串签到。

直接拿 map 给每一个字符串编号即可。

Problem C

Solved by Kilo_5723. 03:19 (+)

Problem D

Solved by Kilo_5723. 00:45 (+)

Problem F

Solved by Xiejiadong. 03:30 (+)

Problem G

Unsolved.

Problem H

Unsolved.

Problem I

Solved by Xiejiadong. 01:26 (+4)

Problem J

Unsolved.

Problem K

Solved by Kilo_5723. 01:38 (+)

Problem L

Solved by Xiejiadong. 01:04 (+1)

题意：单周上大小为$a$的教室，双周上大小为$b$的教室，一共$n$周，每个人需要至少上$k$周才能合格，求最大合格人数。

题解：考虑单周、双周、以及所有时间的情况下对人的限制。

设单周有$x$，双周有$y$，显然答案就是$\min\{\lfloor \frac {ax+by}{k} \rfloor, \lfloor \frac {ax}{k-y} \rfloor, \lfloor \frac {by}{k-x} \rfloor \}$。

不过需要注意分母$\le 0$的时候，说明限制没有意义，不需要考虑。

Problem M

Solved by Kilo_5723. 00:14 (+)