shunfurh
编程介的小学生
采纳率92.7%
2019-03-22 21:59 阅读 276

正方形的矩阵的一个算法的问题思路,用C语言的方式去计算怎么做

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
2
30
75

Sample Output
Case 1: Yes
Case 2: No

  • 点赞
  • 写回答
  • 关注问题
  • 收藏
  • 复制链接分享

相关推荐