結果
問題 | No.2074 Product is Square ? |
ユーザー | tenten |
提出日時 | 2022-09-20 12:42:00 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 617 ms / 2,000 ms |
コード長 | 2,218 bytes |
コンパイル時間 | 2,160 ms |
コンパイル使用メモリ | 74,768 KB |
実行使用メモリ | 53,132 KB |
最終ジャッジ日時 | 2023-08-23 19:34:30 |
合計ジャッジ時間 | 11,612 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
49,316 KB |
testcase_01 | AC | 83 ms
52,100 KB |
testcase_02 | AC | 97 ms
52,608 KB |
testcase_03 | AC | 96 ms
52,104 KB |
testcase_04 | AC | 99 ms
52,424 KB |
testcase_05 | AC | 100 ms
52,536 KB |
testcase_06 | AC | 100 ms
50,664 KB |
testcase_07 | AC | 98 ms
52,436 KB |
testcase_08 | AC | 98 ms
52,340 KB |
testcase_09 | AC | 98 ms
52,164 KB |
testcase_10 | AC | 99 ms
52,548 KB |
testcase_11 | AC | 174 ms
52,876 KB |
testcase_12 | AC | 264 ms
52,252 KB |
testcase_13 | AC | 616 ms
52,456 KB |
testcase_14 | AC | 267 ms
52,416 KB |
testcase_15 | AC | 171 ms
53,132 KB |
testcase_16 | AC | 270 ms
52,480 KB |
testcase_17 | AC | 617 ms
52,440 KB |
testcase_18 | AC | 263 ms
52,672 KB |
testcase_19 | AC | 171 ms
52,800 KB |
testcase_20 | AC | 269 ms
52,780 KB |
testcase_21 | AC | 614 ms
52,440 KB |
testcase_22 | AC | 265 ms
52,308 KB |
testcase_23 | AC | 172 ms
52,732 KB |
testcase_24 | AC | 267 ms
52,844 KB |
testcase_25 | AC | 613 ms
52,380 KB |
testcase_26 | AC | 264 ms
52,400 KB |
testcase_27 | AC | 173 ms
52,764 KB |
testcase_28 | AC | 269 ms
52,488 KB |
testcase_29 | AC | 617 ms
52,256 KB |
testcase_30 | AC | 266 ms
52,636 KB |
testcase_31 | AC | 52 ms
49,456 KB |
testcase_32 | AC | 46 ms
47,756 KB |
testcase_33 | AC | 73 ms
50,500 KB |
ソースコード
import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int t = sc.nextInt(); StringBuilder sb = new StringBuilder(); while (t-- > 0) { int n = sc.nextInt(); long[] values = new long[n]; for (int i = 0; i < n; i++) { values[i] = sc.nextLong(); for (int j = 0; j < i; j++) { long gcd = getGCD(values[i], values[j]); values[i] /= gcd; values[j] /= gcd; } } boolean squares = true; for (int i = 0; i < n && squares; i++) { squares = isSquare(values[i]); } if (squares) { sb.append("Yes\n"); } else { sb.append("No\n"); } } System.out.print(sb); } static long getGCD(long x, long y) { if (y == 0) { return x; } else { return getGCD(y, x % y); } } static boolean isSquare(long x) { long left = 1; long right = Integer.MAX_VALUE; while (right - left > 1) { long m = (left + right) / 2; if (m * m <= x) { left = m; } else { right = m; } } return left * left == x; } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }