摘要: Problem Description曾经,ZYJ同学非常喜欢密码学。有一天,他发现了一个很长很长的字符串S1。他很好奇那代表着什么,于是神奇的WL给了他另一个字符串S2。但是很不幸的是,WL忘记跟他说是什么意思了。这个时候,ZYJ不得不求助与伟大的ZP。ZP笑了笑说... 阅读全文
posted @ 2018-08-09 16:12 Mercury_Lc 阅读(155) 评论(0) 推荐(0)
摘要: Problem Description “回文串”是一个正读和反读都一样的字符串,比如“level”或者“noon”等等就是回文串。现在呢,就是让你判断输入的字符串是否是回文串。Input 有多组输入,每行输入一串字符,保证字符串长度不会大于 100000... 阅读全文
posted @ 2018-08-08 20:46 Mercury_Lc 阅读(90) 评论(0) 推荐(0)
摘要: Problem Description “回文串”是一个正读和反读都一样的字符串,比如“level”或者“noon”等等就是回文串。现在呢,就是让你判断输入的字符串是否是回文串。Input 有多组输入,每行输入一串字符,保证字符串长度不会大于 100000... 阅读全文
posted @ 2018-08-08 20:46 Mercury_Lc 阅读(230) 评论(0) 推荐(0)
摘要: ProblemThis year at Monsters University it is decided to arrange Scare Games. At the Games all campus gathers at the stadium stands, a... 阅读全文
posted @ 2018-08-08 18:14 Mercury_Lc 阅读(129) 评论(0) 推荐(0)
摘要: ProblemGrisha N. told his two teammates that he was going to solve all given problems at the subregional contest, even if the teammate... 阅读全文
posted @ 2018-08-08 17:25 Mercury_Lc 阅读(236) 评论(0) 推荐(0)
摘要: Problem Description在哥尼斯堡的一个公园里,有七座桥将普雷格尔河中两个岛及岛与河岸连接起来。能否走过这样的七座桥,并且每桥只走一次?瑞士数学家欧拉最终解决了这个问题并由此创立了拓扑学。欧拉通过对七桥问题的研究,不仅圆满地回答了哥尼斯堡七桥问题,并证明... 阅读全文
posted @ 2018-08-07 14:49 Mercury_Lc 阅读(132) 评论(0) 推荐(0)
摘要: ProblemAlice lives in the country where people like to make friends. The friendship is bidirectional and if any two person have no les... 阅读全文
posted @ 2018-08-06 20:05 Mercury_Lc 阅读(142) 评论(0) 推荐(0)
摘要: ProblemThe vast power system is the most complicated man-made system and the greatest engineering innovation in the 20th century. The ... 阅读全文
posted @ 2018-08-06 19:51 Mercury_Lc 阅读(152) 评论(0) 推荐(0)
摘要: ProblemThe balance was the first mass measuring instrument invented. In its traditional form, it consists of a pivoted horizontal leve... 阅读全文
posted @ 2018-08-06 19:33 Mercury_Lc 阅读(228) 评论(0) 推荐(0)
摘要: 题解:就是题目有点小长而已,可能会不想读题,但是题意蛮好理解的,就是根据条件模拟,计算pts。(送给队友zm、 qsh,你们不适合训练了。)#include #include #include #include #include #include #include u... 阅读全文
posted @ 2018-08-06 19:13 Mercury_Lc 阅读(234) 评论(0) 推荐(0)