Diff-prime Pairs

链接：https://www.nowcoder.com/acm/contest/141/H

题目描述

Eddy has solved lots of problem involving calculating the number of coprime pairs within some range. This problem can be solved with inclusion-exclusion method. Eddy has implemented it lots of times. Someday, when he encounters another coprime pairs problem, he comes up with diff-prime pairs problem. diff-prime pairs problem is that given N, you need to find the number of pairs (i, j), where and are both prime and i ,j ≤ N. gcd(i, j) is the greatest common divisor of i and j. Prime is an integer greater than 1 and has only 2 positive divisors.

Eddy tried to solve it with inclusion-exclusion method but failed. Please help Eddy to solve this problem.

Note that pair (i1, j1) and pair (i2, j2) are considered different if i1 ≠ i2 or j1 ≠ j2.

输入描述:

Input has only one line containing a positive integer N.

1 ≤ N ≤ 107

输出描述:

Output one line containing a non-negative integer indicating the number of diff-prime pairs (i,j) where i, j ≤ N

示例1

输入

复制

3

输出

复制

2

示例2

输入

复制

5

输出

复制

6

题意：

找两个满足条件的数对，这两个数除以他们的最大公约数后都为质数，问有多少种组合

分析：

筛素数+for循环查找i之前的素数的个数

代码：

#include<iostream>
#include<string.h>
 
using namespace std;
 
typedef long long ll;
bool aa[10000010];
int  nn[10000010];
int i,j;
int main(){
   int n;
 
    scanf("%d",&n);
    ll ans=0;
    memset(aa,1,sizeof(aa));
    aa[1]=0;
    for( i=2;i<=n;i++){
      if(aa[i]){
          for(j=2;j*i<=n;j++){
            aa[j*i]=0;
          }
      }
    }
    for(i=2;i<=n;i++){
        if(aa[i]){
            ans++;
            nn[i]=ans;
        }
    }
 
    ans=ans*(ans-1);
    for(i=n;i>=3;i--){
        if(aa[i]){
            int m=n/i;
                m--;nn[i]--;
                ans+=2*m*nn[i];
        }
    }
    printf("%lld\n",ans);
}