题目链接：

GCD

Time Limit: 6000/3000 MS (Java/Others)

Memory Limit: 32768/32768 K (Java/Others)

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

1 3 1 5 1

1 11014 1 14409 9

Sample Output

Case 1: 9

Case 2: 736427

题意：

求gcd(x,y)==k的(x,y)对数;1<=x<=b,1<=y<=d;

思路：

gcd(x,y)=k,即gcd(x/k,y/k)=1;

变成求[1,b/k][1,d/k]中的互质的对数;

f(d)表示gcd(x,y)=d的对数;F(d)表示d|gcd(x,y)的对数;

这里求的是f(1);由莫比乌斯反演f(n)=∑(n|d)µ(d/n)F(d)知

f(1)=∑µ(i)*F(i) (1<=i<=min(b/k,d/k));

AC代码：

转载于:https://www.cnblogs.com/zhangchengc919/p/5634157.html

hdu-1695 GCD(莫比乌斯反演)相关推荐

BZOJ 2820 YY的GCD 莫比乌斯反演
题意:链接方法:莫比乌斯反演解析: 这题跟上一篇博客有一点差别,当然我们能够考虑枚举素数这个大暴力.只是当你A掉这道题后发现正解?都将近5s时.就放弃了这个念头. 相同的式子我们能够直接搬过来.p ...
BZOJ 2820 YY的GCD 莫比乌斯反演
2820: YY的GCD Description 神犇YY虐完数论后给傻×kAc出了一题给定N, M,求1<=x<=N, 1<=y<=M且gcd(x, y)为质数的(x, y) ...
【bzoj2820】YY的GCD 莫比乌斯反演
题目描述神犇YY虐完数论后给傻×kAc出了一题给定N, M,求1<=x<=N, 1<=y<=M且gcd(x, y)为质数的(x, y)有多少对kAc这种傻×必然不会了,于是 ...
HYSBZ - 2818 Gcd —— 莫比乌斯反演
2818: Gcd Time Limit: 10 Sec Memory Limit: 256 MB Submit: 8172 Solved: 3609 Description 给定整数N,求1&l ...
YY的GCD 莫比乌斯反演
---题面--- 题解: $ans = \sum_{x = 1}^{n}\sum_{y = 1}^{m}\sum_{i = 1}^{k}[gcd(x, y) == p_{i}]$其中k为质数个数 $$ ...
bzoj 2820 YY的GCD - 莫比乌斯反演 - 线性筛
Description 神犇YY虐完数论后给傻×kAc出了一题给定N, M,求1<=x<=N, 1<=y<=M且gcd(x, y)为质数的(x, y)有多少对kAc这种傻×必 ...
HDU - 4746预处理莫比乌斯反演
链接求[1,n] 和 [1,m]中有多少对数的GCD的素因子个数小于等于p 直接暴力做特定超时,所以我们想办法预处理,对于p大于18(1到5e5的最大素数因子个数)的情况,每一对都满足条件,O(1) ...
[洛谷P2257] YY的GCD (莫比乌斯反演)
YY的GCD 题目描述神犇YY虐完数论后给傻×kAc出了一题给定N, M,求1<=x<=N, 1<=y<=M且gcd(x, y)为质数的(x, y)有多少对 kAc这种傻× ...
莫比乌斯反演--懵逼反演系列
反演的定义设有数论函数f(n),g(n)f(n),g(n)f(n),g(n),其中g(n)g(n)g(n)已知且f(n),g(n)f(n),g(n)f(n),g(n)满足关系g(n)=∑i=0na ...
数学--数论--HDU 4675 GCD of Sequence(莫比乌斯反演+卢卡斯定理求组合数+乘法逆元+快速幂取模）
先放知识点: 莫比乌斯反演卢卡斯定理求组合数乘法逆元快速幂取模 GCD of Sequence Alice is playing a game with Bob. Alice shows N i ...

hdu-1695 GCD(莫比乌斯反演)

GCD

hdu-1695 GCD(莫比乌斯反演)相关推荐

最新文章

热门文章