摘要：
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 tw... 阅读全文
posted @ 2014-12-12 23:38
Popco
阅读(136)
评论(0)
推荐(0)
摘要：
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 t... 阅读全文
posted @ 2014-12-12 23:18
Popco
阅读(125)
评论(0)
推荐(0)
摘要：
Division Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 through 9 once each, ... 阅读全文
posted @ 2014-12-12 23:05
Popco
阅读(128)
评论(0)
推荐(0)
浙公网安备 33010602011771号