<br />
<b>Warning</b>:  session_start(): open(/tmp/sess_5e3e056dd60aabf4bc226c079b2a165e, O_RDWR) failed: No space left on device (28) in <b>/data/wiki/inc/init.php</b> on line <b>239</b><br />
<br />
<b>Warning</b>:  session_start(): Failed to read session data: files (path: ) in <b>/data/wiki/inc/init.php</b> on line <b>239</b><br />
<br />
<b>Warning</b>:  Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in <b>/data/wiki/inc/auth.php</b> on line <b>430</b><br />
<br />
<b>Warning</b>:  Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in <b>/data/wiki/inc/Action/Export.php</b> on line <b>103</b><br />
<br />
<b>Warning</b>:  Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in <b>/data/wiki/inc/Action/Export.php</b> on line <b>103</b><br />
<br />
<b>Warning</b>:  Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in <b>/data/wiki/inc/Action/Export.php</b> on line <b>103</b><br />
====== 2020/5/18-2020/5/24 ======
===== 团队训练 =====
https://ac.nowcoder.com/acm/contest/5666\\
https://ac.nowcoder.com/acm/contest/5667\\
===== 队伍知识点 =====

===== 吕双羽 =====
===专题===
字符串\\
===比赛===
没有比赛超级抱歉\\
===本周推荐题目===
只复习了一些模板，没有特定的题目\\

===== 吴湛宇 =====
===专题===
博弈论\\
===比赛===
https://atcoder.jp/contests/abc173
===本周推荐题目===
分类：博弈论
简要题意：有n堆石子，每次可以取一堆中的任意个，不能操作者输\\
解法：当且仅当a1^a2...^an=0时，后手必胜\\
comment：无\\
===== 陶虹宇 =====
===专题===
无\\
===比赛===
https://codeforces.com/contests/1380
===本周推荐题目===
分类：计算几何
简要题意：平面坐标上给出n个点，求一过原点的圆，使得在圆弧上的点最多\\
解法：暴力方法是直接枚举两个点，与原点构成一个圆，然后在剩余的点中检验，求出最大的在同一圆弧上
的点\\
而通过同一圆弧上圆周角相等的几何性质，若圆周角相等，那么该圆周角的顶点将被约束在两个可能的圆上\\
再通过圆周角顶点在弦的哪一侧即可确定顶点所在圆\\
我们可以枚举两个点，并保证第二个顶点一定在第一个顶点与原点构成的弦的某一侧，计算出圆周角，找到\\
圆周角最多的圆弧即可\\
comment：比赛的时候想了很久这道题一直没想出来，利用同一圆弧上圆周角相等的几何性质快速判断顶点\\
是否在同一圆弧确实十分巧妙，wtcl\\