結果
問題 | No.339 何人が回答したのか |
ユーザー | uwi |
提出日時 | 2016-01-29 22:25:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 55 ms / 1,000 ms |
コード長 | 3,025 bytes |
コンパイル時間 | 3,864 ms |
コンパイル使用メモリ | 81,868 KB |
実行使用メモリ | 37,152 KB |
最終ジャッジ日時 | 2024-09-21 17:58:04 |
合計ジャッジ時間 | 8,621 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
36,976 KB |
testcase_01 | AC | 51 ms
36,924 KB |
testcase_02 | AC | 53 ms
36,864 KB |
testcase_03 | AC | 55 ms
37,152 KB |
testcase_04 | AC | 51 ms
37,152 KB |
testcase_05 | AC | 51 ms
36,948 KB |
testcase_06 | AC | 51 ms
36,820 KB |
testcase_07 | AC | 53 ms
36,992 KB |
testcase_08 | AC | 51 ms
37,052 KB |
testcase_09 | AC | 50 ms
36,924 KB |
testcase_10 | AC | 51 ms
36,912 KB |
testcase_11 | AC | 51 ms
36,912 KB |
testcase_12 | AC | 52 ms
36,992 KB |
testcase_13 | AC | 50 ms
36,912 KB |
testcase_14 | AC | 51 ms
37,032 KB |
testcase_15 | AC | 51 ms
37,100 KB |
testcase_16 | AC | 52 ms
36,912 KB |
testcase_17 | AC | 52 ms
36,580 KB |
testcase_18 | AC | 51 ms
36,992 KB |
testcase_19 | AC | 55 ms
37,052 KB |
testcase_20 | AC | 52 ms
36,840 KB |
testcase_21 | AC | 51 ms
36,580 KB |
testcase_22 | AC | 53 ms
36,696 KB |
testcase_23 | AC | 52 ms
36,888 KB |
testcase_24 | AC | 52 ms
36,696 KB |
testcase_25 | AC | 52 ms
36,580 KB |
testcase_26 | AC | 52 ms
37,152 KB |
testcase_27 | AC | 54 ms
37,076 KB |
testcase_28 | AC | 52 ms
36,580 KB |
testcase_29 | AC | 51 ms
37,076 KB |
testcase_30 | AC | 54 ms
37,048 KB |
testcase_31 | AC | 52 ms
36,972 KB |
testcase_32 | AC | 52 ms
36,672 KB |
testcase_33 | AC | 51 ms
36,540 KB |
testcase_34 | AC | 53 ms
36,496 KB |
testcase_35 | AC | 52 ms
37,100 KB |
testcase_36 | AC | 51 ms
36,884 KB |
testcase_37 | AC | 51 ms
37,100 KB |
testcase_38 | AC | 53 ms
36,860 KB |
testcase_39 | AC | 51 ms
36,824 KB |
testcase_40 | AC | 52 ms
37,016 KB |
testcase_41 | AC | 53 ms
36,924 KB |
testcase_42 | AC | 51 ms
36,844 KB |
testcase_43 | AC | 51 ms
36,580 KB |
testcase_44 | AC | 51 ms
36,884 KB |
testcase_45 | AC | 53 ms
36,884 KB |
testcase_46 | AC | 53 ms
36,576 KB |
testcase_47 | AC | 51 ms
37,076 KB |
testcase_48 | AC | 52 ms
36,984 KB |
testcase_49 | AC | 52 ms
36,580 KB |
testcase_50 | AC | 52 ms
36,928 KB |
testcase_51 | AC | 51 ms
36,580 KB |
testcase_52 | AC | 51 ms
37,112 KB |
testcase_53 | AC | 50 ms
36,880 KB |
testcase_54 | AC | 51 ms
36,912 KB |
testcase_55 | AC | 51 ms
36,992 KB |
testcase_56 | AC | 52 ms
36,672 KB |
testcase_57 | AC | 54 ms
36,708 KB |
testcase_58 | AC | 51 ms
36,676 KB |
testcase_59 | AC | 52 ms
36,580 KB |
testcase_60 | AC | 51 ms
36,580 KB |
testcase_61 | AC | 52 ms
36,924 KB |
testcase_62 | AC | 52 ms
37,100 KB |
testcase_63 | AC | 52 ms
37,080 KB |
ソースコード
package contest; 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 Q776 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[] a = na(n); int g = a[0]; for(int v : a)g = gcd(g, v); int h = gcd(g, 100); out.println(100/h); } 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"); } public static void main(String[] args) throws Exception { new Q776().run(); } private byte[] inbuf = new byte[1024]; private 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 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[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, 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 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)); } }