結果
問題 | No.1250 汝は倍数なりや? |
ユーザー | hiromi_ayase |
提出日時 | 2020-10-09 21:57:37 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 248 ms / 1,000 ms |
コード長 | 2,617 bytes |
コンパイル時間 | 2,370 ms |
コンパイル使用メモリ | 80,352 KB |
実行使用メモリ | 61,816 KB |
最終ジャッジ日時 | 2023-09-27 16:48:42 |
合計ジャッジ時間 | 10,905 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 60 ms
50,848 KB |
testcase_01 | AC | 61 ms
50,948 KB |
testcase_02 | AC | 59 ms
50,812 KB |
testcase_03 | AC | 58 ms
50,976 KB |
testcase_04 | AC | 64 ms
50,844 KB |
testcase_05 | AC | 60 ms
50,996 KB |
testcase_06 | AC | 60 ms
50,664 KB |
testcase_07 | AC | 60 ms
51,132 KB |
testcase_08 | AC | 59 ms
50,760 KB |
testcase_09 | AC | 59 ms
51,256 KB |
testcase_10 | AC | 59 ms
50,756 KB |
testcase_11 | AC | 60 ms
50,828 KB |
testcase_12 | AC | 59 ms
51,112 KB |
testcase_13 | AC | 62 ms
50,888 KB |
testcase_14 | AC | 60 ms
51,476 KB |
testcase_15 | AC | 61 ms
50,916 KB |
testcase_16 | AC | 64 ms
51,360 KB |
testcase_17 | AC | 61 ms
50,928 KB |
testcase_18 | AC | 60 ms
50,856 KB |
testcase_19 | AC | 61 ms
51,064 KB |
testcase_20 | AC | 62 ms
51,140 KB |
testcase_21 | AC | 59 ms
51,028 KB |
testcase_22 | AC | 60 ms
51,116 KB |
testcase_23 | AC | 74 ms
51,560 KB |
testcase_24 | AC | 70 ms
51,464 KB |
testcase_25 | AC | 69 ms
51,836 KB |
testcase_26 | AC | 65 ms
51,172 KB |
testcase_27 | AC | 68 ms
51,396 KB |
testcase_28 | AC | 71 ms
51,616 KB |
testcase_29 | AC | 67 ms
51,136 KB |
testcase_30 | AC | 70 ms
51,500 KB |
testcase_31 | AC | 69 ms
51,396 KB |
testcase_32 | AC | 68 ms
51,400 KB |
testcase_33 | AC | 244 ms
60,796 KB |
testcase_34 | AC | 199 ms
56,640 KB |
testcase_35 | AC | 247 ms
59,276 KB |
testcase_36 | AC | 240 ms
61,320 KB |
testcase_37 | AC | 213 ms
57,068 KB |
testcase_38 | AC | 218 ms
58,748 KB |
testcase_39 | AC | 216 ms
56,476 KB |
testcase_40 | AC | 222 ms
55,208 KB |
testcase_41 | AC | 214 ms
59,124 KB |
testcase_42 | AC | 204 ms
56,800 KB |
testcase_43 | AC | 248 ms
58,484 KB |
testcase_44 | AC | 210 ms
56,768 KB |
testcase_45 | AC | 243 ms
61,816 KB |
testcase_46 | AC | 185 ms
56,724 KB |
testcase_47 | AC | 227 ms
58,896 KB |
testcase_48 | AC | 62 ms
50,888 KB |
testcase_49 | AC | 63 ms
50,872 KB |
testcase_50 | AC | 61 ms
50,968 KB |
testcase_51 | AC | 61 ms
50,932 KB |
ソースコード
import java.util.*; @SuppressWarnings("unused") public class Main { private static void solve() { int n = ni(); int h = ni(); long x = 1; for (int i = 0; i < n; i++) { x *= ni(); x %= h; } System.out.println(x == 0 ? "YES" : "NO"); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }