結果
問題 | No.419 直角三角形 |
ユーザー | nCk_cv |
提出日時 | 2016-09-13 16:32:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 132 ms / 1,000 ms |
コード長 | 3,094 bytes |
コンパイル時間 | 2,247 ms |
コンパイル使用メモリ | 79,380 KB |
実行使用メモリ | 51,696 KB |
最終ジャッジ日時 | 2024-11-17 04:53:59 |
合計ジャッジ時間 | 5,888 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 127 ms
51,696 KB |
testcase_01 | AC | 112 ms
39,528 KB |
testcase_02 | AC | 132 ms
40,700 KB |
testcase_03 | AC | 113 ms
39,972 KB |
testcase_04 | AC | 124 ms
40,632 KB |
testcase_05 | AC | 113 ms
39,976 KB |
testcase_06 | AC | 110 ms
39,572 KB |
testcase_07 | AC | 123 ms
40,832 KB |
testcase_08 | AC | 121 ms
40,980 KB |
testcase_09 | AC | 110 ms
39,880 KB |
testcase_10 | AC | 105 ms
39,440 KB |
testcase_11 | AC | 122 ms
40,540 KB |
testcase_12 | AC | 109 ms
39,516 KB |
testcase_13 | AC | 121 ms
40,828 KB |
testcase_14 | AC | 109 ms
39,552 KB |
testcase_15 | AC | 108 ms
40,056 KB |
testcase_16 | AC | 120 ms
40,656 KB |
testcase_17 | AC | 111 ms
40,028 KB |
testcase_18 | AC | 124 ms
41,156 KB |
testcase_19 | AC | 111 ms
39,772 KB |
testcase_20 | AC | 108 ms
39,820 KB |
testcase_21 | AC | 121 ms
41,140 KB |
testcase_22 | AC | 122 ms
40,672 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.NoSuchElementException; public class Main { static long MOD = 1000000007L; public static void main(String[] args) { FastScanner sc = new FastScanner(); int a = sc.nextInt(); int b = sc.nextInt(); double min = MOD; min = Math.min(min, a * a + b * b); if(b * b - a * a > 0) min = Math.min(min, b * b - a * a); if(a * a - b * b > 0) min = Math.min(min, a * a - b * b); min = Math.sqrt(min); System.out.printf("%.20f\n",min); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } }