Gcd Ⅱ（欧拉函数应用）

2818: Gcd

Time Limit: 10 Sec  Memory Limit: 256 MB
Submit: 9702  Solved: 4314
[Submit][Status][Discuss]

Description

给定整数N，求1<=x,y<=N且Gcd(x,y)为素数的
数对(x,y)有多少对.

 

Input

一个整数N

Output

如题

Sample Input

4
 

Sample Output

4

HINT

 

hint

对于样例(2,2),(2,4),(3,3),(4,2)

 

1<=N<=10^7

 

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<queue>
const int xmax=1e7+7;
typedef long long ll;
using namespace std;
int prime[1000007];
int cot;
bool vis[xmax];
int oula[xmax];
int n;
ll sum[xmax];
void primeall()
{
    prime[1]=1;
    oula[1]=1;
    memset(vis,true,sizeof(vis));
    vis[1]=false;
    for(int i=2;i<=n;i++){
        if(vis[i]){prime[++cot]=i;oula[i]=i-1;}
        for(int j=1;j<=cot&&i*prime[j]<=n;j++){
                vis[i*prime[j]]=false;
            if(i%prime[j]==0){oula[i*prime[j]]=oula[i]*prime[j];break;}
                oula[i*prime[j]]=oula[i]*(prime[j]-1);
        }
    }
}
int main()
{
    scanf("%d",&n);
    primeall();
    ll ans=0;
    for(int i=1;i<=n;i++)
        sum[i]=sum[i-1]+oula[i];
    for(int i=1;i<=cot;i++)
        ans+=(sum[n/prime[i]]*2-1);
    printf("%lld",ans);
    return 0;

}