![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
杭电多校赛
touch_er
这个作者很懒,什么都没留下…
展开
-
2016 Multi-University Training Contest 2 Acperience
Acperiencehttp://acm.hdu.edu.cn/showproblem.php?pid=5734Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 513 Accepted Submission(s): 2原创 2016-07-22 11:47:48 · 236 阅读 · 0 评论 -
2016 Multi-University Training Contest 1 1011 tetrahedron 四面体内切圆
tetrahedronTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 408 Accepted Submission(s): 157Problem DescriptionGiven four point原创 2016-07-20 14:56:14 · 460 阅读 · 0 评论 -
1011 Regular polygon 6055之神奇的count与[]
map 重载[] 与 count 的速度比较 (ps 辣鸡[])原创 2017-07-28 10:09:56 · 260 阅读 · 0 评论 -
Remember The Feeling 2017-09-27 21:15
反应过来莫比乌斯反演是啥意思HDU 6053 - TrickGCD [ 莫比乌斯函数,筛法分块 ] | 2017 Multi-University Training Contest 2题意: 给出数列 A[N],问满足: 1 对任意(l, r) (1= 2 ; 的 B[N] 数列的个原创 2017-09-27 21:18:23 · 260 阅读 · 0 评论