博客内容介绍了Codeforces中的一道题目B. T-primes，要求判断一个正整数是否为T-prime，即该数是否有且仅有三个不同的正因子。文章提到了两种解题思路，一种是素因子分解，但由于可能的超时问题而未采用；另一种是利用T-prime特性，即该数为1、本身和一个素数的平方的乘积。解决方案是预处理素数表，然后检查每个数是否符合这个条件。
B. T-primes
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
We know that prime numbers are positive integers that have exactly two distinct positive divisors. Similarly, we’ll call a positive integer t Т-prime, if t has exactly three distinct positive divisors.
You are given an array of n positive integers. For each of them determine whether it is Т-prime or not.
Input
The first line contains a single positive integer, n (1 ≤ n ≤ 105), showing how many numbers are in the array. The next line contains n space-separated integers xi (1 ≤ xi ≤ 1012).
Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is advised to use the cin, cout streams or the %I64d specifier.
Output
Print n lines: the i-th line should contain “YES” (without the quotes), if number xi is Т-prime, and “NO” (without the quotes), if it isn’t.
Ex
最低0.47元/天 解锁文章
867
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
