摘要：
2^x mod n = 1 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18742 Accepted Submission(s): 5860 阅读全文
摘要：
Dinic vector 模板 Dinic 算法 讲解：https://www.cnblogs.com/suishiguang/p/6480958.html 阅读全文
摘要：
转：https://blog.csdn.net/snowy_smile/article/details/79120032 以HDU4560为例，整理了很多网络流的题目—— #include<stdio.h>#include<iostream>#include<string.h>#include<ct 阅读全文
摘要：
Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 83222 Accepted: 32330 Description Every time it rains on Farmer John's fie 阅读全文
摘要：
邂逅明下 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5668 Accepted Submission(s): 2653 Problem De 阅读全文
摘要：
kiki's game Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 40000/10000 K (Java/Others)Total Submission(s): 12564 Accepted Submission(s): 7633 Pr 阅读全文
摘要：
博弈论：组合博弈* 必败点(P点) :前一个选手(Previous player)将取胜的位置称为必败点。* 必胜点(N点) :下一个选手(Next player)将取胜的位置称为必胜点。* 必败（必胜）点的属性：* (1) 所有终结点是必败点（P点）；* (2) 从任何必胜点（N点）操作，至少有一 阅读全文
摘要：
Good Luck in CET-4 Everybody! Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12425 Accepted Subm 阅读全文