摘要：
10976 Fractions AgainIt 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 ... 阅读全文
posted @ 2015-07-29 17:04
hfcnal
阅读(572)
评论(0)
推荐(2)
摘要：
Disease ManangementQ -枚举子集Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uDescriptionAlas! A set of D (1 #include#includeu... 阅读全文
posted @ 2015-07-29 15:48
hfcnal
阅读(433)
评论(0)
推荐(1)
浙公网安备 33010602011771号