結果
問題 | No.1250 汝は倍数なりや? |
ユーザー | shojin_pro |
提出日時 | 2020-10-09 23:41:52 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 269 ms / 1,000 ms |
コード長 | 3,031 bytes |
コンパイル時間 | 1,904 ms |
コンパイル使用メモリ | 74,720 KB |
実行使用メモリ | 61,120 KB |
最終ジャッジ日時 | 2023-09-27 20:02:23 |
合計ジャッジ時間 | 8,504 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
49,688 KB |
testcase_01 | AC | 37 ms
47,392 KB |
testcase_02 | AC | 37 ms
49,428 KB |
testcase_03 | AC | 39 ms
49,724 KB |
testcase_04 | AC | 38 ms
49,436 KB |
testcase_05 | AC | 38 ms
49,416 KB |
testcase_06 | AC | 38 ms
49,536 KB |
testcase_07 | AC | 38 ms
49,492 KB |
testcase_08 | AC | 37 ms
49,612 KB |
testcase_09 | AC | 38 ms
49,464 KB |
testcase_10 | AC | 38 ms
49,396 KB |
testcase_11 | AC | 37 ms
49,860 KB |
testcase_12 | AC | 37 ms
49,420 KB |
testcase_13 | AC | 38 ms
49,480 KB |
testcase_14 | AC | 39 ms
49,840 KB |
testcase_15 | AC | 39 ms
49,484 KB |
testcase_16 | AC | 39 ms
49,384 KB |
testcase_17 | AC | 38 ms
49,512 KB |
testcase_18 | AC | 38 ms
49,852 KB |
testcase_19 | AC | 37 ms
49,376 KB |
testcase_20 | AC | 38 ms
49,384 KB |
testcase_21 | AC | 38 ms
49,424 KB |
testcase_22 | AC | 38 ms
49,392 KB |
testcase_23 | AC | 45 ms
49,460 KB |
testcase_24 | AC | 45 ms
49,404 KB |
testcase_25 | AC | 48 ms
51,456 KB |
testcase_26 | AC | 43 ms
49,360 KB |
testcase_27 | AC | 46 ms
49,540 KB |
testcase_28 | AC | 43 ms
49,436 KB |
testcase_29 | AC | 43 ms
47,860 KB |
testcase_30 | AC | 46 ms
49,580 KB |
testcase_31 | AC | 44 ms
49,404 KB |
testcase_32 | AC | 48 ms
50,520 KB |
testcase_33 | AC | 269 ms
60,352 KB |
testcase_34 | AC | 196 ms
55,884 KB |
testcase_35 | AC | 231 ms
58,836 KB |
testcase_36 | AC | 269 ms
61,120 KB |
testcase_37 | AC | 231 ms
56,020 KB |
testcase_38 | AC | 249 ms
57,692 KB |
testcase_39 | AC | 193 ms
55,532 KB |
testcase_40 | AC | 189 ms
55,296 KB |
testcase_41 | AC | 248 ms
57,752 KB |
testcase_42 | AC | 203 ms
55,856 KB |
testcase_43 | AC | 267 ms
58,080 KB |
testcase_44 | AC | 198 ms
55,976 KB |
testcase_45 | AC | 237 ms
60,216 KB |
testcase_46 | AC | 191 ms
55,748 KB |
testcase_47 | AC | 196 ms
57,476 KB |
testcase_48 | AC | 39 ms
49,680 KB |
testcase_49 | AC | 37 ms
49,392 KB |
testcase_50 | AC | 38 ms
49,476 KB |
testcase_51 | AC | 38 ms
49,400 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(System.in); PrintWriter pw = new PrintWriter(System.out); StringBuilder sb = new StringBuilder(); int n = sc.nextInt(); long h = sc.nextLong(); for(int i = 0; i < n; i++){ long now = Math.abs(sc.nextLong()); if(now == 0){ h = 1L; break; } long gcd = gcd(h,now); h /= gcd; } pw.println(h == 1 ? "YES" : "NO"); pw.flush(); } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } private static long gcd(long a, long b){ while (b > 0) { long temp = b; b = a % b; // % is remainder a = temp; } return a; } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }