結果
問題 | No.2074 Product is Square ? |
ユーザー | tenten |
提出日時 | 2023-04-13 17:01:02 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 717 ms / 2,000 ms |
コード長 | 2,729 bytes |
コンパイル時間 | 3,105 ms |
コンパイル使用メモリ | 95,140 KB |
実行使用メモリ | 44,652 KB |
最終ジャッジ日時 | 2024-04-17 20:16:28 |
合計ジャッジ時間 | 13,187 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
37,292 KB |
testcase_01 | AC | 105 ms
39,052 KB |
testcase_02 | AC | 105 ms
39,116 KB |
testcase_03 | AC | 95 ms
39,036 KB |
testcase_04 | AC | 104 ms
38,880 KB |
testcase_05 | AC | 109 ms
38,700 KB |
testcase_06 | AC | 105 ms
38,840 KB |
testcase_07 | AC | 105 ms
38,832 KB |
testcase_08 | AC | 107 ms
39,076 KB |
testcase_09 | AC | 106 ms
39,012 KB |
testcase_10 | AC | 108 ms
39,088 KB |
testcase_11 | AC | 260 ms
44,304 KB |
testcase_12 | AC | 343 ms
44,612 KB |
testcase_13 | AC | 717 ms
44,284 KB |
testcase_14 | AC | 354 ms
44,652 KB |
testcase_15 | AC | 257 ms
44,532 KB |
testcase_16 | AC | 353 ms
44,596 KB |
testcase_17 | AC | 711 ms
44,316 KB |
testcase_18 | AC | 334 ms
44,624 KB |
testcase_19 | AC | 241 ms
44,568 KB |
testcase_20 | AC | 312 ms
44,556 KB |
testcase_21 | AC | 711 ms
44,228 KB |
testcase_22 | AC | 328 ms
44,476 KB |
testcase_23 | AC | 246 ms
44,284 KB |
testcase_24 | AC | 342 ms
44,292 KB |
testcase_25 | AC | 556 ms
44,276 KB |
testcase_26 | AC | 299 ms
44,488 KB |
testcase_27 | AC | 254 ms
44,280 KB |
testcase_28 | AC | 356 ms
44,576 KB |
testcase_29 | AC | 500 ms
44,496 KB |
testcase_30 | AC | 305 ms
44,372 KB |
testcase_31 | AC | 58 ms
37,000 KB |
testcase_32 | AC | 53 ms
37,036 KB |
testcase_33 | AC | 93 ms
38,464 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; 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(); } boolean enable = true; for (int i = 0; i < n && enable; i++) { for (int j = i + 1; j < n; j++) { long gcd = getGCD(values[i], values[j]); values[i] /= gcd; values[j] /= gcd; } enable = isSquare(values[i]); } if (enable) { 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 = 0; long right = Integer.MAX_VALUE / 2; while (right - left > 1) { long m = (left + right) / 2; if (m * m <= x) { left = m; } else { right = m; } } return left * left == x; } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } 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 int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }