G. Short Task（埃氏筛和线筛的灵活应用）

本文链接：https://blog.csdn.net/QQ2530063577/article/details/120407128

题意

定义：d(x) 为 x 的所有因子和。eg ： d(6) = 1 + 2 + 3 + 6 = 12。
有多次询问，每次查询给出一个数 c，输出满足 d(x) = c 的最小 x，如果不存在输出 -1。

码1

线性筛法 $O (n)$

若 $g c d (a, b) = 1$ , $\times d(b)$
若 $gcd(a, b) = q_1, q_1 > 1$ ,
$q_1 + q_1^2 + \cdots + q_1^{c_1}) \times (1 + q_2 + q_2^2 + \cdots + q_2^{c_2}) \times (1 + q_m + q_m^2 + \cdots + q_m^{c_m})$
$q_1 + q_1^2 + \cdots + q_1^{c_1} + q_1^{c_1 + 1}) \times (1 + q_2 + q_2^2 + \cdots + q_2^{c_2}) \times (1 + q_m + q_m^2 + \cdots + q_m^{c_m})$
按照线性筛的思路，每个数只会被自身最小的质因数筛一遍的思路去编写即可。但需要设置一个辅助数（mul）组来存最小的质因数的等比和，也即上面推导的一个括号里的内容。可以发现
1. a为质数，mul(a) = a + 1
2. $mul(b) = mul(a) * q_1 + 1$
综上： $d(b)=\begin{cases} b + 1& \text{b是素数}\\{d}(a) / mul(a) \times mul((b)& \text{b是合数, gcd(a, b) > 1} \end{cases}$

#include<cstdio>
#include<queue>
#include<set>
#include<cstdlib>
#include<string.h>
#include<string>
#include<iostream>
#include<cmath>
#include<unordered_map>
#include<map>
#include<algorithm>
#define endl "\n"
#define IOS ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define ft first
#define sd second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ll long long int
#define ull unsigned long long int
#define mt(a,b) memset(a, b, sizeof a)
//#define int long long
const double PI = acos(-1.0);
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
using namespace std;
const int N = 1e5 + 7, M = 1e7 + 2;

int d[M], mul[M], mp[M];//mp为答案数组
int v[M], p[M], m;//p素数，v记录最小质因子
void init()//线性筛
{
	d[1] = 1;
	m = 0;
	for (int i = 2; i < M; i++)
	{
		if (v[i] == 0)//i为质数
		{
			v[i] = i;
			p[++m] = i;
			mul[i] = i + 1;
			d[i] = i + 1;
		}
		for (int j = 1; j <= m; j++)
		{
			if (p[j] > v[i] || p[j] > M / i) break;
			v[i * p[j]] = p[j];
			if (i % p[j] == 0)//若i为合数，或者i = p[j]时
			{
				mul[i * p[j]] = mul[i] * p[j] + 1;
				d[i * p[j]] = d[i] / mul[i] * mul[i * p[j]];
			}
			else
			{
				mul[i * p[j]] = p[j] + 1;//最小的质因数为p[j]
				d[i * p[j]] = d[i] * d[p[j]];
			}
		}
	}
}

int main()
{
	IOS;

	init();
	for (int i = 1; i < M; i++)
	{
		if (d[i] < M && mp[d[i]] == 0) mp[d[i]] = i;
		//cout<< i << "--" << d[i] << endl;
	}

	int T; cin >> T;
	while (T--)
	{
		int c; cin >> c;
		if (mp[c]) cout << mp[c] << endl;
		else cout << -1 << endl;
	}


	return 0;
}

码2

埃氏筛法 $O (n l o g n)$
明显码2代码短小，这可能就是所谓的“牺牲空间换取时间”吧

#include<bits/stdc++.h>
#include<cstdio>
#include<queue>
#include<set>
#include<cstdlib>
#include<string.h>
#include<string>
#include<iostream>
#include<cmath>
#include<map>
#include<algorithm>
#define endl "\n"
#define IOS ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define ft first
#define sd second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ll long long int
#define ull unsigned long long int
#define mt(a,b) memset(a, b, sizeof a)
//#define int long long
const double PI = acos(-1.0);
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
using namespace std;
const int N = 2e5 + 7, M = 1e7 + 10;
int d[M], mp[M];

int main()
{
	IOS;

	for (int i = 1; i <= M - 5; i++)
		for (int j = i; j <= M - 5; j += i)
			d[j] += i;
	for (int i = 1; i <= M - 5; i++)
		if (d[i] < M && mp[d[i]] == 0) mp[d[i]] = i;

	int T; cin >> T;
	while (T--)
	{
		ll c; cin >> c;
		if (!mp[c]) cout << -1 << endl;
		else cout << mp[c] << endl;
	}


	return 0;
}