摘要: 数据的交换输出Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 153878 Accepted Submission(s): 56789 Problem Description 输入n(n int main(){ int n; ... 阅读全文
posted @ 2019-07-17 22:41 yyer 阅读(182) 评论(0) 推荐(0) 编辑
摘要: 偶数求和 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 130359 Accepted Submission(s): 53516 Problem 阅读全文
posted @ 2019-07-17 21:49 yyer 阅读(208) 评论(0) 推荐(0) 编辑
摘要: Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14587 Accepted Submission(s): 4853 Problem Description A Fibonacci sequence is... 阅读全文
posted @ 2019-07-17 17:55 yyer 阅读(119) 评论(0) 推荐(0) 编辑
摘要: 大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25998 Accepted Submission(s): 9316 Problem Description Fibonacci数列,定义如下:f(1)=f(2)=1f(n)=f... 阅读全文
posted @ 2019-07-17 17:50 yyer 阅读(147) 评论(0) 推荐(0) 编辑
摘要: 大明A+BTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16499 Accepted Submission(s): 6082 Problem Description 话说,经过了漫长的一个多月,小明已经成长了许多,所以他改了一个名字... 阅读全文
posted @ 2019-07-17 17:41 yyer 阅读(177) 评论(0) 推荐(0) 编辑
摘要: Product The ProblemThe problem is to multiply two integers X, Y. (0<=X,Y<10250) The InputThe input will consist of a set of pairs of lines. Each line in pair contains one multiplyer. The OutputFor eac... 阅读全文
posted @ 2019-07-17 17:29 yyer 阅读(215) 评论(0) 推荐(0) 编辑
摘要: B题 HDU1060 Leftmost Digit Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22158 Accepted Submissi 阅读全文
posted @ 2019-07-16 16:17 yyer 阅读(214) 评论(0) 推荐(0) 编辑
摘要: A题 HDOJ1002(大数加法) A + B Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 483720 Accepte 阅读全文
posted @ 2019-07-16 15:52 yyer 阅读(222) 评论(0) 推荐(0) 编辑
摘要: BeautifulSoup库是解析、遍历、维护.html或.xml的功能库 ①BeautifulSoup库的安装: 在cmd命令行中输入: pip install beautifulsoup4即可 ②BeautifulSoup库的引用: from bs4 import BeautifulSoup BeautifulSoup库,也叫beautifulsoup4或bs4 ③检测Beautiful S... 阅读全文
posted @ 2019-07-12 15:02 yyer 阅读(295) 评论(0) 推荐(0) 编辑
摘要: 贪心法(又称贪婪法)是指,在对问题求解时,总是做出在当前看来是最好的选择。也就是说,不从整体最优上加以考虑,所做出的是在某种意义上的局部最优解。 贪心算法不是对所有问题都能得到整体最优解,关键是贪心策略的选择,选择的贪心策略必须具备无后效性,即某个状态以前的过程不会影响以后的状态,只与当前状态有关。 HDU 1009(贪心) FatMouse' TradeTime Limit: 2000/1... 阅读全文
posted @ 2019-07-11 23:13 yyer 阅读(205) 评论(0) 推荐(0) 编辑