摘要：
http://codeforces.com/problemset/problem/708/A 贪心，先把前面连续的一串'a'排除，再向后知道找到第一个'a'，注意特殊情况。 阅读全文
摘要：
http://codeforces.com/problemset/problem/711/A 忙了一天没做题，做到水题，我这水平也只能做水题了= = ！ 阅读全文
摘要：
解题： 刚开始一看这题就蒙逼了，完全没思路，过了几天后再仔细去想想，应该是二进制的ascii码，但是原来的三张图虽然都是8的倍数，但完全转换不成有用的东西，题目的意思能否找到光，百度了一下关于三原色的知识，有如下图。 有点思路了，三种颜色刚好对应数字的颜色，于是便想，将三个颜色的二进制数相同的位置统 阅读全文
摘要：
When you visit this link you receive a message.Submit the same message back to http://www.wechall.net/challenge/training/programming1/index.php?answer 阅读全文
摘要：
We intercepted this message from one challenger to another, maybe you can find out what they were talking about.To help you on your progress I coded a 阅读全文
摘要：
Your mission is to exploit this code, which has obviously an LFI vulnerability: GeSHi`ed PHP code 1 2 $filename = 'pages/'.(isset($_GET["file"])?$_GET 阅读全文
摘要：
I have written another include system for my dynamic webpages, but it seems to be vulnerable to LFI.Here is the code: GeSHi`ed PHP code 1 2 3 4 56 7 8 阅读全文
摘要：
分散点的bfs，先建立一个互相是否可达的二维数组，vis[i][j]代表到第i个点，走了j步的状态，注意判断新增路由器数量是否超过K。 阅读全文