codeforces
birdstorm
どうか君と君を囲むこの世界がこれからも幸せでありますように
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Codeforces Round #232 (Div. 2) B. On Corruption and Numbers
Alexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting lost in the diversity — he has原创 2014-02-27 13:41:40 · 1062 阅读 · 0 评论 -
Codeforces Round #232 (Div. 2) A. On Segment's Own Points
Our old friend Alexey has finally entered the University of City N — the Berland capital. Alexey expected his father to get him a place to live in but his father said it was high time for Alexey to pr原创 2014-02-27 13:36:59 · 970 阅读 · 0 评论 -
Andrew Stankevich's Contest 23
Problem A. Bike Roads 分段三分套三分 注意分段区间内需保证导函数单调 ac前一炮分了3*3=9个区间, WA在test 77 我最后分了最多4*4=16个区间= = Problem B. Diversion 题意是给出一个无向图, 由一颗生成树的边(type1)和一些其他边(type2)组成, 保证所有点两两双联通 现在求删去type1和type2各原创 2015-02-07 11:09:26 · 731 阅读 · 0 评论
分享