bzoj 2818 欧拉函数

思路：就是对于某个数q，跟他互质的数p，kp和kq的最大公约数是k，那么这个数能组成的答案的数量就是phi[i]乘以某个质数，且乘积小于n

基于这种思路写下这个代码

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define IMAX 2147483646
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int

using namespace std;


const int maxn = 1e7 + 10;

int n;
int phi[maxn], v[maxn], pre[maxn],m;

void euler(int n) {
	for (int i = 1; i <= n; i++)phi[i] = i;
	for (int i = 2; i <= n; i++) 
		if (phi[i] == i) 
			for (int j = i; j <= n; j += i) 
				phi[j] = phi[j] / i * (i - 1);							
}

void prime(int n) {
	m = 0;
	for (int i = 2; i <= n; i++) {
		if (v[i] == 0)v[i] = i, pre[++m] = i;
		for (int j = 1; j <= m; j++) {
			if (pre[j] > v[i] || pre[j] > n / i)break;
			v[i*pre[j]] = pre[j];
		}
	}
}

int main() {
	scanf("%d", &n);
	prime(n);
	euler(n);
	ll ans = m;//质数自己和自己的gcd等于质数
	for (int i = 2; i <= n; i++) 
		for (int j = 1; pre[j] * i <= n && j <= m; j++)
			ans += phi[i] * 2;//题目上说两两组合可以互换，所以要乘2
	
	printf("%d\n", ans);

	return 0;
}

但是这样复杂度是O(lgn*n)，超时，

使用基于线性方法去求欧拉函数，进一步可以写出这样的代码。

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define IMAX 2147483646
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int

using namespace std;

const int maxn = 1e7 + 10;
ll phi[maxn];
int v[maxn], pre[maxn], m;
int n;

int main() {
	scanf("%d", &n);
	phi[1] = 1;
	for (int i = 2; i <= n; i++) {
		if (!v[i]) {
			v[i] = i;
			pre[++m] = i;
			phi[i] = i - 1;
		}
		for (int j = 1; j <= m; j++) {
			if (pre[j] > v[i] || pre[j] * i > n) break;
			v[pre[j] * i] = pre[j];
			phi[pre[j] * i] = phi[i] * (i % pre[j] ? pre[j] - 1 : pre[j]);
		}
		phi[i] += phi[i - 1];//phi表示前i个欧拉函数的和
	}
	ll ans = 0;
	for (int i = 1; i <= m; i++) 
		ans += phi[n / pre[i]];
	printf("%lld\n", ans * 2 - m);

	return 0;
}