hdu 6623 Minimal Power of Prime【2019 Multi-University Training Contest 4】【质因子分解】

Minimal Power of Prime

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1528    Accepted Submission(s): 331
 

Problem Description

You are given a positive integer n > 1. Consider all the different prime divisors of n. Each of them is included in the expansion n into prime factors in some degree. Required to find among the indicators of these powers is minimal.

Input

The first line of the input file is given a positive integer T ≤ 50000, number of positive integers n in the file. In the next T line sets these numbers themselves. It is guaranteed that each of them does not exceed 10^18.

Output

For each positive integer n from an input file output in a separate line a minimum degree of occurrence of a prime in the decomposition of n into simple factors.

Sample Input

5 2 12 108 36 65536

Sample Output

1 1 2 2 16

题目链接：

http://acm.hdu.edu.cn/showproblem.php?pid=6623

题意：

给你一个整数N，计算N的质因子，输出最少出现的质因子个数。

题解：

预先打表枚举出10000以内的质数，一共有1229个，然后把 n 去分解质因数，如果 n 分解完不为1，则因子最多也就4个，所以幂数大于1的情况有四种：

1.p1^4

2.p1^3

3.p1^2

4.p1^2*p2^2,

对于其他情况肯定有幂为1的。

代码：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 10000;
int prime[maxn+1];
void getprime() {
	memset(prime, 0, sizeof(prime));
	for(int i = 2; i <= maxn; i++) {
		if(!prime[i]) prime[++prime[0]] = i;
		for(int j = 1; j <= prime[0] && prime[j] <= maxn/i; j++) {
			prime[prime[j]*i] = 1;
			if(i % prime[j] == 0) break;
		}
	}
}
int main() {
	getprime();
	int t;
	int ans = 0;
	ll n;
	scanf("%d", &t);
	while(t--) {
		int minn = 1000;
		scanf("%lld", &n);
		ll k = n;
		for(int i = 1; i <= prime[0]; i++) {
			if(n % prime[i] == 0) {
				ans = 0;
				while(n % prime[i] == 0) {
					ans++;
					n /= prime[i];
				}
				minn = min(minn, ans);
			}
			if(n == 1) {
				break;
			}
		}
		if(n > 1) {
			long double x = (long double)n;
			ll qwq4 = powl(x, 0.25) + 0.5;
			if(qwq4 * qwq4 * qwq4 * qwq4 == n) {
				minn = min(minn, 4);
				n = 1;
			} else {
				ll qwq2 = powl(x, 0.5) + 0.5;
				if(qwq2 * qwq2 == n) {
					minn = min(minn, 2);
					n = 1;
				}
			}
			ll qwq3 = powl(x, 1.0/3) + 0.5;
			if(qwq3 * qwq3 * qwq3 == n) {
				minn = min(minn, 3);
				n = 1;
			}
		}
		if(minn == 1000 || n != 1) {
			minn = 1;
		}
		printf("%d\n", minn);
	}
}