随笔分类 -  我的代码

itoa()、atoi()、任意进制转换
摘要：头文件：itoa --功能：将任意类型的数字转换为字符串。在中与之有相反功能的函数是atoi。atoi----功 能: 将字符串转换成整型数；atoi()会扫描参数nptr字符串，跳过前面的空格字符，直到遇上数字或正负号才开始做转换，而再遇到非数字或字符串时（'\0'）才结束转化，并将结果返回（返回... 阅读全文
posted @ 2015-04-07 21:34 lazypark 阅读(395) 评论(0) 推荐(0)
poj1035 Spell checker
摘要：DescriptionYou, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given wor... 阅读全文
posted @ 2014-09-27 21:03 lazypark 阅读(130) 评论(0) 推荐(0)
POJ3628:Bookshelf 2【01背包】
摘要：DescriptionFarmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only avail... 阅读全文
posted @ 2014-09-27 20:41 lazypark 阅读(175) 评论(0) 推荐(0)
HDU 1022 Train Problem I
摘要：Problem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(becau... 阅读全文
posted @ 2014-09-16 21:05 lazypark 阅读(137) 评论(0) 推荐(0)
J - MANAGER(2.4.5)
摘要：J - MANAGER(2.4.5)Crawling in process...Crawling failedTime Limit:1000MSMemory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionOne ... 阅读全文
posted @ 2014-07-22 21:53 lazypark 阅读(158) 评论(0) 推荐(0)
I - The 3n + 1 problem(2.4.2)
摘要：I - The 3n + 1 problem(2.4.2)Crawling in process...Crawling failedTime Limit:1000MSMemory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatus Desc... 阅读全文
posted @ 2014-07-22 21:49 lazypark 阅读(143) 评论(0) 推荐(0)
H - Gold Coins(2.4.1)
摘要：H - Gold Coins(2.4.1)Crawling in process...Crawling failedTime Limit:1000MSMemory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmitStatus DescriptionT... 阅读全文
posted @ 2014-07-22 21:27 lazypark 阅读(141) 评论(0) 推荐(0)
J - Vertical Histogram(1.5.7)
摘要：J - Vertical Histogram(1.5.7)Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionWrite a program to read four lin... 阅读全文
posted @ 2014-07-20 11:13 lazypark 阅读(193) 评论(0) 推荐(0)
df
摘要：hdu1052TianJi--TheHorseRacing(2011-08-26 08:32:51)转载▼标签：杂谈分类：acm杂谈Tian Ji -- The Horse RacingTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536... 阅读全文
posted @ 2014-04-05 11:55 lazypark 阅读(138) 评论(0) 推荐(0)
钥匙计数之一
摘要：钥匙计数之一 Time Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 1Accepted Submission(s) : 1Font: Times New R... 阅读全文
posted @ 2014-04-05 10:03 lazypark 阅读(285) 评论(0) 推荐(0)
杭电ACM 1297 Children’s Queue
摘要：这道题是排序问题，可以用递归方法解决。计算F（n）:一：当最后一个是男孩M时候，前面n-1个随便排出来，只要符合规则就可以，即是F（n-1）；二：当最后一个是女孩F时候，第n-1个肯定是女孩F，这时候又有两种情况： 1）前面n-2个可以按n-2个的时候的规则来，完全可以，即是F（n-2）； ... 阅读全文
posted @ 2014-03-22 11:14 lazypark 阅读(254) 评论(0) 推荐(0)
Delta-wave
摘要：Delta-wave Time Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 35Accepted Submission(s) : 9Font: Times ... 阅读全文
posted @ 2014-03-21 20:11 lazypark 阅读(194) 评论(0) 推荐(0)

摘要：Heritage from father Time Limit : 2000/1000ms (Java/Other)Memory Limit : 131070/65535K (Java/Other)Total Submission(s) : 73Accepted Submission(s) : 26... 阅读全文
posted @ 2014-03-21 16:56 lazypark 阅读(156) 评论(0) 推荐(0)
算法思想：
摘要：算法思想：(1) 产生两个随机数(2) 产生一个运算符(3) 用户输入答案(4) 验证答案正确与否(5) 转(1) 重复执行 主函数中用到了srand(time(NULL))上百度查了一下和随机产生有关。如果在程序运行时没有自主设置种子的话，用函数rand产生的随机数序列会是一样的。而用srand设... 阅读全文
posted @ 2014-02-24 23:20 lazypark 阅读(166) 评论(0) 推荐(0)
A+B problem II
摘要：A + B Problem IITime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 108Accepted Submission(s) : 21Font:... 阅读全文
posted @ 2014-02-24 23:11 lazypark 阅读(122) 评论(0) 推荐(0)
Integer Inquiry
摘要：.Integer InquiryProblem DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go... 阅读全文
posted @ 2014-02-20 17:21 lazypark 阅读(136) 评论(0) 推荐(0)
N！
摘要：求N！Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N!InputOne N in one line, process to the end of file.OutputFor each... 阅读全文
posted @ 2014-02-20 17:13 lazypark 阅读(198) 评论(0) 推荐(0)