H-Harder Gcd Problem
题意:从1到n中,选m对数(不重复),使得每一对都不互质,求最大的m并输出一种可行的搭配
题解:先线性筛筛出1到n中的素数,从大到小遍历这些素数,比如当前遍历到素数 p i p_{i} pi,去枚举 p i p_{i} pi的没用过且小于等于n的倍数(包括 p i p_{i} pi),如果个数为偶数,就将它们一一匹配:若为奇数,就将2倍的那个数踢出,其他的一一匹配,踢出的那个数留着和后面的素数的2倍匹配,将它们标记为已用过。
其实在比赛中我无法证明这种做法的正确性(虽然现在好像也给不出严谨的证明),但也无法证伪,然后一发过了就很舒服
Code:
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ull unsigned ll
#define pii pair<int, int>
#define pdd pair<db, db>
#define pll pair<ll, ll>
#define mem(a, b) memset(a, b, sizeof(a));
#define lowbit(x) (x & -x)
#define lrt nl, mid, rt << 1
#define rrt mid + 1, nr, rt << 1 | 1
template <typename T>
inline void read(T& t) {
t = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
t = t * 10 + ch - '0';
ch = getchar();
}
t *= f;
}
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const ll Inf = 0x7f7f7f7f7f7f7f7f;
const int inf = 0x7f7f7f7f;
const db eps = 1e-5;
const db Pi = acos(-1);
const int maxn = 2e5 + 10;
int cnt;
bool is_prime[maxn];
int primes[maxn];
bool used[maxn];
pii res[maxn];
vector<int> vt;
void Primes(int n) {
memset(is_prime, true, sizeof(is_prime));
is_prime[1] = 0;
for (int i = 2; i <= n; i++) {
if (is_prime[i])
primes[++cnt] = i;
for (int j = 1; j <= cnt && i * primes[j] <= n; j++) {
is_prime[i * primes[j]] = 0;
if (i % primes[j] == 0)
break;
}
}
}
int main(void) {
Primes(2e5);
int T;
read(T);
while (T--) {
int n, ans = 0;
read(n);
mem(used, 0);
for (int i = cnt; i >= 1; i--) {
if (primes[i] > n)
continue;
vt.clear();
for (int j = 3 * primes[i]; j <= n; j += primes[i]) {
if (!used[j])
vt.push_back(j), used[j] = 1;
}
if (!used[primes[i]])
vt.push_back(primes[i]), used[primes[i]] = 1;
if (vt.size() % 2 != 0 && 2 * primes[i] <= n)
vt.push_back(2 * primes[i]), used[2 * primes[i]] = 1;
for (int j = 0; j + 1 < vt.size(); j += 2)
res[++ans] = {vt[j], vt[j + 1]};
}
printf("%d\n", ans);
for (int i = 1; i <= ans; i++)
printf("%d %d\n", res[i].first, res[i].second);
}
return 0;
}