牛客——Diff-prime Pairs（数论，组合数学）

Diff-prime Pairs

---

题目描述

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 $\frac{i}{gcd(i,j)}$and$\frac{j}{gcd(i,j)}$are both prime and $i,j\le 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 ($i_1,j_1$) and pair ($i_2,j_2$) are considered different if $i_1\ne i_2$ or $j_1\ne j_2$.

输入描述:

Input has only one line containing a positive integer $N$.
$1\le N\le 10^7$

输出描述:

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

输入

3

输出

2

输入

5

输出

6

解决思路：

提示：$1\le i\le N$，$1\le j\le N$，区间素数个数通过前缀和预处理。
已知：需要求解的是数对$(i,j)$的个数，此数对满足$\frac{i}{gcd(i,j)}$与$\frac{j}{gcd(i,j)}$都为素数，显然$i$不等于$j$。
注意：$(2,3)$和$(3,2)$为不同的数对。
求解：如果直接枚举数对，是$n^2$的复杂度，$1e7$的数据肯定是过不去的，所以考虑优化这一过程。
令$g=gcd(i,j)$，$x=\frac{i}{g}$，$y=\frac{j}{g}$。
枚举$g$，可以得到$1\le g\le N$，$1\le x\le \frac{N}{g}$，$1\le y\le \frac{N}{g}$。
可以发现，数对$(x,y)$满足$x$与$y$都是素数且$x$不等于$y$。
数对$(x,y)$的个数为$[1,\frac{N}{g}]$的素数个数乘以$[1,\frac{N}{g}]$的素数个数减一。
这种计算方法其实是组合数学的乘法原理，$x$的选择是$[1,\frac{N}{g}]$的素数，为了保证$y$不等于$x$，所以$y$的选择要比$x$的选择少一种，故为$[1,\frac{N}{g}]$的素数个数减一。

代码

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

typedef long long ll;
const int N = 1e7 + 10;

ll pre[N];
bool vis[N];
int prime[N], cnt;

void init(const int n) {
	for (int i = 2; i <= n; i++) {
		if (!vis[i]) {
			pre[i] = 1;
			prime[++cnt] = i;
		}
		for (int j = 1; j <= cnt && i <= n / prime[j]; j++) {
			vis[i * prime[j]] = true;
			if (i % prime[j] == 0) break;
		}
	}
}

int main() {

	int n; cin >> n;

	init(n);

	for (int i = 1; i <= n; i++) pre[i] += pre[i - 1];

	ll ans = 0;
	for (int g = 1; g <= n; g++) {
		ans += pre[n / g] * (pre[n / g] - 1);
	}

	cout << ans << endl;
	return 0;
}