![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
OJ
文章平均质量分 90
CLAYFire
梦想就是被人不认同而自己却无比坚信的事
展开
-
XCOJ 1200
题目地址:http://xcacm.hfut.edu.cn/problem.php?id=1200 这道题的数据并不是很大,所以可以直接从小开始算,不需要去寻找最优的算法#include using namespace std; int n,m,tt,l; int gcd(int a,int b) { if(b==0) return a; return gcd(b,a%b原创 2015-12-30 23:36:13 · 516 阅读 · 0 评论 -
C++ OJ HDU 1159 Common Subsequence
C++ OJ HDU 1159 Common Subsequence CLAY 撰写 XCOJ 动态规划 暂无评论 Now I think you have got an AC in Ignatius.L’s “Max Sum” problem. To be a brave ACMer, we always challenge ourselves to more diffic原创 2016-04-23 15:26:25 · 585 阅读 · 0 评论