Difference between revisions of "ACM-ICPC 2018 Nanjing Online Contest"
Jump to navigation
Jump to search
(Created page with "= ECNU Foreigners = == Problem A == Solved by Mathematica. == Problem B == Solved by ultmaster. == Problem C == Solved by ultmaster. == Problem D == Solved by ultmaste...") |
|||
| Line 32: | Line 32: | ||
Solved by zerol. | Solved by zerol. | ||
| + | |||
| + | 题意：一开始每个集合里有一个数。要求支持操作： | ||
| + | |||
| + | 1. 合并两个集合 | ||
| + | |||
| + | 2. 把一个集合里的数都 +1 | ||
| + | |||
| + | 3. 询问一个集合里满足 $x \equiv a \pmod 2^k$ 的 $x$ 的个数。 | ||
== Problem I == | == Problem I == | ||
Revision as of 09:08, 1 September 2018
ECNU Foreigners
Problem A
Solved by Mathematica.
Problem B
Solved by ultmaster.
Problem C
Solved by ultmaster.
Problem D
Solved by ultmaster.
Problem E
Solved by ultmaster.
Problem F
Solved by zerol.
Problem G
Solved by kblack.
Problem H
Solved by zerol.
题意：一开始每个集合里有一个数。要求支持操作：
1. 合并两个集合
2. 把一个集合里的数都 +1
3. 询问一个集合里满足 $x \equiv a \pmod 2^k$ 的 $x$ 的个数。
Problem I
Solved by zerol.
Problem J
Solved by zerol.
Problem K
Solved by kblack.
Problem L
Solved by ultmaster.