03 2018 档案

摘要:It is easy to see that for every fraction in the form 1 k (k > 0), we can always find two positive integers x and y, x ≥ y, such that: 1/ k = 1 /x + 1 阅读全文
posted @ 2018-03-30 20:42 子诚- 阅读(158) 评论(0) 推荐(0)
摘要:Given a sequence of integers S = {S1, S2, . . . , Sn}, you should determine what is the value of the maximum positive product involving consecutive te 阅读全文
posted @ 2018-03-28 22:55 子诚- 阅读(126) 评论(0) 推荐(0)
摘要:Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 through 9 once each, such that the first numbe 阅读全文
posted @ 2018-03-28 21:38 子诚- 阅读(258) 评论(1) 推荐(0)