Oops的博客

http://acm.hdu.edu.cn/showproblem.php?pid=2082 思路;这题直接套用模板，因为1是有限个，所以初始化要改变一下，而且求的是小于等于50的总和，所以把各项加起来。 #include <iostream> #include <stdio.h> #include <string.h> #include <algo...

http://acm.hdu.edu.cn/showproblem.php?pid=1709 思路：思路：这题的题意是用给出的数加或者减来组合一个新的数，然后输出不能凑到的数，其实这里只要加一步c2[j-k]+=c1[j]或者c2[k-j]+=c1[j]就可以了 代码： #include <iostream> #include <stdio.h> #include ...

Ignatius and the Princess III Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 25660    Accepted Submission(s): 17729   Problem Description "...

Square Coins Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14296    Accepted Submission(s): 9824   Problem Description People in Silverlan...

Holding Bin-Laden Captive! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 25860    Accepted Submission(s): 11408   Problem Description We a...

Fruit Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5775    Accepted Submission(s): 3402   Problem Description 转眼到了收获的季节，由于有TT的专业指导，Lele获得...

Crisis of HDU Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6495    Accepted Submission(s): 1999   Problem Description 话说上回讲到HDU大战东洋小苟，结果自...