Problem H. Co-prime

时间限制 1000 ms   内存限制 32 MB

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 <= 10 15) and (1 <=N <= 10 9).
 

输出数据

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}. 
         
 

提交

请先 登录

© 2025 FAQs Contact About