<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[libing923的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/libing923</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; libing923]]></copyright><item><title><![CDATA[poj 3160 Father Christmas flymouse]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/9823325</link><guid>https://blog.youkuaiyun.com/libing923/article/details/9823325</guid><author>libing923</author><pubDate>Wed, 07 Aug 2013 22:07:13 +0800</pubDate><description><![CDATA[Father Christmas flymouse




Time Limit: 1000MS
 
Memory Limit: 131072K


Total Submissions: 2156
 
Accepted: 728




Description

After retirement as contestant from WHU ACM Team,]]></description><category></category></item><item><title><![CDATA[poj 2762 Going from u to v or from v to u?]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/9815767</link><guid>https://blog.youkuaiyun.com/libing923/article/details/9815767</guid><author>libing923</author><pubDate>Wed, 07 Aug 2013 13:31:24 +0800</pubDate><description><![CDATA[Going from u to v or from v to u?




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 12692
 
Accepted: 3271




Description

In order to make their sons brave, Jiaji]]></description><category></category></item><item><title><![CDATA[hdu 1823 Luck and Love]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/9765395</link><guid>https://blog.youkuaiyun.com/libing923/article/details/9765395</guid><author>libing923</author><pubDate>Mon, 05 Aug 2013 12:14:14 +0800</pubDate><description><![CDATA[Luck and Love
Time Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4333    Accepted Submission(s): 1085



Problem Description

世界上上最远的距离不是]]></description><category></category></item><item><title><![CDATA[hdu 2665 Kth number]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/9724631</link><guid>https://blog.youkuaiyun.com/libing923/article/details/9724631</guid><author>libing923</author><pubDate>Sat, 03 Aug 2013 00:55:03 +0800</pubDate><description><![CDATA[Kth number
Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3329    Accepted Submission(s): 1107


Problem Description
Give you a sequenc]]></description><category></category></item><item><title><![CDATA[LightOJ 1193 Dice (II)]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8978929</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8978929</guid><author>libing923</author><pubDate>Mon, 27 May 2013 11:20:40 +0800</pubDate><description><![CDATA[1193 - Dice (II)





PDF (English)
Statistics
Forum








Time Limit: 3 second(s)
Memory Limit: 32 MB





You have N dices; each of them has K faces numbered from 1 to K. N]]></description><category></category></item><item><title><![CDATA[nbu 2414 Please help the poor donkey!]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8974179</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8974179</guid><author>libing923</author><pubDate>Sat, 25 May 2013 19:44:37 +0800</pubDate><description><![CDATA[Please help the poor donkey!

Time Limit : 1000 MS | Memory Limit : 65536 KB

Submits : 27 | Solved : 3




Description

A donkey is on his way home with many goods hanging on the two side]]></description><category></category></item><item><title><![CDATA[hdu 2809 God of War]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8973684</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8973684</guid><author>libing923</author><pubDate>Sat, 25 May 2013 16:14:48 +0800</pubDate><description><![CDATA[God of War

Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 1024    Accepted Submission(s): 377



Problem Description

At 184~280 A]]></description><category></category></item><item><title><![CDATA[poj 1185 炮兵阵地]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8972651</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8972651</guid><author>libing923</author><pubDate>Sat, 25 May 2013 10:17:21 +0800</pubDate><description><![CDATA[炮兵阵地




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 14881
 
Accepted: 5580




Description

司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能]]></description><category></category></item><item><title><![CDATA[金山西山居初赛第四场]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8948466</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8948466</guid><author>libing923</author><pubDate>Mon, 20 May 2013 00:21:56 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=4554

hdu4554 叛逆的小明

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 77    Accepted Submission(s]]></description><category></category></item><item><title><![CDATA[金山西山居初赛第三场]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8945636</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8945636</guid><author>libing923</author><pubDate>Sun, 19 May 2013 00:07:11 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=4551


hdu4551 生日猜猜猜

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 224    Accepted Submissio]]></description><category></category></item><item><title><![CDATA[hdu 3221 Brute-force Algorithm]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8944129</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8944129</guid><author>libing923</author><pubDate>Sat, 18 May 2013 15:39:44 +0800</pubDate><description><![CDATA[Brute-force Algorithm

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 1825    Accepted Submission(s): 444



Problem Description

P]]></description><category></category></item><item><title><![CDATA[金山西山居初赛第二场]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8944020</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8944020</guid><author>libing923</author><pubDate>Sat, 18 May 2013 15:24:58 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=4548


hdu4548 美素数

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)

Total Submission(s): 0    Accepted Submission(]]></description><category></category></item><item><title><![CDATA[金山西山居初赛第一场]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8942432</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8942432</guid><author>libing923</author><pubDate>Sat, 18 May 2013 00:40:43 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=4545
hdu 4545 魔法串
Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 237    Accepted Submission(s): 9]]></description><category></category></item><item><title><![CDATA[zoj 3705 Applications]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8916009</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8916009</guid><author>libing923</author><pubDate>Sun, 12 May 2013 00:32:53 +0800</pubDate><description><![CDATA[Applications

Time Limit: 2 Seconds      
Memory Limit: 65536 KB 

Recently, the ACM/ICPC team of Marjar University decided to choose some new members from freshmen to take part in the ACM/ICPC c]]></description><category></category></item><item><title><![CDATA[zoj 3601 Unrequited Love]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8902193</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8902193</guid><author>libing923</author><pubDate>Wed, 08 May 2013 20:16:38 +0800</pubDate><description><![CDATA[Unrequited Love

Time Limit: 16 Seconds      
Memory Limit: 131072 KB 

There are n single boys and m single girls. Each of them may love none, one or several of other people unrequitedly and one]]></description><category></category></item><item><title><![CDATA[zoj 2682 People like People]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8892352</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8892352</guid><author>libing923</author><pubDate>Mon, 06 May 2013 21:11:23 +0800</pubDate><description><![CDATA[People like People

Time Limit: 2 Seconds      
Memory Limit: 65536 KB 

The students in Kim��s class did a popularity vote to determine who were popular in the class. Each student was asked to w]]></description><category></category></item><item><title><![CDATA[zoj 2684 ChonSu]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8892326</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8892326</guid><author>libing923</author><pubDate>Mon, 06 May 2013 20:47:16 +0800</pubDate><description><![CDATA[ChonSu

Time Limit: 2 Seconds      
Memory Limit: 65536 KB 

The genealogy of a family can be represented as a rooted tree, in which each node corresponds to a member of the family, and each edge]]></description><category></category></item><item><title><![CDATA[zoj 2838 Utopia]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8887877</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8887877</guid><author>libing923</author><pubDate>Sun, 05 May 2013 20:40:45 +0800</pubDate><description><![CDATA[Utopia

Time Limit: 5 Seconds      
Memory Limit: 32768 KB 

Few people know a secret nation in the world named Utopia. But I have been there before, where there are many beautiful villages. Seei]]></description><category></category></item><item><title><![CDATA[hdu 1545 01-K Code]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8886209</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8886209</guid><author>libing923</author><pubDate>Sun, 05 May 2013 10:56:07 +0800</pubDate><description><![CDATA[01-K Code
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 406    Accepted Submission(s): 96



Problem Description

Consider a code str]]></description><category></category></item><item><title><![CDATA[UVA 1162 Transcript]]></title><link>https://blog.youkuaiyun.com/libing923/article/details/8884665</link><guid>https://blog.youkuaiyun.com/libing923/article/details/8884665</guid><author>libing923</author><pubDate>Sat, 04 May 2013 19:19:16 +0800</pubDate><description><![CDATA[Transcript
 
A company wants to hire a new employee. The selection process consists of several attention tests, one of them consists in: each candidate must type each character he sees in a flashing]]></description><category></category></item></channel></rss>