当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

4135：Co-prime

题目描述
Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N.
Two integers are said to be co-prime or relatively prime if they have no common positive divisors other than 1 or, equivalently, if their greatest common divisor is 1. The number 1 is relatively prime to every integer.
输入解释
The first line on input contains T (0 < T <= 100) the number of test cases, each of the next T lines contains three integers A, B, N where (1 <= A <= B <= 1015) and (1 <=N <= 109).
输出解释
For each test case, print the number of integers between A and B inclusive which are relatively prime to N. Follow the output format below.
输入样例 
2
1 10 2
3 15 5
输出样例 
Case #1: 5
Case #2: 10
提示
In the first test case, the five integers in range [1,10] which are relatively prime to 2 are {1,3,5,7,9}.
来自杭电HDUOJ的附加信息
Recommend lcy
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 The Third Lebanese Collegiate Programming Contest
源链接： HDU-4135
最后修改于 2020-10-25T23:10:36+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)