<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[樂樂被打击了的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/u012230199</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; u012230199]]></copyright><item><title><![CDATA[1002. Valuable Jewellery]]></title><link>https://blog.csdn.net/u012230199/article/details/20238813</link><guid>https://blog.csdn.net/u012230199/article/details/20238813</guid><author>u012230199</author><pubDate>Sat, 01 Mar 2014 21:59:02 +0800</pubDate><description><![CDATA[1002. Valuable Jewellery





 



 







Total:
149

Accepted:
21







 



 

 

 









 

 

 



 




Time Limit: 2sec    Memo]]></description><category></category></item><item><title><![CDATA[1137. 河床 变笨了]]></title><link>https://blog.csdn.net/u012230199/article/details/19933037</link><guid>https://blog.csdn.net/u012230199/article/details/19933037</guid><author>u012230199</author><pubDate>Tue, 25 Feb 2014 21:14:39 +0800</pubDate><description><![CDATA[1137. 河床

Constraints
Time Limit: 10 secs, Memory Limit: 32 MB
Description
地理学家们经常要对一段河流进行测量分析。他们从上游开始向下游方向等距离地选择了n(≤30000)个点测量水位深度。得到一组数据d1，d2，……，dn，回到实验室后数据分析员根据需要对数据进行分析，发掘隐藏在数据背后的规律。最近，乌龙博士发现]]></description><category></category></item><item><title><![CDATA[2382. Flowers Flourish from France]]></title><link>https://blog.csdn.net/u012230199/article/details/19773035</link><guid>https://blog.csdn.net/u012230199/article/details/19773035</guid><author>u012230199</author><pubDate>Sun, 23 Feb 2014 22:18:32 +0800</pubDate><description><![CDATA[2382. Flowers Flourish from France


Constraints

Time Limit: 1 secs, Memory Limit: 256 MB

Description





Fiona has always loved poetry, and recently she discovered a fascinating poeti]]></description><category></category></item><item><title><![CDATA[C++ 标准库之cctype]]></title><link>https://blog.csdn.net/u012230199/article/details/19772471</link><guid>https://blog.csdn.net/u012230199/article/details/19772471</guid><author>u012230199</author><pubDate>Sun, 23 Feb 2014 22:09:39 +0800</pubDate><description><![CDATA[C++ 语言下
头文件：#include 
说明： 字符处理库
功能一：字符测试
1> 函数原型均为int isxxxx(int)
2> 参数为int, 任何实参均被提升成整型
3> 只能正确处理处于[0, 127]之间的值
 
功能二：字符映射
1> 函数原型为int toxxxx(int)
2> 对参数进行检测, 若符合范围则转换, 否则不变


备注说明：C语言下的]]></description><category></category></item><item><title><![CDATA[C++中cin、cin.get()、cin.getline()、getline()、gets()等函数的用法]]></title><link>https://blog.csdn.net/u012230199/article/details/19771133</link><guid>https://blog.csdn.net/u012230199/article/details/19771133</guid><author>u012230199</author><pubDate>Sun, 23 Feb 2014 21:44:52 +0800</pubDate><description><![CDATA[转载来源：http://www.cnblogs.com/flatfoosie/archive/2010/12/22/1914055.html


学C++的时候，这几个输入函数弄的有点迷糊；这里做个小结，为了自己复习，也希望对后来者能有所帮助，如果有差错的地方还请各位多多指教（本文所有程序均通过VC 6.0运行）
1、cin 
2、cin.get() 
3、cin.getline() ]]></description><category></category></item><item><title><![CDATA[7144. Different Triangles 回校第一天 来个水题]]></title><link>https://blog.csdn.net/u012230199/article/details/19711619</link><guid>https://blog.csdn.net/u012230199/article/details/19711619</guid><author>u012230199</author><pubDate>Sat, 22 Feb 2014 23:14:30 +0800</pubDate><description><![CDATA[7144. Different Triangles

Constraints
Time Limit: 1 secs, Memory Limit: 256 MB
Description
 
Given N sticks of different length, please find out how many different ways you can form a triangle ]]></description><category></category></item><item><title><![CDATA[1002. Highways]]></title><link>https://blog.csdn.net/u012230199/article/details/19089403</link><guid>https://blog.csdn.net/u012230199/article/details/19089403</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:52:32 +0800</pubDate><description><![CDATA[1002. Highways





 



 







Total:
74

Accepted:
29







 



 

 

 









 

 

 



 




Time Limit: 1sec    Memory Limit:32]]></description><category></category></item><item><title><![CDATA[1001. Robot]]></title><link>https://blog.csdn.net/u012230199/article/details/19089385</link><guid>https://blog.csdn.net/u012230199/article/details/19089385</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:51:39 +0800</pubDate><description><![CDATA[1001. Robot





 









 

 

 



 




Time Limit: 1sec    Memory Limit:32MB

Description

Karell Incorporated has designed a new exploration robot that has the ]]></description><category></category></item><item><title><![CDATA[1000. Campus]]></title><link>https://blog.csdn.net/u012230199/article/details/19089363</link><guid>https://blog.csdn.net/u012230199/article/details/19089363</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:50:55 +0800</pubDate><description><![CDATA[1000. Campus












Total:
137
Accepted:
28








 
 
 











Time Limit: 1sec    Memory Limit:32MB
Description

