<br />
<b>Warning</b>:  session_start(): open(/tmp/sess_8080631b376879063495d38a85cdef5c, 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 />
<div class="error">Writing /data/wiki/data/cache/8/878e000dca5c08fe55e62fff31fad8b7.captchaip failed</div><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 />
===== 团队 =====

做毕设，摸了。

===== 个人 =====

==== zzh ====

[[https://codeforces.com/contest/1355/|Codeforces Round #643 (Div. 2)]]: ''pro: 5/5/6'' ''rk: 711/8876''

==== pmxm ====

没摸


topcoder srm 722 (vp: solved solved opened)
==== jsh ====

  * 5/15 - [[https://codeforces.com/contest/576/|Codeforces Round #319 (Div. 1)]]: ''pro: 3/3/5'' (vp)
  * 5/16 - [[https://codeforces.com/contest/1355/|Codeforces Round #643 (Div. 2)]]: ''pro: 5/5/6'' ''rk: 136/8876''

详细：[[.:jiangshenghu:2020.05.15-2020.05.21_周报]]

===== 本周推荐 =====

==== zzh ====

科普一下解同余方程的基本思想吧。设 $f(\vec{x})\equiv a\pmod{m}$，而 $m=p_{1}^{e_{1}}\cdots p_{s}^{e_{s}}$，那么可以分别求解每个 $f(\vec{x})\equiv a\pmod{p_{i}^{e_{i}}}$，然后将所有解用中国剩余定理合并。值得注意的是，由于 $p_{i}^{e_{i}}$ 两两互质，因此原方程的解集与分解后各方程的解集的笛卡尔积一一对应。

==== pmxm ====

推荐 

1. 基本状压dp: TopCoder SRM 722 div1 600
2. dp多写几道题
==== jsh ====

最近在弄毕设，没有什么值得推荐的题目。但是这周知识点不是有同学在写“李超树”嘛，那我这里额外介绍一个类似功能的东西。

=== Convex Hull Trick, CHT ===

支持插入一条直线，询问某横坐标对应的点中，纵坐标最大的值。

Codeforces 上有一个详细的教程：[[https://codeforces.com/blog/entry/63823|[Tutorial] Convex Hull Trick — Geometry being useful]]。

同时也有一个相当简短的实现：[[https://github.com/kth-competitive-programming/kactl/blob/master/content/data-structures/LineContainer.h|LineContainer.h]]。