![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
暴力
文章平均质量分 80
geguojun
天道酬勤
展开
-
Fractions Again?!(暴力)
Problem A: Fractions Again?! Time limit: 1 second It is easy to see that for every fraction in the form (k > 0), we can always find two positive integers x and y, x ≥ y, such原创 2014-10-26 20:22:46 · 709 阅读 · 0 评论 -
Maximum Product(暴力)
DescriptionAC Problem D - Maximum Product Time Limit: 1 second Given a sequence of integers S = {S1, S2, ..., Sn}, you should determine what is the value of the maximum positive product原创 2014-10-26 20:20:30 · 481 阅读 · 0 评论