hdu 1695 gcd(莫比乌斯反演)
gcd (莫比乌斯反演)
题目
Given 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 and y. Since the number of choices may be very l...
原创
2019-11-24 17:08:54 ·
173 阅读 ·
0 评论