Difference between revisions of "NEERC 2008, Eastern subregion quarterfinals"
Jump to navigation
Jump to search
(Created page with "== oxx1108 == === Problem B === === Problem C === === Problem F === === Problem H === === Problem J === === Problem K ===") |
|||
| Line 1: | Line 1: | ||
== oxx1108 == | == oxx1108 == | ||
=== Problem B === | === Problem B === | ||
| + | 题意：给定一些百万富翁初始位置和钱数，以及一些移动，求每个城市钱财和最多（不能并列）的天数。 | ||
| + | 题解：用set模拟一下即可。有两个注意的地方，一个是钱数不能除掉一百万，因为没说一定是一百万的倍数，另要注意set里只有一个元素的情况。 | ||
=== Problem C === | === Problem C === | ||
=== Problem F === | === Problem F === | ||
Revision as of 13:30, 26 March 2018
oxx1108
Problem B
题意：给定一些百万富翁初始位置和钱数，以及一些移动，求每个城市钱财和最多（不能并列）的天数。 题解：用set模拟一下即可。有两个注意的地方，一个是钱数不能除掉一百万，因为没说一定是一百万的倍数，另要注意set里只有一个元素的情况。