HDU2588 GCD【欧拉函数】

GCD
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5184 Accepted Submission(s): 2790

Problem Description
The greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the largest divisor common to a and b,For example,(1,2)=1,(12,18)=6.
(a,b) can be easily found by the Euclidean algorithm. Now Carp is considering a little more difficult problem:
Given integers N and M, how many integer X satisfies 1<=X<=N and (X,N)>=M.

Input
The first line of input is an integer T(T<=100) representing the number of test cases. The following T lines each contains two numbers N and M (2<=N<=1000000000, 1<=M<=N), representing a test case.

Output
For each test case,output the answer on a single line.

Sample Input
3
1 1
10 2
10000 72

Sample Output
1
6
260

Source
ECJTU 2009 Spring Contest

问题链接：HDU2588 GCD
问题简述：（略）
问题分析：用欧拉函数来解决，不解释。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* HDU2588 GCD */

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

/* 欧拉函数 */
LL phi(LL n)
{
    LL ret = n;
    for(LL i = 2; i * i <= n; i++) {
        if(n % i == 0) {
            ret -= ret / i;
            while(n % i == 0) n /= i;
        }
    }
    if(n > 1) ret -= ret / n;

    return ret;
}

int main()
{
    int t;
    LL n, m;

    scanf("%d", &t);
    while(t--) {
        scanf("%lld%lld", &n, &m);

        LL ans = 0;
        for(LL i = 1; i * i <= n; i++) {
            if(n % i == 0) {
                if(i >= m) ans += phi(n / i);
                if(i * i != n && n / i >= m) ans += phi(i);
            }
        }

        printf("%lld\n", ans);
    }

    return 0;
}