蓝桥杯2022A组数的拆分题记

先上题干

[蓝桥杯 2022 省 A] 数的拆分

题目描述

给定 $T$ 个正整数 $a_i$，分别问每个 $a_i$ 能否表示为 $x_1^{y_1}\cdot x_2^{y_2}$ 的形式，其中 $x_1,x_2$ 为正整数，$y_1,y_2$ 为大于等于 $2$ 的正整数。

输入格式

输入第一行包含一个整数 $T$ 表示询问次数。
接下来 $T$ 行，每行包含一个正整数 $a_i$ 。

输出格式

对于每次询问，如果 $a_i$ 能够表示为题目描述的形式则输出 yes，否则输出 no。

样例 #1

样例输入 #1

7
2
6
12
4
8
24
72

样例输出 #1

no
no
no
yes
yes
no
yes

提示

【样例说明】
第 $4,5,7$ 个数分别可以表示为:
$$\begin{array}{rl}& a_4=2^2\times 1^2;\\ & a_5=2^3\times 1^2;\\ & a_7=2^3\times 3^2。\end{array}$$
【评测用例规模与约定】
对于 $10\%$ 的评测用例，$1\le T\le 200,a_i\le 10^9$;
对于 $30\%$ 的评测用例，$1\le T\le 300,a_i\le 10^{18}$;
对于 $60\%$ 的评测用例，$1\le T\le 10000,a_i\le 10^{18}$;
对于所有评测用例，$1\le T\le 100000,1\le a_i\le 10^{18}$ 。

分析的思路：

首先我们看数据范围（一般习惯用数据范围来推应该用什么样的算法），$T\le 100000$；这一块没有办法进行缩减，所以我们要对后面那个巨大的数来进行下手。由于题干$y_1,y_2$ 为大于等于 $2$ 的正整数。所以一定有$max(x_1^{y_1},x_2^{y_2})\le \sqrt[4]{10^{18}}$.通过这个关系我们可以枚举$1-\sqrt[4]{10^{18}}$之间的质数，来判断数是否能被拆分，这样我们便可以完成60的样例点（大概）此时我们要将许多的被拆分出来的质数们进行处理，不难发现会出现例如（$2^2、5^3、7^7$）之类的数我们要尽可能让这些数分配给两个数，想了一圈只能通过奇偶处理，我们发现：任何指数大于二的奇数都可以分成$x_1^{y_1}=x_1^3\cdot {(x_1^{(y_1-3)/2})}^2$,而质数大于等于二的偶数都可以直接与上面的相乘，要注意的是如果只有指数为一的不能进行拆分，更不能满足y大于2的条件，故但凡有质数只有一次这个数就不能被正确拆分。回归正题，当我们明确拆分之法之后再回过头来看看，一个能正常拆分的数必定会有$x_1^2\cdot x_2^3$的拆分形式（x可以为一）进而可以只要搜索（$1-\sqrt[5]{10^{18}}$）之内的质数就好啦$\sqrt[5]{10^{18}}$大概是4000左右，然后就特判当其中x等于一的情概况就好啦。

上代码！！！

首先我喜欢将质数打表进行运算

打表代码

#include<iostream>
using namespace std;
bool num[5010];
int main(){//欧拉筛法
	for(int i=3;i<=5000;i+=2){
		if(!num[i]){
			int a=i+i;
			while(a<=5000)num[a]=true;
			cout<<i<<",";
		}
	}
	return 0;
}

这样将生成出来的数字加以修改，防止爆行就可以用啦。

AC代码

#include<iostream>
#include<cmath>
#define ll long long
using namespace std;
unsigned long long n;
int num,sushu[1000]={0,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,
127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,
281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,
457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,
641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,
827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,
1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,
1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,
1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,
1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,
1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,
1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,
1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,
2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,
2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,
2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,
2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,
2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,3023,
3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,
3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,
3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,
3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,
3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,3911,3917,3919,3923,
3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,
4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,4271,4273,4283,
4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,
4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,4663,4673,
4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,
4903,4909,4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999};//质数打表 ^_^
void panduan();

int main(){
	cin>>num;
	while(num--)panduan();	
} 

void panduan(){
	cin>>n;
	for(int i=1;i<=669;i++){
		if(n%sushu[i]==0){
			if(n%(sushu[i]*sushu[i])){cout<<"no\n";return;}
			while(n%sushu[i]==0)n/=sushu[i];
		}
	}
	int a=pow(n,1.0/3);
	if(a*a*a==n||(a+1)*(a+1)*(a+1)==n||(a-1)*(a-1)*(a-1)==n){cout<<"yes\n";return;}
	a=sqrt(n);
	if(a*a==n||(a+1)*(a+1)==n||(a-1)*(a-1)==n){cout<<"yes\n";return;}
	cout<<"no\n";return;
}

写题后感

这是我第一次用MD进行编辑，也是第一次写题解题记，可能会有很多的问题，多多包涵，
在做题中进行开方特判的地方需要考虑精度问题，为此拓展了判断的范围，这个是做题中很重要的点。