113. Nearly prime numbers

最新推荐文章于 2024-12-09 22:45:13 发布

原创最新推荐文章于 2024-12-09 22:45:13 发布 · 851 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#分解素因子 #数论

SGU 专栏收录该内容

21 篇文章

订阅专栏

本文介绍了一种算法，用于判断一个整数是否为近似质数，即该数是否能表示为两个质数的乘积。输入为一系列正整数，输出针对每个数判断其是否为近似质数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

113. Nearly prime numbers

time limit per test: 0.25 sec.
memory limit per test: 4096 KB

Nearly prime number is an integer positive number for which it is possible to find such primesP₁ and P₂ that given number is equal to P₁*P₂. There is given a sequence on N integer positive numbers, you are to write a program that prints “Yes” if given number is nearly prime and “No” otherwise.

Input

Input file consists of N+1 numbers. First is positive integerN (1£N£10). NextN numbers followed by N. Each number is not greater than 10⁹. All numbers separated by whitespace(s).

Output

Write a line in output file for each number of given sequence. Write “Yes” in it if given number is nearly prime and “No” in other case.

Sample Input