ACM学习历程—HDU1695 GCD（容斥原理 || 莫比乌斯）
摘要：
DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x... 阅读全文
posted @ 2015-10-08 22:54 AndyQsmart 阅读(263) 评论(0) 推荐(0)
浙公网安备 33010602011771号