2818: Gcd

 https://www.lydsy.com/JudgeOnline/problem.php?id=2818

gcd(x,y)==prime（1<=x,y<=n）,   令a=x/prime,b=y/prime,等价于gcd(a,b)==1（1<=a,b<=n/prime）;枚举每种素数，要减去gcd（1，1）==1

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int N=1e7+9;
const int M=4e5+9;

bool check[N+10];
int phi[N+10];
int prime[N+10];
ll sum[N+10];
int tot;
void getphi(int n){
    mem(check,0);
    phi[1]=1;
    tot=0;
    for(int i=2;i<=n;i++){
        if(!check[i]){
            prime[tot++]=i;
            phi[i]=i-1;
        }
        for(int j=0;j<tot;j++){
            if(i*prime[j]>n) break;
            check[i*prime[j]]=1;
            if(i%prime[j]==0) {
                phi[i*prime[j]]=phi[i]*prime[j];
                break;
            }
            else {
                phi[i*prime[j]]=phi[i]*(prime[j]-1);
            }
        }
    }
}
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n;
    while(~sfl(n)){
        getphi(n);
        ll ans=0;
        for(int i=1;i<=n;i++) sum[i]=sum[i-1]+phi[i];
        for(int i=0;i<tot;i++) ans+=sum[n/prime[i]]*2-1;
        printf("%lld\n",ans);
    }


    return 0;
}