bzoj2693 jzptab

2693: jzptab

Time Limit: 10 Sec  Memory Limit: 512 MB
Submit: 954  Solved: 366
[ Submit][ Status][ Discuss]

Description

Input

一个正整数T表示数据组数

接下来T行 每行两个正整数 表示N、M

Output

T行 每行一个整数 表示第i组数据的结果

Sample Input

1

4 5

Sample Output

122

HINT
T <= 10000

N, M<=10000000

#include<iostream>
#include<cstdlib>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define F(i,j,n) for(int i=j;i<=n;i++)
#define D(i,j,n) for(int i=j;i>=n;i--)
#define ll long long
#define maxn 10000000
#define mod 100000009
using namespace std;
int t,n,m,ans,tot,pri[maxn+5];
ll f[maxn+5],sum[maxn+5];
bool mark[maxn+5];
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
	while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
inline void pre()
{
	f[1]=1;
	F(i,2,maxn)
	{
		if (!mark[i]) pri[++tot]=i,f[i]=1-i;
		for(int j=1;j<=tot&&i*pri[j]<=maxn;j++)
		{
			mark[i*pri[j]]=true;
			if (i%pri[j]==0){f[i*pri[j]]=f[i];break;}
			else f[i*pri[j]]=f[i]*f[pri[j]]%mod;
		}
	}
	F(i,1,maxn) sum[i]=(sum[i-1]+f[i]*i%mod)%mod;
}
inline ll calc(ll x,ll y)
{
	return (x*(x+1)/2%mod)*(y*(y+1)/2%mod)%mod;
}
int main()
{
	pre();
	t=read();
	while (t--)
	{
		n=read();m=read();
		if (n>m) swap(n,m);
		ans=0;
		for(int i=1,pos;i<=n;i=pos+1)
		{
			pos=min(n/(n/i),m/(m/i));
			ans=(ans+(sum[pos]-sum[i-1])*calc(n/i,m/i)%mod)%mod;
		}
		printf("%d\n",(ans+mod)%mod);
	}
	return 0;
}