結果
問題 | No.356 円周上を回る3つの動点の一致 |
ユーザー | uwi |
提出日時 | 2016-04-01 22:35:11 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 87 ms / 5,000 ms |
コード長 | 3,191 bytes |
コンパイル時間 | 7,963 ms |
コンパイル使用メモリ | 80,244 KB |
実行使用メモリ | 52,748 KB |
最終ジャッジ日時 | 2023-08-04 00:01:23 |
合計ジャッジ時間 | 12,206 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
50,524 KB |
testcase_01 | AC | 77 ms
52,140 KB |
testcase_02 | AC | 87 ms
52,492 KB |
testcase_03 | AC | 75 ms
51,724 KB |
testcase_04 | AC | 76 ms
51,720 KB |
testcase_05 | AC | 82 ms
52,176 KB |
testcase_06 | AC | 74 ms
52,532 KB |
testcase_07 | AC | 76 ms
50,588 KB |
testcase_08 | AC | 65 ms
50,712 KB |
testcase_09 | AC | 64 ms
50,444 KB |
testcase_10 | AC | 66 ms
48,680 KB |
testcase_11 | AC | 76 ms
52,168 KB |
testcase_12 | AC | 73 ms
52,384 KB |
testcase_13 | AC | 75 ms
52,180 KB |
testcase_14 | AC | 77 ms
52,748 KB |
testcase_15 | AC | 73 ms
50,648 KB |
testcase_16 | AC | 77 ms
52,452 KB |
testcase_17 | AC | 72 ms
50,924 KB |
testcase_18 | AC | 78 ms
52,396 KB |
testcase_19 | AC | 75 ms
50,912 KB |
testcase_20 | AC | 74 ms
51,960 KB |
testcase_21 | AC | 77 ms
52,016 KB |
testcase_22 | AC | 87 ms
52,212 KB |
testcase_23 | AC | 69 ms
50,676 KB |
testcase_24 | AC | 77 ms
52,416 KB |
testcase_25 | AC | 70 ms
50,888 KB |
testcase_26 | AC | 67 ms
50,856 KB |
testcase_27 | AC | 64 ms
50,692 KB |
testcase_28 | AC | 68 ms
50,828 KB |
testcase_29 | AC | 76 ms
52,364 KB |
testcase_30 | AC | 86 ms
52,288 KB |
testcase_31 | AC | 65 ms
50,708 KB |
testcase_32 | AC | 73 ms
50,996 KB |
testcase_33 | AC | 69 ms
50,612 KB |
testcase_34 | AC | 66 ms
50,704 KB |
testcase_35 | AC | 67 ms
51,532 KB |
testcase_36 | AC | 68 ms
50,928 KB |
testcase_37 | AC | 63 ms
50,608 KB |
testcase_38 | AC | 81 ms
52,556 KB |
testcase_39 | AC | 66 ms
50,636 KB |
testcase_40 | AC | 76 ms
52,732 KB |
testcase_41 | AC | 77 ms
52,380 KB |
testcase_42 | AC | 67 ms
52,052 KB |
testcase_43 | AC | 76 ms
51,016 KB |
testcase_44 | AC | 76 ms
52,396 KB |
testcase_45 | AC | 73 ms
50,596 KB |
testcase_46 | AC | 78 ms
52,516 KB |
testcase_47 | AC | 78 ms
52,504 KB |
testcase_48 | AC | 65 ms
52,312 KB |
testcase_49 | AC | 77 ms
50,712 KB |
testcase_50 | AC | 78 ms
52,376 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 Q616 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { long t1 = nl(), t2 = nl(), t3 = nl(); long n1 = t1*t2; long d1 = t2-t1; long n2 = t1*t3; long d2 = t3-t1; long L = n1*d2; long R = n2*d1; long g = gcd(L, R); L /= g; R /= g; // k*n1*d2=l*n2*d1 n1 *= R; long gg = gcd(n1, d1); out.println((n1/gg) + "/" + (d1/gg)); } public static long gcd(long a, long b) { while (b > 0) { long 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 Q616().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)); } }