HDU-4135-Co-prime

Problem Description
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 <= 1015) and (1 <=N <= 109).

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

#include<iostream>
#include<vector>
using namespace std;
#define ll long long
vector<ll>Div;
ll Solve(ll A,ll B,int N)
{
    Div.clear();
    int len;
    for (int i = 2;i*i<=N; i++)
    {
        if (N%i == 0)
        {
            len = Div.size();
            Div.push_back(i*(-1));
            while (N%i == 0)
                N = N / i;
            for (int j = 0; j < len; j++)
                Div.push_back(Div[j] * i*(-1));
        }
    }
    if (N > 1)
    {
        len = Div.size();
        Div.push_back(N*(-1));
        for (int j = 0; j < len; j++)
            Div.push_back(Div[j] * N*(-1));
    }
    ll sum = B - A + 1;
    for (int i = 0; i < Div.size(); i++)
    {
        sum = sum - (A-1) / Div[i];
        sum = sum + B / Div[i];
    }
    return sum;
}
int main()
{
    int T, n;
    ll a, b;
    scanf("%d", &T);
    for (int i = 1; i <= T; i++)
    {
        scanf("%lld%lld%d", &a, &b, &n);
        ll number = Solve(a, b, n);
        printf("Case #%d: %lld\n", i, number);
    }
    return 0;
}