At present, Zhongshan University ]]></description><category></category></item><item><title><![CDATA[1004. Academy Awards]]></title><link>https://blog.csdn.net/u012230199/article/details/19089331</link><guid>https://blog.csdn.net/u012230199/article/details/19089331</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:49:43 +0800</pubDate><description><![CDATA[1004. Academy Awards












Total:
78
Accepted:
36








 
 
 











Time Limit: 1sec    Memory Limit:32MB
Description

Selected from 3,850 teams ]]></description><category></category></item><item><title><![CDATA[1003. Message Flood]]></title><link>https://blog.csdn.net/u012230199/article/details/19089251</link><guid>https://blog.csdn.net/u012230199/article/details/19089251</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:49:02 +0800</pubDate><description><![CDATA[1003. Message Flood












Total:
152
Accepted:
41








 
 
 











Time Limit: 1sec    Memory Limit:32MB

Description




Well, how do you f]]></description><category></category></item><item><title><![CDATA[1002. Stick]]></title><link>https://blog.csdn.net/u012230199/article/details/19089235</link><guid>https://blog.csdn.net/u012230199/article/details/19089235</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:46:40 +0800</pubDate><description><![CDATA[1002. Stick












Total:
107
Accepted:
62








 
 
 











Time Limit: 1sec    Memory Limit:32MB
Description

 Anthony has collected a large amo]]></description><category></category></item><item><title><![CDATA[1002. Stick]]></title><link>https://blog.csdn.net/u012230199/article/details/19089227</link><guid>https://blog.csdn.net/u012230199/article/details/19089227</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:46:26 +0800</pubDate><description><![CDATA[1002. Stick












Total:
107
Accepted:
62








 
 
 











Time Limit: 1sec    Memory Limit:32MB
Description

 Anthony has collected a large amo]]></description><category></category></item><item><title><![CDATA[1002. Stick]]></title><link>https://blog.csdn.net/u012230199/article/details/19089221</link><guid>https://blog.csdn.net/u012230199/article/details/19089221</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:46:06 +0800</pubDate><description><![CDATA[1002. Stick












Total:
107
Accepted:
62








 
 
 











Time Limit: 1sec    Memory Limit:32MB
Description

 Anthony has collected a large amo]]></description><category></category></item><item><title><![CDATA[1001. 统计数字]]></title><link>https://blog.csdn.net/u012230199/article/details/19089201</link><guid>https://blog.csdn.net/u012230199/article/details/19089201</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:45:43 +0800</pubDate><description><![CDATA[1001. 统计数字





 









 

 

 



 




Time Limit: 1sec    Memory Limit:32MB

Description

某次科研调查时得到了n个自然数，每个数均不超过1500000000（1.5*10^9）。已知不相同的数不超过10000个，现在需要统计这些自然]]></description><category></category></item><item><title><![CDATA[1001. 统计数字]]></title><link>https://blog.csdn.net/u012230199/article/details/19089185</link><guid>https://blog.csdn.net/u012230199/article/details/19089185</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:45:25 +0800</pubDate><description><![CDATA[1001. 统计数字





 









 

 

 



 




Time Limit: 1sec    Memory Limit:32MB

Description

某次科研调查时得到了n个自然数，每个数均不超过1500000000（1.5*10^9）。已知不相同的数不超过10000个，现在需要统计这些自然]]></description><category></category></item><item><title><![CDATA[1000. MJ, Nowhere to Hide]]></title><link>https://blog.csdn.net/u012230199/article/details/19089169</link><guid>https://blog.csdn.net/u012230199/article/details/19089169</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:44:52 +0800</pubDate><description><![CDATA[1000. MJ, Nowhere to Hide





 









 

 

 



 




Time Limit: 1sec    Memory Limit:32MB

Description

On BBS, there is a familiar term called MJ (short for Ma]]></description><category></category></item><item><title><![CDATA[1009. 范围统计]]></title><link>https://blog.csdn.net/u012230199/article/details/19089135</link><guid>https://blog.csdn.net/u012230199/article/details/19089135</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:44:05 +0800</pubDate><description><![CDATA[1009. 范围统计





 









 

 

 



 




Time Limit: 1sec    Memory Limit:256MB

Description

Given a list of N numbers and Q queries,for each query given two numbe]]></description><category></category></item><item><title><![CDATA[1007. Sorting Algorithm]]></title><link>https://blog.csdn.net/u012230199/article/details/19089109</link><guid>https://blog.csdn.net/u012230199/article/details/19089109</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:43:28 +0800</pubDate><description><![CDATA[1007. Sorting Algorithm












Total:
248
Accepted:
85








 
 
 











Time Limit: 1sec    Memory Limit:32MB
Description

One of the fundamental]]></description><category></category></item><item><title><![CDATA[1006. 奖学金]]></title><link>https://blog.csdn.net/u012230199/article/details/19089095</link><guid>https://blog.csdn.net/u012230199/article/details/19089095</guid><author>u012230199</author><pubDate>Tue, 11 Feb 2014 21:42:57 +0800</pubDate><description><![CDATA[1006. 奖学金





 









 




Time Limit: 1sec    Memory Limit:32MB

Description

某小学最近得到了一笔赞助，打算拿出其中一部分为学习成绩优秀的前5名学生发奖学金。期末，每个学生都有3门课的成绩：语文、数学、英语。先按总分从高到低排序，如果两个同学总分相同，再按语文]]></description><category></category></item></channel></rss>