<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ACResume的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ACResume</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ACResume]]></copyright><item><title><![CDATA[HDU 2504 又见GCD（水）]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7675266</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7675266</guid><author>ACResume</author><pubDate>Tue, 19 Jun 2012 08:40:57 +0800</pubDate><description><![CDATA[又见GCD
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)



Problem Description
有三个正整数a,b,c(0

 

Input
第一行输入一个n，表示有n组测试数据，接下来的n行，每行输入两个正整数a,b。

 

Outp]]></description><category></category></item><item><title><![CDATA[HDU 2136 Largest prime factor (水)]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7675231</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7675231</guid><author>ACResume</author><pubDate>Tue, 19 Jun 2012 08:09:00 +0800</pubDate><description><![CDATA[Largest prime factor
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)




Problem Description
Everybody knows any number can be combined by the prime number.]]></description><category></category></item><item><title><![CDATA[HDU 2104 hide handkerchief （水）]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7612855</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7612855</guid><author>ACResume</author><pubDate>Tue, 29 May 2012 15:07:12 +0800</pubDate><description><![CDATA[hide handkerchief

Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)




Problem Description

The Children’s Day has passed for some days .Has you remembere]]></description><category></category></item><item><title><![CDATA[HDU 2095 find your present (2) （水）]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7612848</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7612848</guid><author>ACResume</author><pubDate>Tue, 29 May 2012 15:04:51 +0800</pubDate><description><![CDATA[find your present (2)

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/1024 K (Java/Others)




Problem Description

In the new year party, everybody will get a "special present]]></description><category></category></item><item><title><![CDATA[HDU 1197 Specialized Four-Digit Numbers （水）]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7612822</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7612822</guid><author>ACResume</author><pubDate>Tue, 29 May 2012 15:00:22 +0800</pubDate><description><![CDATA[Specialized Four-Digit Numbers

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)




Problem Description

Find and list all four-digit numbers in decimal no]]></description><category></category></item><item><title><![CDATA[HDU 1196 Lowest Bit （水）]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7612809</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7612809</guid><author>ACResume</author><pubDate>Tue, 29 May 2012 14:58:44 +0800</pubDate><description><![CDATA[Lowest Bit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)




Problem Description

Given an positive integer A (1 

For example, given A = 26, we can w]]></description><category></category></item><item><title><![CDATA[HDU 1076 An Easy Task （水）]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7612789</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7612789</guid><author>ACResume</author><pubDate>Tue, 29 May 2012 14:54:54 +0800</pubDate><description><![CDATA[An Easy Task

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)




Problem Description

Ignatius was born in a leap year, so he want to know when he could h]]></description><category></category></item><item><title><![CDATA[HDU 1062 Text Reverse （水）]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7612771</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7612771</guid><author>ACResume</author><pubDate>Tue, 29 May 2012 14:52:25 +0800</pubDate><description><![CDATA[Text Reverse

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)




Problem Description

Ignatius likes to write words in reverse way. Given a single line of]]></description><category></category></item><item><title><![CDATA[HDU 1061 Rightmost Digit（水）]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7612759</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7612759</guid><author>ACResume</author><pubDate>Tue, 29 May 2012 14:48:49 +0800</pubDate><description><![CDATA[Rightmost Digit

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)




Problem Description

Given a positive integer N, you should output the most right digi]]></description><category></category></item><item><title><![CDATA[HDU 1205 吃糖果（水）]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7612725</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7612725</guid><author>ACResume</author><pubDate>Tue, 29 May 2012 14:42:56 +0800</pubDate><description><![CDATA[吃糖果

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)




Problem Description

HOHO，终于从Speakless手上赢走了所有的糖果，是Gardon吃糖果时有个特殊的癖好，就是不喜欢将一样的糖果放在一起吃，喜欢先吃一种，下一次吃另一]]></description><category></category></item><item><title><![CDATA[HDU 4004 The Frog's Games]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7576070</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7576070</guid><author>ACResume</author><pubDate>Thu, 17 May 2012 14:54:24 +0800</pubDate><description><![CDATA[The Frog's Games

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)




Problem Description

The annual Games in frogs' kingdom started again. The most famou]]></description><category></category></item><item><title><![CDATA[HDU 3743 Frosh Week]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7566315</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7566315</guid><author>ACResume</author><pubDate>Mon, 14 May 2012 20:27:17 +0800</pubDate><description><![CDATA[Frosh Week

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)




Problem Description

During Frosh Week, students play various fun games to get to know each]]></description><category></category></item><item><title><![CDATA[HDU 1003 Max Sum]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7566180</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7566180</guid><author>ACResume</author><pubDate>Mon, 14 May 2012 19:48:57 +0800</pubDate><description><![CDATA[Max Sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)



Problem Description

Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max]]></description><category></category></item><item><title><![CDATA[HDU 1997 汉诺塔VII]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7525917</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7525917</guid><author>ACResume</author><pubDate>Tue, 01 May 2012 16:24:47 +0800</pubDate><description><![CDATA[汉诺塔VII

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)




Problem Description

n个盘子的汉诺塔问题的最少移动次数是2^n-1,即在移动过程中会产生2^n个系列。由于发生错移产生的系列就增加了，这种错误是放错了柱子，并不会把大盘]]></description><category></category></item><item><title><![CDATA[HDU 1207 汉诺塔II]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7525351</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7525351</guid><author>ACResume</author><pubDate>Tue, 01 May 2012 10:35:56 +0800</pubDate><description><![CDATA[汉诺塔II

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)




Problem Description

经典的汉诺塔问题经常作为一个递归的经典例题存在。可能有人并不知道汉诺塔问题的典故。汉诺塔来源于印度传说的一个故事，上帝创造世界时作了三根金刚石柱子，在]]></description><category></category></item><item><title><![CDATA[HDU 1716 排列2]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7524110</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7524110</guid><author>ACResume</author><pubDate>Mon, 30 Apr 2012 15:26:06 +0800</pubDate><description><![CDATA[排列2


Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)





Problem Description

Ray又对数字的列产生了兴趣：
现有四张卡片，用这四张卡片能排列出很多不同的4位数，要求按从小到大的顺序输出这些4位数。]]></description><category></category></item><item><title><![CDATA[HDU 1028 Ignatius and the Princess III]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7523969</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7523969</guid><author>ACResume</author><pubDate>Mon, 30 Apr 2012 14:08:13 +0800</pubDate><description><![CDATA[Ignatius and the Princess III
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6541    Accepted Submission(s): 4620



Problem Description]]></description><category></category></item><item><title><![CDATA[HDU 2045 不容易系列之(3)—— LELE的RPG难题]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7523936</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7523936</guid><author>ACResume</author><pubDate>Mon, 30 Apr 2012 13:48:56 +0800</pubDate><description><![CDATA[不容易系列之(3)—— LELE的RPG难题
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15562    Accepted Submission(s): 6179



Problem Description

人称]]></description><category></category></item><item><title><![CDATA[HDU 1425 sort]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7523910</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7523910</guid><author>ACResume</author><pubDate>Mon, 30 Apr 2012 13:37:19 +0800</pubDate><description><![CDATA[sort

Time Limit: 6000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)





Problem Description

给你n个整数，请按从大到小的顺序输出其中前m大的数。


 


Input

每组测试数据有两行，第一行有两个数n,m(0]]></description><category></category></item><item><title><![CDATA[HDU 1568 Fibonacci]]></title><link>https://blog.youkuaiyun.com/ACResume/article/details/7521593</link><guid>https://blog.youkuaiyun.com/ACResume/article/details/7521593</guid><author>ACResume</author><pubDate>Sat, 28 Apr 2012 23:12:37 +0800</pubDate><description><![CDATA[Fibonacci

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)




Problem Description

2007年到来了。经过2006年一年的修炼，数学神童zouyu终于把0到100000000的Fibonacci数列
(f[0]=0,f[1]]]></description><category></category></item></channel></rss>