![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Taurus's Trial
新人小程序猿
想想就好了,梦里啥都有
展开
-
Super Jumping! Jumping! Jumping!(简单的动态规划) (F-6)
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 53174 Accepted Submission(s): 24652Problem DescriptionNo...原创 2019-01-30 00:36:47 · 157 阅读 · 0 评论 -
Find The Multiple(DFS、BFS) (I-9)
Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 45650 Accepted: 19079DescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whos...原创 2019-01-30 01:20:43 · 104 阅读 · 0 评论 -
Prepared for New Acmer(快速幂解法) (J-0)
Prepared for New AcmerProblem Description集训进行了将近2个礼拜,这段时间以恢复性训练为主,我一直在密切关注大家的训练情况,目前为止,对大家的表现相当满意,首先是绝大部分队员的训练积极性很高,其次,都很遵守集训纪律,最后,老队员也起到了很好的带头作用,这里特别感谢为这次DP专题练习赛提供题目和测试数据的集训队队长xhd同学.特别高兴的是,跟随集训...原创 2019-01-19 13:02:06 · 138 阅读 · 0 评论 -
A. Kefa and First Steps(求最大连续递增的子数列的元素个数) (C-3)
A. Kefa and First StepsKefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1 ≤ i ≤ n) he makes ai money. Kefa loves progress, that’s why...原创 2019-01-18 22:53:12 · 226 阅读 · 0 评论