Difference between revisions of "2018 Benelux Algorithm Programming Contest (BAPC 18)"
Jump to navigation
Jump to search
(Created page with "== Problem A == Solved by ultmaster. 00:17 (+) == Problem B == Solved by zerol. 01:57 (+) == Problem C == Solved by ultmaster. 01:08 (+) == Problem F == Solved by ultma...") |
|||
| Line 2: | Line 2: | ||
Solved by ultmaster. 00:17 (+) | Solved by ultmaster. 00:17 (+) | ||
| + | |||
| + | 在 $n$ 个数里选尽可能多的数，使得没有两个数加起来超过 $x$。 | ||
== Problem B == | == Problem B == | ||
Revision as of 07:40, 30 March 2019
Problem A
Solved by ultmaster. 00:17 (+)
在 $n$ 个数里选尽可能多的数，使得没有两个数加起来超过 $x$。
Problem B
Solved by zerol. 01:57 (+)
Problem C
Solved by ultmaster. 01:08 (+)
Problem F
Solved by ultmaster. 00:42 (+)
Problem G
Solved by ultmaster. 00:42 (+)
Problem I
Solved by ultmaster. 03:20 (+)
Problem J
Solved by kblack. 01:00 (+)
Problem K
Solved by kblack. 01:44 (+)