题解:http://blog.csdn.net/u014610830/article/details/49493279
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;
inline char nc()
{
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(ll &x)
{
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
const int maxn=100000,P=1000000007,Inv=500000004;
int prime[maxn+1],vst[maxn+5],tot;
inline void Init(){
for (int i=2;i<=maxn;i++)
{
if (!vst[i]) prime[++tot]=i;
for (int j=1;(ll)prime[j]*i<=maxn && j<=tot;j++)
{
vst[i*prime[j]]=1;
if (i%prime[j]==0) break;
}
}
}
ll a,b;
int d[1005],cnt;
int pri[25],q[25],len;
void dfs(int t,int cur){
if(t==len+1) { d[++cnt]=cur; return; }
dfs(t+1,cur);
for (int i=1;i<=q[t];i++)
dfs(t+1,cur*=pri[t]);
}
inline void Mac(){
int tem=b; len=0;
for (int i=1;i<=tot && (ll)prime[i]*prime[i]<=tem;i++)
if (tem%prime[i]==0)
{
pri[++len]=prime[i]; q[len]=0;
while (tem%prime[i]==0) tem/=prime[i],q[len]++;
}
if (tem!=1) pri[++len]=tem,q[len]=1;
cnt=0;
dfs(1,1);
}
inline void Solve(){
read(a); read(b);
Mac();
ll ans=0;
for (int i=1;i<=cnt;i++){
ll tem=((((a+d[i]-1)/d[i]+b/d[i])%P)*((b/d[i]-(a+d[i]-1)/d[i]+1+P)%P)%P)*Inv%P;
ll ret=1;
for (int j=1;j<=len;j++)
if (d[i]%pri[j]==0)
(ret*=(1-pri[j]+P))%=P;
(ans+=ret*tem%P)%=P;
}
(ans*=b)%=P;
printf("%lld\n",ans);
}
int main()
{
ll Q;
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
Init();
read(Q);
while (Q--)
Solve();
return 0;
}