2017年5月24日

Fractions Again?! UVA - 10976

摘要: It is easy to see that for every fraction in the form 1k(k > 0), we can always find two positive integersx and y, x ≥ y, such that:1k=1x+1yNow our que 阅读全文

posted @ 2017-05-24 20:46 九月旧约 阅读(166) 评论(0) 推荐(0)

Maximum Product UVA - 11059

摘要: Given a sequence of integers S = {S1, S2, . . . , Sn}, you should determine what is the value of themaximum positive product involving consecutive ter 阅读全文

posted @ 2017-05-24 20:41 九月旧约 阅读(138) 评论(0) 推荐(0)

导航