<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Justesss的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Justesss</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Justesss]]></copyright><item><title><![CDATA[NYOJ-115 城市平乱]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/42710719</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/42710719</guid><author>Justesss</author><pubDate>Wed, 14 Jan 2015 15:34:48 +0800</pubDate><description><![CDATA[城市平乱
时间限制：1000 ms  |  内存限制：65535 KB

难度：4


描述 
南将军统领着N个部队，这N个部队分别驻扎在N个不同的城市。
他在用这N个部队维护着M个城市的治安，这M个城市分别编号从1到M。
现在，小工军师告诉南将军，第K号城市发生了暴乱，南将军从各个部队都派遣了一个分队沿最近路去往暴乱城市平乱。
现在已知在任意两个城市之间的路行军所需的时间，你]]></description><category></category></item><item><title><![CDATA[Hdu 2036  改革春风吹满地]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/41408111</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/41408111</guid><author>Justesss</author><pubDate>Sun, 23 Nov 2014 10:00:54 +0800</pubDate><description><![CDATA[改革春风吹满地
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19791    Accepted Submission(s): 10118


Problem Description
“ 改革春风吹满地,
不会AC没关系;]]></description><category></category></item><item><title><![CDATA[Hdu 2018 母牛的故事]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/41343551</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/41343551</guid><author>Justesss</author><pubDate>Fri, 21 Nov 2014 08:39:35 +0800</pubDate><description><![CDATA[母牛的故事
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 44955    Accepted Submission(s): 22309


Problem Description
有一头母牛，它每年年初生一头小母牛。每头小母]]></description><category></category></item><item><title><![CDATA[Hdu 2015 偶数求和]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/41308637</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/41308637</guid><author>Justesss</author><pubDate>Thu, 20 Nov 2014 10:08:38 +0800</pubDate><description><![CDATA[偶数求和
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 48834    Accepted Submission(s): 21145


Problem Description
有一个长度为n(n
 

Input
]]></description><category></category></item><item><title><![CDATA[Hdu 1013 Digital Roots]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/41173903</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/41173903</guid><author>Justesss</author><pubDate>Sun, 16 Nov 2014 16:36:06 +0800</pubDate><description><![CDATA[Digital Roots
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 50643    Accepted Submission(s): 15810


Problem Description
The digital ro]]></description><category></category></item><item><title><![CDATA[Hdu 1018 Big Number]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/41173103</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/41173103</guid><author>Justesss</author><pubDate>Sun, 16 Nov 2014 15:13:56 +0800</pubDate><description><![CDATA[Big Number
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26727    Accepted Submission(s): 12160


Problem Description
In many applicati]]></description><category></category></item><item><title><![CDATA[Hdu 1004 Let the Balloon Rise]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/41170629</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/41170629</guid><author>Justesss</author><pubDate>Sun, 16 Nov 2014 10:17:10 +0800</pubDate><description><![CDATA[Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 77211    Accepted Submission(s): 29004


Problem Description
Contest]]></description><category></category></item><item><title><![CDATA[ISA TEST Writeup]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/39801869</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/39801869</guid><author>Justesss</author><pubDate>Sun, 05 Oct 2014 10:53:19 +0800</pubDate><description><![CDATA[刚出来的hack小游戏，很简单，现在才7关，算是入门级的，没事可以玩一下。


LEVEL 1
仔细观察页面，入侵的第一步是收集一切可能产生价值的信息

ps:最好使用谷歌浏览器或火狐浏览器


将找到的密码输入到下面的对话框中

密码： 







右键查看源码




LEVEL 1


 



 
！！！提示！！！]]></description><category></category></item><item><title><![CDATA[MYSQL Training: MySQL I]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/39051831</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/39051831</guid><author>Justesss</author><pubDate>Thu, 04 Sep 2014 14:22:21 +0800</pubDate><description><![CDATA[让以admin身份登录，源码：


很简单的注入
在username输入 admin‘ OR ’1‘=’1                
OK！]]></description><category></category></item><item><title><![CDATA[WeChall Encodings: URL]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/39051305</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/39051305</guid><author>Justesss</author><pubDate>Thu, 04 Sep 2014 13:41:53 +0800</pubDate><description><![CDATA[https://www.wechall.net/challenge/training/encodings/url/saw_lotion.php?p=oasdmpcimrhh&cid=52#password=fibre_optics
 Very well done%2]]></description><category></category></item><item><title><![CDATA[WeChall Training: ASCII]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/39051249</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/39051249</guid><author>Justesss</author><pubDate>Thu, 04 Sep 2014 13:40:01 +0800</pubDate><description><![CDATA[把ascll码转成字母……]]></description><category></category></item><item><title><![CDATA[WeChall Training: WWW-Robots]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/39051137</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/39051137</guid><author>Justesss</author><pubDate>Thu, 04 Sep 2014 13:27:46 +0800</pubDate><description><![CDATA[Robots协议（也称为爬虫协议、机器人协议等）的全称是“网络爬虫排除标准”（Robots Exclusion Protocol），网站通过Robots协议告诉搜索引擎哪些页面可以抓取，哪些页面不能抓取。Robots协议的本质是网站和搜索引擎爬虫的沟通方式，用来指导搜索引擎更好地抓取网站内容，而不是作为搜索引擎之间互相限制和不正当竞争的工具。
找到wechall的robots.txt    ht]]></description><category></category></item><item><title><![CDATA[WeChall Training: Crypto - Caesar I]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/39050317</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/39050317</guid><author>Justesss</author><pubDate>Thu, 04 Sep 2014 12:04:02 +0800</pubDate><description><![CDATA[凯撒加密
枚举结果，看哪个像句子]]></description><category></category></item><item><title><![CDATA[WeChall Training: Get Sourced]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/39050155</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/39050155</guid><author>Justesss</author><pubDate>Thu, 04 Sep 2014 11:32:08 +0800</pubDate><description><![CDATA[直接右键查看网页源代码，找到]]></description><category></category></item><item><title><![CDATA[WeChall Training: Stegano I]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/39050205</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/39050205</guid><author>Justesss</author><pubDate>Thu, 04 Sep 2014 11:32:00 +0800</pubDate><description><![CDATA[说的不错This is the most basic image stegano I can think of.]]></description><category></category></item><item><title><![CDATA[WeChall：Prime Factory]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/39049603</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/39049603</guid><author>Justesss</author><pubDate>Thu, 04 Sep 2014 11:29:02 +0800</pubDate><description><![CDATA[意思就是算出大于1000000的两个不相同且最接近1000000的质数，并且每个数字都是质数，各位数字之和也是质数，然后把两个数拼在一起
编个小程序，轻松搞定。






Flag: 10000331000037]]></description><category></category></item><item><title><![CDATA[NYOJ-63 小猴子下落]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/38407545</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/38407545</guid><author>Justesss</author><pubDate>Wed, 06 Aug 2014 22:05:24 +0800</pubDate><description><![CDATA[小猴子下落
时间限制：3000 ms  |  内存限制：65535 KB
难度：3





描述

有一颗二叉树，最大深度为D,且所有叶子的深度都相同。所有结点从左到右从上到下的编号为1,2,3，·····，2的D次方减1。在结点1处放一个小猴子，它会往下跑。每个内结点上都有一个开关，初始全部关闭，当每次有小猴子跑到一个开关上时，它的状态都会改变，当到达一个内结点时，如果开关]]></description><category></category></item><item><title><![CDATA[NYOJ-2 括号配对问题]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/38374287</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/38374287</guid><author>Justesss</author><pubDate>Mon, 04 Aug 2014 20:06:44 +0800</pubDate><description><![CDATA[括号配对问题
时间限制：3000 ms  |  内存限制：65535 KB
难度：3





描述现在，有一行括号序列，请你检查这行括号是否配对。


输入第一行输入一个数N（0
输出每组输入数据的输出占一行，如果该字符串中所含的括号是配对的，则输出Yes,如果不配对则输出No
样例输入
3
[(])
(])
([[]()])

样例输出
No
No
Yes
]]></description><category></category></item><item><title><![CDATA[NYOJ-284 坦克大战]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/38176927</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/38176927</guid><author>Justesss</author><pubDate>Sun, 27 Jul 2014 19:53:53 +0800</pubDate><description><![CDATA[坦克大战
时间限制：1000 ms  |  内存限制：65535 KB
难度：3





描述
Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now. 
What we are dis]]></description><category></category></item><item><title><![CDATA[NYOJ-21 三个水杯]]></title><link>https://blog.youkuaiyun.com/Justesss/article/details/38174859</link><guid>https://blog.youkuaiyun.com/Justesss/article/details/38174859</guid><author>Justesss</author><pubDate>Sun, 27 Jul 2014 18:25:31 +0800</pubDate><description><![CDATA[三个水杯
时间限制：1000 ms  |  内存限制：65535 KB
难度：4





描述给出三个水杯，大小不一，并且只有最大的水杯的水是装满的，其余两个为空杯子。三个水杯之间相互倒水，并且水杯没有标识，只能根据给出的水杯体积来计算。现在要求你写出一个程序，使其输出使初始状态到达目标状态的最少次数。


输入第一行一个整数N(0
接下来每组测试数据有两行，第一行给出三]]></description><category></category></item></channel></rss>