Difference between revisions of "2012-2013 ACM-ICPC Northeastern European Regional Contest (NEERC 12)"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) |
Xiejiadong (talk | contribs) |
||
Line 19: | Line 19: | ||
Solved by Xiejiadong.02:53(+9) | Solved by Xiejiadong.02:53(+9) | ||
− | + | 题意:给每个人分配一个相同的长度,使得每个人可以在自己的区间里面找出互不重叠的区间。 | |
− | + | 题解:用long double来二分答案,然后暴力枚举分母,找出分数的表示。 | |
+ | |||
+ | 需要注意精度问题,wa了好几发。 | ||
== Problem D == | == Problem D == |
Revision as of 07:56, 26 August 2018
Problem A
Solved by oxx1108. 00:34
题意:
题解:
Problem B
Unsolved.(-16)
题意:
题解:
Problem C
Solved by Xiejiadong.02:53(+9)
题意:给每个人分配一个相同的长度,使得每个人可以在自己的区间里面找出互不重叠的区间。
题解:用long double来二分答案,然后暴力枚举分母,找出分数的表示。
需要注意精度问题,wa了好几发。
Problem D
Unsolved.
题意:
题解:
Problem E
Solved by oxx1108.02:29(+1)
题意:
题解:
Problem F
Unsolved.
题意:
题解:
Problem G
Solved by dreamcloud.02:01(+1)
题意:
题解:
Problem H
Solved by dreamcloud.01:34
题意:
题解:
Problem I
Unsolved.
题意:
题解:
Problem J
Solved by Xiejiadong. 03:59(+1)
题意:
题解:
Problem K
Unsolved.
题意:
题解:
Problem L
Unsolved.
题意:
题解: