<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wust_towave的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wust_towave</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wust_towave]]></copyright><item><title><![CDATA[Ant Trip]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/9039477</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/9039477</guid><author>wust_towave</author><pubDate>Thu, 06 Jun 2013 15:29:51 +0800</pubDate><description><![CDATA[Problem B 
Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 13   Accepted Submission(s) : 9
Problem Description
Ant Country consist of N towns]]></description><category></category></item><item><title><![CDATA[hdoj1116 Play on Words]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/9038639</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/9038639</guid><author>wust_towave</author><pubDate>Thu, 06 Jun 2013 14:25:33 +0800</pubDate><description><![CDATA[Play on Words
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3814    Accepted Submission(s): 1227


Problem Description
Some of the sec]]></description><category></category></item><item><title><![CDATA[poj1300 door man]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/9026355</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/9026355</guid><author>wust_towave</author><pubDate>Tue, 04 Jun 2013 22:38:47 +0800</pubDate><description><![CDATA[Problem A 
Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)
Total Submission(s) : 8   Accepted Submission(s) : 5
Problem Description
You are a butler in a large man]]></description><category></category></item><item><title><![CDATA[Leftmost Digit]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8982471</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8982471</guid><author>wust_towave</author><pubDate>Mon, 27 May 2013 23:50:15 +0800</pubDate><description><![CDATA[Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)


Total Submission(s): 1788 Accepted Submission(s): 801


 



Problem Description
Given a positive integer]]></description><category></category></item><item><title><![CDATA[整数对]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8982358</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8982358</guid><author>wust_towave</author><pubDate>Mon, 27 May 2013 23:11:05 +0800</pubDate><description><![CDATA[Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)


Total Submission(s): 1811 Accepted Submission(s): 735


 



Problem Description
Gardon和小希玩了一个游戏，Gardon随便想]]></description><category></category></item><item><title><![CDATA[第四届“蓝桥杯”全国软件专业人才设计与创业大赛选拔赛C/C++本科B组主讲解题思想]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8971176</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8971176</guid><author>wust_towave</author><pubDate>Fri, 24 May 2013 17:24:55 +0800</pubDate><description><![CDATA[分类： 蓝桥杯2013-05-0921:15 78人阅读 评论(0) 收藏 举报
1. 结果填空 (满分4分) 
题目标题:
高斯日记 
大数学家高斯有个好习惯：无论如何都要记日记。 
他的日记有个与众不同的地方，他从不注明年月日，而是用一个整数代替，比如：4210 
后来人们知道，那个整数就是日期，它表示那一天是高斯出生后的第几天。这或许也是个好习惯，它时时刻刻提醒着主人：日子又过去]]></description><category></category></item><item><title><![CDATA[Zipper]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8970823</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8970823</guid><author>wust_towave</author><pubDate>Fri, 24 May 2013 16:56:31 +0800</pubDate><description><![CDATA[Problem C 
Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 20   Accepted Submission(s) : 8
Problem Description
Bessie is out in the field an]]></description><category></category></item><item><title><![CDATA[一个人的旅行]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8967986</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8967986</guid><author>wust_towave</author><pubDate>Fri, 24 May 2013 01:52:25 +0800</pubDate><description><![CDATA[Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 57   Accepted Submission(s) : 19
Problem Description
虽然草儿是个路痴（就是在杭电待了一年多，居然还会在校园里迷路的人，汗~),但是草儿]]></description><category></category></item><item><title><![CDATA[畅通工程续]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8967984</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8967984</guid><author>wust_towave</author><pubDate>Fri, 24 May 2013 01:49:52 +0800</pubDate><description><![CDATA[畅通工程续 
Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 36   Accepted Submission(s) : 19
Problem Description
某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了]]></description><category></category></item><item><title><![CDATA[A strange lift]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8967983</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8967983</guid><author>wust_towave</author><pubDate>Fri, 24 May 2013 01:46:58 +0800</pubDate><description><![CDATA[A strange lift 
Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 13   Accepted Submission(s) : 11
Problem Description
There is a strange lift.]]></description><category></category></item><item><title><![CDATA[最短路]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8967979</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8967979</guid><author>wust_towave</author><pubDate>Fri, 24 May 2013 01:40:50 +0800</pubDate><description><![CDATA[最短路 
Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 49   Accepted Submission(s) : 24
Problem Description
在每年的校赛里，所有进入决赛的同学都会获得一件很漂亮的t-shirt。]]></description><category></category></item><item><title><![CDATA[Fibonacci]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8967978</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8967978</guid><author>wust_towave</author><pubDate>Fri, 24 May 2013 01:33:17 +0800</pubDate><description><![CDATA[Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)


Total Submission(s): 2033 Accepted Submission(s): 969


 



Problem Description
2007年到来了。经过2006年一年的修炼，数学神]]></description><category></category></item><item><title><![CDATA[找新朋友]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8967972</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8967972</guid><author>wust_towave</author><pubDate>Fri, 24 May 2013 01:23:57 +0800</pubDate><description><![CDATA[找新朋友



Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)


Total Submission(s): 1895 Accepted Submission(s): 907


 



Problem Description
新年快到了，“猪头帮协会”]]></description><category></category></item><item><title><![CDATA[Largest prime factor]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8967951</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8967951</guid><author>wust_towave</author><pubDate>Fri, 24 May 2013 00:42:00 +0800</pubDate><description><![CDATA[Largest prime factor



Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)


Total Submission(s): 3288 Accepted Submission(s): 997


 



Problem Descriptio]]></description><category></category></item><item><title><![CDATA[hdu acmsteps 2-1-3相遇周期]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8967863</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8967863</guid><author>wust_towave</author><pubDate>Thu, 23 May 2013 23:42:04 +0800</pubDate><description><![CDATA[Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)


Total Submission(s): 1813 Accepted Submission(s): 846


 



Problem Description
2007年3月26日，在中俄两国元首的见证下，中国]]></description><category></category></item><item><title><![CDATA[Rank]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8963142</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8963142</guid><author>wust_towave</author><pubDate>Thu, 23 May 2013 00:41:19 +0800</pubDate><description><![CDATA[Rank



Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)


Total Submission(s): 2575 Accepted Submission(s): 779


 



Problem Description
Jackson wants]]></description><category></category></item><item><title><![CDATA[悼念512汶川大地震遇难同胞——老人是真饿了]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8962901</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8962901</guid><author>wust_towave</author><pubDate>Wed, 22 May 2013 23:08:08 +0800</pubDate><description><![CDATA[#include
#include
struct rice
{
    int p;
    int h;
} r[1100];

using namespace std;
int cmp(struct rice a,struct rice b)
{
    return a.p<b.p;
}
int main()
{
    int n,m,c,i,j;
    while(~scanf("%d]]></description><category></category></item><item><title><![CDATA[Saving HDU]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8962807</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8962807</guid><author>wust_towave</author><pubDate>Wed, 22 May 2013 22:43:01 +0800</pubDate><description><![CDATA[#include
#include
struct bao
{
    int p;
    int m;
} baobei[120];
int cmp(struct bao a,struct bao b)
{
    return  a.p>b.p;
}
using namespace std;
int main()
{
    int v,n,i,j,count;
    while(~scan]]></description><category></category></item><item><title><![CDATA[排名  Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)   Total Submiss]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8961754</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8961754</guid><author>wust_towave</author><pubDate>Wed, 22 May 2013 18:12:37 +0800</pubDate><description><![CDATA[今天的上机考试虽然有实时的Ranklist，但上面的排名只是根据完成的题数排序，没有考虑 
每题的分值，所以并不是最后的排名。给定录取分数线，请你写程序找出最后通过分数线的 
考生，并将他们的成绩按降序打印。 

 




Input
测试输入包含若干场考试的信息。每场考试信息的第1行给出考生人数N ( 0 

名考生的准考证号（长度不超过20的字符串）、该生解决的题目总]]></description><category></category></item><item><title><![CDATA[Tian Ji -- The Horse Racing]]></title><link>https://blog.youkuaiyun.com/wust_towave/article/details/8961418</link><guid>https://blog.youkuaiyun.com/wust_towave/article/details/8961418</guid><author>wust_towave</author><pubDate>Wed, 22 May 2013 17:09:57 +0800</pubDate><description><![CDATA[Tian Ji -- The Horse Racing



Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)


Total Submission(s): 3144 Accepted Submission(s): 769


 



Problem Des]]></description><category></category></item></channel></rss>