![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
我的代码
u013533289
这个作者很懒,什么都没留下…
展开
-
A+B problem II
A + B Problem II Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 108 Accepted Submission(s) : 21 Font: Times New Roman | Verdana | Geo原创 2014-02-24 23:11:41 · 543 阅读 · 0 评论 -
POJ3628:Bookshelf 2【01背包】
Description Farmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top. FJ has N cows (原创 2014-09-27 20:41:52 · 559 阅读 · 0 评论 -
poj1035 Spell checker
Description You, 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 words using a known dictionary of all correct words原创 2014-09-27 21:03:39 · 300 阅读 · 0 评论 -
HDU 1022 Train Problem I
Problem Description As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is t原创 2014-09-16 21:05:42 · 423 阅读 · 0 评论 -
J - MANAGER(2.4.5)
J - MANAGER(2.4.5) Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Description One of the program转载 2014-07-22 21:53:50 · 417 阅读 · 0 评论 -
H - Gold Coins(2.4.1)
H - Gold Coins(2.4.1) Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u Submit Status Description The king pays h原创 2014-07-22 21:27:33 · 405 阅读 · 0 评论 -
I - The 3n + 1 problem(2.4.2)
I - The 3n + 1 problem(2.4.2) Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Description Problem原创 2014-07-22 21:49:51 · 385 阅读 · 0 评论 -
J - Vertical Histogram(1.5.7)
J - Vertical Histogram(1.5.7) Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatus Description Write a program to read four lines of upper case (i.e., al原创 2014-07-20 11:13:22 · 480 阅读 · 0 评论 -
钥匙计数之一
钥匙计数之一 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 1 Accepted Submission(s) : 1 Font: Times New Roman | Verdana | Georgia Font Size:转载 2014-04-05 10:03:03 · 534 阅读 · 0 评论 -
df
hdu 1052 Tian Ji -- The Horse Racing (2011-08-26 08:32:51) 转载▼ 标签: 杂谈 分类: acm杂谈 Tian Ji -- The Horse Racing Time Limit : 2000/1000ms (Java/Other) Memory Li转载 2014-04-05 11:55:17 · 422 阅读 · 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); 2)但是即使前面n-2个人不是合法的队列,加上两个女生也有可转载 2014-03-22 11:14:19 · 488 阅读 · 0 评论 -
Delta-wave
Delta-wave Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 35 Accepted Submission(s) : 9 Font: Times New Roman | Verdana | Georgia Font原创 2014-03-21 20:11:40 · 442 阅读 · 0 评论 -
Heritage from father Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131070/65535K (Java/Other) Total Submission(s) : 73 Accepted Submission(s) : 26 Font: Times New Roman | Verdana | Geor原创 2014-03-21 16:56:15 · 625 阅读 · 0 评论 -
Integer Inquiry
.Integer Inquiry Problem Description One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various原创 2014-02-20 17:21:37 · 740 阅读 · 0 评论 -
N!
求N! Problem Description Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N! Input One N in one line, process to the end of file. Output For each N, output N! in one line. Samp原创 2014-02-20 17:13:34 · 504 阅读 · 0 评论 -
算法思想:
算法思想: (1) 产生两个随机数 (2) 产生一个运算符 (3) 用户输入答案 (4) 验证答案正确与否 (5) 转(1) 重复执行 主函数中用到了srand(time(NULL))上百度查了一下和随机产生有关。如果在程序运行时没有自主设置种子的话,用函数rand产生的随机数序列会是一样的。 而用srand设置随机数种子后,可能产生不同的随机序列(概率很大)。 [c翻译 2014-02-24 23:20:31 · 535 阅读 · 0 评论 -
itoa()、atoi()、任意进制转换
头文件: itoa --功能:将任意类型的数字转换为字符串。在中与之有相反功能的函数是atoi。 atoi----功 能: 将字符串转换成整型数;atoi()会扫描参数nptr字符串,跳过前面的空格字符,直到遇上数字或正负号才开始做转换,而再遇到非数字或字符串时('\0')才结束转化,并将结果返回(返回转换后的整型数)。 用 法: int atoi(const char *nptr)转载 2015-04-07 21:34:33 · 523 阅读 · 0 评论