HDU 1695 GCD【欧拉函数+容斥原理】

传送门：

http://acm.split.hdu.edu.cn/showproblem.php?pid=1695

题意：

求有多少对(x,y)(1<=x<=b,1<=y<=d)满足gcd(x, y) = k。

思路：

在很多题目当中都可以找到此题的身影。注意到gcd(x,y)=k,说明x,y都能被k整除，那么,于是本题就可以转化为求在两个区间内寻找有多少对数互质。假设b<=d,我们可以在中枚举数i，对于每一个i，我们只需找到在中与i互质的个数，最后依次相加就可得到结果。 当i<=b/k时可以用欧拉函数求与i互质的个数，当b/k < i <= d/k时，区间中与i互质的个数 = b/k - （区间中与i不互质的个数）。
区间中与i不互质的数则就是i中素因子的倍数，将它们相加则就是答案，但是由于会有重叠部分，比如6既是2的倍数又是3的倍数，此时就可以用容斥原理来求解。

代码：

我的代码： http://acm.split.hdu.edu.cn/viewcode.php?rid=20102135
有注释的代码： http://972169909-qq-com.iteye.com/blog/1146522

描述：

GCD

Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10689 Accepted Submission(s): 4045

Problem Description
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 large, you’re only required to output the total number of different number pairs.
Please notice that, (x=5, y=7) and (x=7, y=5) are considered to be the same.

Yoiu can assume that a = c = 1 in all test cases.

Input
The input consists of several test cases. The first line of the input is the number of the cases. There are no more than 3,000 cases.
Each case contains five integers: a, b, c, d, k, 0 < a <= b <= 100,000, 0 < c <= d <= 100,000, 0 <= k <= 100,000, as described above.

Output
For each test case, print the number of choices. Use the format in the example.

Sample Input
2
1 3 1 5 1
1 11014 1 14409 9

Sample Output
Case 1: 9
Case 2: 736427

Hint
For the first sample input, all the 9 pairs of numbers are (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (2, 3), (2, 5), (3, 4), (3, 5).

Source
2008 “Sunline Cup” National Invitational Contest

Recommend
wangye | We have carefully selected several similar problems for you: 1689 1690 1693 1691 1692