2020-2021:teams:hotpot:germancollegiateprogrammingcontest2015
这是本文档旧的修订版！
目录
比赛信息
题解
A - Adjoin the Networks
solved by lxh,tyx
written by lxh
题意
数据范围
题解
B - Bell Ringing
solved by tyx
题意
数据范围
题解
C - Cryptographer’s Conundrum
solved by tyx
题意
数据范围
题解
D - Disastrous Downtime
solved by tyx,gyp
written by gyp
题意
数据范围
题解
E - Entertainment Box
solved by tyx,gyp
written by lxh
题意
数据范围
题解
F - Floppy Music
solved by tyx,gyp
written by tyx
题意
数据范围
题解
G - Goblin Garden Guards
solved by tyx,gyp
written by lxh
题意
在一个平面给出一些点，再给出一些圆，问有多少点没有被覆盖。（一个坐标上可以有多个点）
数据范围
题解
Replay
第一小时：
第二小时：
第三小时：
第四小时：
第五小时：
总结
- 要仔细看清楚题目要求。
- DP方面的知识点还需要加强。
2020-2021/teams/hotpot/germancollegiateprogrammingcontest2015.1593161117.txt.gz · 最后更改: 2020/06/26 16:45 由 misakatao
