寻找T-Prime：完全平方素数根
这篇博客探讨了T-Prime数的概念，即恰好有三个不同正除数的正整数。通过分析，得出T-Prime数必须是完全平方的且其平方根为素数。给出了一种判断方法，并提供了样例输入和输出，说明如何确定一个数是否为T-Prime数。
Description
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 ≤ 10000),showing how many numbers are in the array.
The next line contains n space-separated integers xi (1 ≤ xi ≤ 10^12).
Output
Print one line: The number of T-primes number
Sample Input
Copy sample input to clipboard
3
4 5 6
Sample Output
1
Hint
Please use long long instead of int for any Xi.
The given test has three numbers.
The first number 4 has exactly three divisors — 1, 2 and 4.
The second number 5 has two divisors (1 and 5),
The third number 6 has four divisors (1
最低0.47元/天 解锁文章
扫一扫
2358
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
