摘要：
链接：点我输入顺序又反了 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 #define MOD 100000000710 const int ... 阅读全文
摘要：
链接:点我记忆化搜索很好写 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 #define MOD 100000000710 const int... 阅读全文
摘要：
链接：点我spfa即可 阅读全文
摘要：
链接：点我一开始的方程式很好写的，但是数据太大，考虑到石子数目很小，我们对其进行离散化，若相邻两点距离超过ya的值，则后面所有点都往前移动，这里ya的值是可以调整的#include #include #include using namespace std;const int maxn=110;co... 阅读全文
摘要：
受不了，已阵亡 阅读全文
摘要：
题意：Shaolin temple is very famous for its Kongfu monks.A lot of young men go to Shaolin temple every year, trying to be a monk there. The master of Sha... 阅读全文
摘要：
1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 #define MOD 100000000710 const int INF=0x3f3f3f... 阅读全文
摘要：
链接：点我 1 阅读全文
摘要：
题意:Michael has a telecontrol robot. One day he put the robot on a loop with n cells. The cells are numbered from 1 to n clockwise. At first the robot ... 阅读全文
摘要：
题意:Suppose there are the symbols M, I, and U which can be combined to produce strings of symbols called "words". We start with one word MI, and transf... 阅读全文