結果
問題 | No.736 約比 |
ユーザー | ziita |
提出日時 | 2018-09-28 21:53:14 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 56 ms / 2,000 ms |
コード長 | 3,897 bytes |
コンパイル時間 | 2,431 ms |
コンパイル使用メモリ | 83,536 KB |
実行使用メモリ | 50,304 KB |
最終ジャッジ日時 | 2024-10-12 06:14:36 |
合計ジャッジ時間 | 7,610 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
50,204 KB |
testcase_01 | AC | 51 ms
50,200 KB |
testcase_02 | AC | 50 ms
50,240 KB |
testcase_03 | AC | 52 ms
49,836 KB |
testcase_04 | AC | 53 ms
50,276 KB |
testcase_05 | AC | 51 ms
49,888 KB |
testcase_06 | AC | 52 ms
50,120 KB |
testcase_07 | AC | 51 ms
49,988 KB |
testcase_08 | AC | 50 ms
50,248 KB |
testcase_09 | AC | 52 ms
50,024 KB |
testcase_10 | AC | 51 ms
49,944 KB |
testcase_11 | AC | 53 ms
49,764 KB |
testcase_12 | AC | 52 ms
50,256 KB |
testcase_13 | AC | 52 ms
50,132 KB |
testcase_14 | AC | 52 ms
50,196 KB |
testcase_15 | AC | 51 ms
49,980 KB |
testcase_16 | AC | 51 ms
50,164 KB |
testcase_17 | AC | 53 ms
50,224 KB |
testcase_18 | AC | 52 ms
50,152 KB |
testcase_19 | AC | 50 ms
50,148 KB |
testcase_20 | AC | 50 ms
50,136 KB |
testcase_21 | AC | 52 ms
50,184 KB |
testcase_22 | AC | 51 ms
50,224 KB |
testcase_23 | AC | 51 ms
49,888 KB |
testcase_24 | AC | 51 ms
50,268 KB |
testcase_25 | AC | 52 ms
49,972 KB |
testcase_26 | AC | 51 ms
49,956 KB |
testcase_27 | AC | 51 ms
50,136 KB |
testcase_28 | AC | 52 ms
50,052 KB |
testcase_29 | AC | 52 ms
50,152 KB |
testcase_30 | AC | 51 ms
49,896 KB |
testcase_31 | AC | 51 ms
49,892 KB |
testcase_32 | AC | 51 ms
50,180 KB |
testcase_33 | AC | 51 ms
50,252 KB |
testcase_34 | AC | 50 ms
50,096 KB |
testcase_35 | AC | 50 ms
49,976 KB |
testcase_36 | AC | 52 ms
50,272 KB |
testcase_37 | AC | 52 ms
49,876 KB |
testcase_38 | AC | 52 ms
50,280 KB |
testcase_39 | AC | 50 ms
49,864 KB |
testcase_40 | AC | 52 ms
49,956 KB |
testcase_41 | AC | 52 ms
50,212 KB |
testcase_42 | AC | 52 ms
50,232 KB |
testcase_43 | AC | 52 ms
50,172 KB |
testcase_44 | AC | 56 ms
50,004 KB |
testcase_45 | AC | 53 ms
50,256 KB |
testcase_46 | AC | 53 ms
50,208 KB |
testcase_47 | AC | 53 ms
50,096 KB |
testcase_48 | AC | 51 ms
50,244 KB |
testcase_49 | AC | 52 ms
50,236 KB |
testcase_50 | AC | 53 ms
50,160 KB |
testcase_51 | AC | 52 ms
50,184 KB |
testcase_52 | AC | 52 ms
50,164 KB |
testcase_53 | AC | 51 ms
50,176 KB |
testcase_54 | AC | 51 ms
50,104 KB |
testcase_55 | AC | 52 ms
50,300 KB |
testcase_56 | AC | 50 ms
50,272 KB |
testcase_57 | AC | 51 ms
49,872 KB |
testcase_58 | AC | 51 ms
50,304 KB |
testcase_59 | AC | 53 ms
50,152 KB |
testcase_60 | AC | 54 ms
50,076 KB |
testcase_61 | AC | 52 ms
49,892 KB |
testcase_62 | AC | 51 ms
50,232 KB |
testcase_63 | AC | 50 ms
50,172 KB |
testcase_64 | AC | 51 ms
50,240 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; static int mod = 1_000_000_007; long inf = Long.MAX_VALUE; void solve(){ int n = ni(); long[] a = new long[n]; for(int i = 0; i < n; i++){ a[i] = nl(); } long div = a[0]; for(int i = 0; i < n; i++){ div = gcd(div, a[i]); } for(int i = 0; i < n; i++){ out.print(a[i]/div); if(i<n-1) out.print(":"); } } private static long gcd(long m, long n) { if(m < n) return gcd(n, m); if(n == 0) return m; return gcd(n, m % n); } private static long lcm(long m, long n) { return m * (n /gcd(m, n)); } 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 Main().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) && 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)); } }