bzoj3529&luogu3312 sdoi2014数表

http://www.elijahqi.win/archives/1291
给定N,M,a，求

多组询问<=20000

N,M<=10^5 a<=10^9

题解公式推导同http://www.elijahqi.win/2017/10/16/cia-3-naive/

把欧拉函数换成sigma函数而已 但是这题有一个限制 就是要求sigma<=a的时候才统计

那么不妨我们把输入都读入然后离线处理每次只做到≤a的地方 这里注意一下我们把sigma函数重新排序了 那么sigma对应的下标就不相同了，我们要找回去所以必须还要记录它在原数组中的位置

#include<cstdio>
#include<algorithm>
#define N 22000
#define N1 110000
#define inf 0x7fffffff
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0;char ch=gc();
    while (ch<'0'||ch>'9') ch=gc();
    while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();}
    return x;
}
struct node{
    int n,m,a,id;
}query[N];
struct node1{
    int x,id;
}sigma[N1];
inline bool cmp1(node1 a,node1 b){return a.x<b.x;}
inline bool cmp(node a,node b){return a.a<b.a;}
int s[N1],prime[N1],mu[N1],not_prime[N1],min_factor_a[N1],ans[N],T;
void init(){
    sigma[1].x=mu[1]=1;int top=0;sigma[1].id=1;
    for (int i=2;i<=1e5;++i){
        sigma[i].id=i;
        if (!not_prime[i]){
            mu[i]=-1;sigma[i].x=i+1;min_factor_a[i]=i;prime[++top]=i;
        }
        for (int j=1;prime[j]*i<=1e5;++j){
            not_prime[prime[j]*i]=1;
            if (i%prime[j]==0){
                mu[prime[j]*i]=0;
                if (i*prime[j]==min_factor_a[i]*prime[j]) sigma[i*prime[j]].x=sigma[i].x+prime[j]*i;else
                sigma[prime[j]*i].x=sigma[i/min_factor_a[i]].x*sigma[min_factor_a[i]*prime[j]].x;
                min_factor_a[prime[j]*i]=min_factor_a[i]*prime[j];break;
            }mu[prime[j]*i]=-mu[i];
            min_factor_a[prime[j]*i]=prime[j];
            sigma[prime[j]*i].x=(prime[j]+1)*sigma[i].x;
        }
    }
    //for (int i=1;i<=30;++i) printf("%d ",sigma[i].x);printf("\n");
}
inline void insert1(int x,int y){
    while (x<=1e5){s[x]+=y;x+=x&(-x);}
}
inline int qsum(int x){
    int tmp=0;while (x){tmp+=s[x];x-=x&(-x);} 
    return tmp;
}
int main(){
    freopen("3312.in","r",stdin);
    T=read();init();sort(sigma+1,sigma+100000+1,cmp1);
    for (int i=1;i<=T;++i){
        int n=read(),m=read(),a=read();query[i].id=i;query[i].n=n;query[i].m=m;query[i].a=a;
    }sort(query+1,query+T+1,cmp);
    for (int i=1,j=1;i<=T;++i){
        for (;j<=1e5&&sigma[j].x<=query[i].a;++j) 
            for (int k=sigma[j].id;k<=1e5;k+=sigma[j].id) insert1(k,sigma[j].x*mu[k/sigma[j].id]);

        int minn=min(query[i].n,query[i].m);int last=0,nn=query[i].n,mm=query[i].m;
        for (int j=1;j<=minn;j=last+1){
            last=min(nn/(nn/j),mm/(mm/j));
            ans[query[i].id]+=(qsum(last)-qsum(j-1))*(mm/j)*(nn/j);
        }
    }
    for (int i=1;i<=T;++i) printf("%d\n",ans[i]&inf);
    return 0;
}