結果
問題 | No.1250 汝は倍数なりや? |
ユーザー | uwi |
提出日時 | 2020-10-09 21:20:37 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 101 ms / 1,000 ms |
コード長 | 3,267 bytes |
コンパイル時間 | 5,306 ms |
コンパイル使用メモリ | 79,844 KB |
実行使用メモリ | 52,812 KB |
最終ジャッジ日時 | 2023-09-27 13:55:29 |
合計ジャッジ時間 | 11,482 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
49,624 KB |
testcase_01 | AC | 38 ms
49,452 KB |
testcase_02 | AC | 37 ms
49,316 KB |
testcase_03 | AC | 38 ms
49,364 KB |
testcase_04 | AC | 37 ms
49,300 KB |
testcase_05 | AC | 39 ms
49,104 KB |
testcase_06 | AC | 39 ms
49,284 KB |
testcase_07 | AC | 38 ms
49,444 KB |
testcase_08 | AC | 38 ms
49,312 KB |
testcase_09 | AC | 37 ms
49,308 KB |
testcase_10 | AC | 38 ms
49,256 KB |
testcase_11 | AC | 37 ms
49,292 KB |
testcase_12 | AC | 37 ms
49,356 KB |
testcase_13 | AC | 38 ms
49,280 KB |
testcase_14 | AC | 37 ms
49,280 KB |
testcase_15 | AC | 37 ms
49,184 KB |
testcase_16 | AC | 36 ms
49,408 KB |
testcase_17 | AC | 37 ms
49,324 KB |
testcase_18 | AC | 39 ms
49,276 KB |
testcase_19 | AC | 37 ms
49,452 KB |
testcase_20 | AC | 40 ms
49,272 KB |
testcase_21 | AC | 39 ms
49,376 KB |
testcase_22 | AC | 40 ms
49,280 KB |
testcase_23 | AC | 41 ms
49,208 KB |
testcase_24 | AC | 40 ms
49,716 KB |
testcase_25 | AC | 42 ms
51,288 KB |
testcase_26 | AC | 41 ms
49,288 KB |
testcase_27 | AC | 41 ms
49,468 KB |
testcase_28 | AC | 42 ms
49,688 KB |
testcase_29 | AC | 39 ms
49,468 KB |
testcase_30 | AC | 38 ms
49,456 KB |
testcase_31 | AC | 38 ms
49,460 KB |
testcase_32 | AC | 39 ms
49,332 KB |
testcase_33 | AC | 100 ms
52,228 KB |
testcase_34 | AC | 87 ms
52,116 KB |
testcase_35 | AC | 98 ms
52,812 KB |
testcase_36 | AC | 101 ms
52,484 KB |
testcase_37 | AC | 88 ms
52,288 KB |
testcase_38 | AC | 92 ms
52,272 KB |
testcase_39 | AC | 84 ms
51,856 KB |
testcase_40 | AC | 89 ms
52,124 KB |
testcase_41 | AC | 89 ms
52,200 KB |
testcase_42 | AC | 80 ms
51,828 KB |
testcase_43 | AC | 98 ms
52,760 KB |
testcase_44 | AC | 80 ms
51,716 KB |
testcase_45 | AC | 99 ms
52,108 KB |
testcase_46 | AC | 74 ms
51,964 KB |
testcase_47 | AC | 91 ms
52,128 KB |
testcase_48 | AC | 37 ms
49,288 KB |
testcase_49 | AC | 40 ms
49,288 KB |
testcase_50 | AC | 39 ms
49,248 KB |
testcase_51 | AC | 37 ms
49,352 KB |
ソースコード
package contest201009; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class B { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), h = ni(); int[] a = na(n); long x = 1; for(int v : a){ x = x * v % h; } out.println(x == 0 ? "YES" : "NO"); } public static int gcd(int a, int b) { while (b > 0) { int c = a; a = b; b = c % b; } return a; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new B().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }