Co-prime（容斥定理）

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.
Input
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).
Output
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.
Sample Input
2
1 10 2
3 15 5
Sample Output
Case #1: 5
Case #2: 10

Hint
In the first test case, the five integers in range [1,10] which are relatively prime to 2 are {1,3,5,7,9}.

当有n个需要选择时，一共被选择的次数减去被选择两次的个数，加上被选择三次的，减去被选择四次的，依次类推，就是被选择的并集；
ac代码：

#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;

long long t,sum1,sum2,cnt,cnt1,a,b,n,m[105],c=0;