<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u013514621的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u013514621</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u013514621]]></copyright><item><title><![CDATA[二分法 哈希表送上（详见sdut1480）]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19683387</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19683387</guid><author>u013514621</author><pubDate>Sat, 22 Feb 2014 14:32:39 +0800</pubDate><description><![CDATA[数据结构实验：哈希表


Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^

题目描述

 在n个数中，找出出现次数最多那个数字，并且输出出现的次数。如果有多个结果，输出数字最小的那一个。
输入

 单组数据，第一行数字n（1
接下来有n个数字，每个数字不超过100000000
输出

 出现次数最多的数字和次数]]></description><category></category></item><item><title><![CDATA[sdut 2123]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19678419</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19678419</guid><author>u013514621</author><pubDate>Sat, 22 Feb 2014 11:32:02 +0800</pubDate><description><![CDATA[向大家简绍一下二分法，先来个题，后续有更新]]></description><category></category></item><item><title><![CDATA[sdut  2039]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19678341</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19678341</guid><author>u013514621</author><pubDate>Sat, 22 Feb 2014 11:28:24 +0800</pubDate><description><![CDATA[数据结构上机实验之二分查找


Time Limit: 1000ms   Memory limit: 65536K  有疑问？点这里^_^

题目描述

 在一个递增的序列里，查找元素是否存在，若存在输出YES,不存在输出NO.
输入

 本题多组数据，首先输入一个数字n，然后输入n个数，数据保证数列递增，然后再输入一个查找数字。
输出

 若存在输出YES,不存在输出N]]></description><category></category></item><item><title><![CDATA[01背包最简单最经典的入门题]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19559313</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19559313</guid><author>u013514621</author><pubDate>Thu, 20 Feb 2014 16:01:57 +0800</pubDate><description><![CDATA[Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave … 
The bone collecto]]></description><category></category></item><item><title><![CDATA[01背包问题]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19559021</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19559021</guid><author>u013514621</author><pubDate>Thu, 20 Feb 2014 15:54:46 +0800</pubDate><description><![CDATA[B - 01背包
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u
Submit Status




Description

电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡]]></description><category></category></item><item><title><![CDATA[贪心 木棍问题]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19487645</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19487645</guid><author>u013514621</author><pubDate>Wed, 19 Feb 2014 14:58:56 +0800</pubDate><description><![CDATA[Wooden Sticks
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10140    Accepted Submission(s): 4169



Problem Description

There is a ]]></description><category></category></item><item><title><![CDATA[hdu 2039 最经典的入门题]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19478689</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19478689</guid><author>u013514621</author><pubDate>Wed, 19 Feb 2014 10:49:44 +0800</pubDate><description><![CDATA[三角形
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 42930 Accepted Submission(s): 14337


Problem Description
给定三条边，请你判断一下能不能组成一个三角形。


I]]></description><category></category></item><item><title><![CDATA[贪心问题 HDU 1051]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19474467</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19474467</guid><author>u013514621</author><pubDate>Wed, 19 Feb 2014 09:25:05 +0800</pubDate><description><![CDATA[Wooden Sticks
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10136    Accepted Submission(s): 4167



Problem Description

There is a ]]></description><category></category></item><item><title><![CDATA[贪心问题]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19472919</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19472919</guid><author>u013514621</author><pubDate>Wed, 19 Feb 2014 08:45:51 +0800</pubDate><description><![CDATA[There is a war and it doesn't look very promising for your country. Now it's time to act. You have a commando squad at your disposal and planning an ambush on an important enemy camp located nearby. Y]]></description><category></category></item><item><title><![CDATA[贪心问题]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19398087</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19398087</guid><author>u013514621</author><pubDate>Tue, 18 Feb 2014 09:47:27 +0800</pubDate><description><![CDATA[活动选择问题



Time Limit: 1000MS Memory limit: 65536K


题目描述

 sdut 大学生艺术中心每天都有n个活动申请举办，但是为了举办更多的活动，必须要放弃一些活动，求出每天最多能举办多少活动。


输入

 输入包括多组输入，每组输入第一行为申请的活动数n，从第2行到n+1行，每行两个数，是每个活动的开始时间b，结束时间e]]></description><category></category></item><item><title><![CDATA[HDU 2033]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19335277</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19335277</guid><author>u013514621</author><pubDate>Mon, 17 Feb 2014 14:31:48 +0800</pubDate><description><![CDATA[人见人爱A+B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 22013 Accepted Submission(s): 14593


Problem Description
HDOJ上面已经有10来道A+B的题目了，相信这些题]]></description><category></category></item><item><title><![CDATA[hdu 2021]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19246235</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19246235</guid><author>u013514621</author><pubDate>Sat, 15 Feb 2014 17:12:22 +0800</pubDate><description><![CDATA[发工资咯：）
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 27568 Accepted Submission(s): 15592


Problem Description
作为杭电的老师，最盼望的日子就是每月的8号了，因为这一]]></description><category></category></item><item><title><![CDATA[卡片游戏（虽然非常水，但费了好长时间做的，以此纪念吧]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19162095</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19162095</guid><author>u013514621</author><pubDate>Thu, 13 Feb 2014 15:22:06 +0800</pubDate><description><![CDATA[桌上有一叠牌，从第一张牌（既位于顶面的牌）开始从上往下依次编号为1~n。当至少还剩两张牌的时候进行以下操作：把第一张扔掉，然后把新的第一张放到整叠牌的后面。输入n，输出每次扔掉的牌，以及最后剩下的牌。
样例输入：
样例输出：1 3 5 7 4 2 6#include
const int MAXN=50;
int queue[MAXN];
int main()
{
    int n,i,fro]]></description><category></category></item><item><title><![CDATA[hdu 2020]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19154825</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19154825</guid><author>u013514621</author><pubDate>Thu, 13 Feb 2014 10:56:02 +0800</pubDate><description><![CDATA[绝对值排序 
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 36264 Accepted Submission(s): 17783


Problem Description
输入n(n


Input
输入数据有多组，每]]></description><category></category></item><item><title><![CDATA[HDU 2019]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19117409</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19117409</guid><author>u013514621</author><pubDate>Wed, 12 Feb 2014 14:10:26 +0800</pubDate><description><![CDATA[数列有序!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 41048 Accepted Submission(s): 17774


Problem Description
有n(n


Input
输入数据包含多个测试实]]></description><category></category></item><item><title><![CDATA[HDU 2017]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19108379</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19108379</guid><author>u013514621</author><pubDate>Wed, 12 Feb 2014 09:26:00 +0800</pubDate><description><![CDATA[字符串统计
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 36958 Accepted Submission(s): 20514


Problem Description
对于给定的一个字符串，统计其中数字字符出现的次数。
]]></description><category></category></item><item><title><![CDATA[字符串比较——最简单的方法（有点水）]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19042611</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19042611</guid><author>u013514621</author><pubDate>Mon, 10 Feb 2014 16:46:55 +0800</pubDate><description><![CDATA[简单字符串比较 


Time Limit: 1000MS Memory limit: 10000K 

题目描述
请使用字符串比较函数，比较两个字符串的大小，并按要求输出比较后的结果。字符串最长不超过15个字符。
输入两个字符串str1和str2，如果第一个字符串与第二个字符串相等，输出str1=str2，如果第一个字符串大于第二个字符串，输出str1>str2，如果第一个字符串小]]></description><category></category></item><item><title><![CDATA[杭电2014]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/19010545</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/19010545</guid><author>u013514621</author><pubDate>Sun, 09 Feb 2014 16:05:33 +0800</pubDate><description><![CDATA[acm]]></description><category></category></item><item><title><![CDATA[杭电2004]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/18700661</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/18700661</guid><author>u013514621</author><pubDate>Thu, 23 Jan 2014 11:02:18 +0800</pubDate><description><![CDATA[成绩转换
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 67208    Accepted Submission(s): 29344


Problem Description
输入一个百分制的成绩t，将其转换成对应的等级，]]></description><category></category></item><item><title><![CDATA[杭电2005]]></title><link>https://blog.youkuaiyun.com/u013514621/article/details/18700619</link><guid>https://blog.youkuaiyun.com/u013514621/article/details/18700619</guid><author>u013514621</author><pubDate>Thu, 23 Jan 2014 11:00:15 +0800</pubDate><description><![CDATA[第几天？
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 65684    Accepted Submission(s): 24940


Problem Description
给定一个日期，输出这个日期是该年的第几天。
]]></description><category></category></item></channel></rss>