分析:
要求到给出的n中,小于等于n与n的最大公约数大于等于m的对数,因为n特别大,xjb暴力显然不行的。
发现我们可以枚举出大于等于m的最大公约数k,算出有多少个(x, n)=k,求和就是答案。由于最大公约数确定后,用n除以k,由高斯定理知道,剩下的数的个数就是在n中k的倍数的个数,由于不能让k改变,所以求出剩下的数和n/k互质的数的个数,即1~n/k中与n/k互质的数的个数。
//
// Created by Matrix on 2015-12-20
// Copyright (c) 2015 Matrix. All rights reserved.
//
//
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <sstream>
#include <set>
#include <vector>
#include <stack>
#define ALL(x) x.begin(), x.end()
#define INS(x) inserter(x, x,begin())
#define ll long long
#define CLR(x) memset(x, 0, sizeof x)
using namespace std;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 10;
const int maxv = 1e3 + 10;
const double eps = 1e-9;
int t;
int n, m;
int num[100];
vector <int> fac;
vector <int> v;
void getFac(int step, int val) {
if(step == v.size()) {
if(val >= m)
fac.push_back(val);
return;
}
for(int i = 0, fa = 1; i <= num[step]; i++, fa *= v[step]) {
getFac(step+1, val * fa);
}
}
int oula(int s) {
int res = s;
// printf("s = %d ", s);
for(int i = 2; i * i <= s; i++) {
if(s % i == 0) {
res = res / i * (i - 1);
while(s % i == 0) s /= i;
}
if(s == 1) break;
}
if(s != 1) res = res / s * (s - 1);
// printf("oula = %d\n", res);
return res;
}
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
// freopen("out.txt","w",stdout);
#endif
scanf("%d", &t);
while(t--) {
scanf("%d%d", &n, &m);
int tmp = n;
CLR(num);
v.clear();
fac.clear();
for(int i = 2; i * i <= tmp; i++) {
if(tmp == 1) break;
if(tmp % i == 0) {
while(tmp % i == 0) {
tmp /= i;
num[v.size()]++;
}
v.push_back(i);
}
}
if(tmp != 1) {
num[v.size()]++;
v.push_back(tmp);
}
getFac(0, 1);
// sort(ALL(fac));
// for(int i = 0; i < fac.size(); i++)
// printf("%d ", fac[i]);
// puts("");
int ans = 0;
for(int i = 0; i < fac.size(); i++) {
ans += oula(n / fac[i]);
}
printf("%d\n", ans);
}
return 0;
}