2020牛客暑期多校训练营（第四场）H题

链接：https://ac.nowcoder.com/acm/contest/5669/H
来源：牛客网

#pragma warning (disable:4996)
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>
#include <list>
#define inf 0X3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 2e5 + 20;

vector<int> a, b;
vector<int> prime;
vector<int> even;
vector<int> tmp;
bool p[maxn], v[maxn];
bool vis[maxn];
int n, m;

void primes(int n)
{
 for (int i = 1; i <= n; i++)
 {
  v[i] = 0;
  p[i] = 0;
 }
 for (int i = 2; i <= n; i++)
 {
  if (v[i])
   continue;
  p[i] = 1;
  for (int j = 1; i * j <= n; j++)
  {
   if (!v[i * j])
    v[i * j] = 1;
  }
 }
}

int main()
{
 int t;
 scanf("%d", &t);
 while (t--)
 {
  scanf("%d", &n);
  a.clear(), b.clear();
  for (int i = 1; i <= n; i++)
   vis[i] = 0;
  primes(n);
  for (int i = 2; i <= n; i++)
   if (p[i])
    prime.push_back(i);
  bool flag;
  tmp.clear();
  while (prime.size())
  {
   int j = prime.back();
   for (int i = 1; i * j <= n; i += 2)
    if (!vis[i * j])
     tmp.push_back(i * j);
   if (tmp.size() % 2)
    if (j * 2 <= n)
     tmp.push_back(j * 2);
    else
     tmp.pop_back();
   flag = 0;
   while (tmp.size())
   {
    if (vis[tmp.back()])
     continue;
    vis[tmp.back()] = 1;
    if (!flag)
    {
     a.push_back(tmp.back());
     flag = 1;
    }
    else
    {
     b.push_back(tmp.back());
     flag = 0;
    }
    tmp.pop_back();
   }
   prime.pop_back();
  }
  even.clear();
  flag = 0;
  for (int i = 2; i <= n; i += 2)
   if (!vis[i])
    even.push_back(i);
  if (even.size() % 2)
   even.pop_back();
  while (even.size())
  {
   vis[even.back()] = 1;
   if (!flag)
   {
    a.push_back(even.back());
    flag = 1;
   }
   else
   {
    b.push_back(even.back());
    flag = 0;
   }
   even.pop_back();
  }
  m = a.size();
  printf("%d\n", m);
  for (int i = 0; i < m; i++)
   printf("%d %d\n", a[i], b[i]);
 }
}