|
||||||||||
Squarefree numberTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5779 Accepted Submission(s): 1568 Problem Description In mathematics, a squarefree number is one which is divisible by no perfect squares, except 1. For example, 10 is square-free but 18 is not, as it is divisible by 9 = 3^2. Now you need to determine whether an integer is squarefree or not. Input The first line contains an integer T indicating the number of test cases. For each test case, there is a single line contains an integer N. Technical Specification 1. 1 <= T <= 20 2. 2 <= N <= 10^18 Output For each test case, output the case number first. Then output "Yes" if N is squarefree, "No" otherwise. Sample Input
Sample Output
Author hanshuai Source | ||||||||||
|