結果
問題 | No.648 お や す み |
ユーザー | holeguma |
提出日時 | 2019-07-17 19:55:56 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 3,364 bytes |
コンパイル時間 | 3,554 ms |
コンパイル使用メモリ | 75,484 KB |
実行使用メモリ | 49,560 KB |
最終ジャッジ日時 | 2023-08-24 20:14:58 |
合計ジャッジ時間 | 10,286 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,096 KB |
testcase_01 | AC | 42 ms
49,248 KB |
testcase_02 | AC | 42 ms
49,084 KB |
testcase_03 | AC | 42 ms
49,128 KB |
testcase_04 | AC | 42 ms
49,432 KB |
testcase_05 | AC | 41 ms
49,324 KB |
testcase_06 | AC | 41 ms
49,156 KB |
testcase_07 | AC | 41 ms
49,204 KB |
testcase_08 | AC | 42 ms
49,156 KB |
testcase_09 | AC | 42 ms
49,160 KB |
testcase_10 | AC | 41 ms
49,216 KB |
testcase_11 | AC | 41 ms
47,556 KB |
testcase_12 | AC | 42 ms
49,108 KB |
testcase_13 | AC | 41 ms
49,088 KB |
testcase_14 | AC | 42 ms
49,212 KB |
testcase_15 | AC | 41 ms
49,152 KB |
testcase_16 | AC | 42 ms
49,304 KB |
testcase_17 | AC | 42 ms
49,072 KB |
testcase_18 | AC | 42 ms
48,972 KB |
testcase_19 | AC | 42 ms
49,136 KB |
testcase_20 | AC | 42 ms
49,116 KB |
testcase_21 | AC | 43 ms
49,224 KB |
testcase_22 | AC | 41 ms
49,280 KB |
testcase_23 | AC | 42 ms
47,224 KB |
testcase_24 | AC | 42 ms
49,264 KB |
testcase_25 | AC | 42 ms
49,112 KB |
testcase_26 | AC | 41 ms
49,228 KB |
testcase_27 | AC | 41 ms
49,132 KB |
testcase_28 | AC | 42 ms
49,088 KB |
testcase_29 | AC | 41 ms
49,188 KB |
testcase_30 | AC | 41 ms
49,208 KB |
testcase_31 | AC | 42 ms
49,316 KB |
testcase_32 | AC | 41 ms
49,560 KB |
testcase_33 | AC | 41 ms
49,284 KB |
testcase_34 | AC | 41 ms
49,316 KB |
testcase_35 | AC | 41 ms
49,004 KB |
testcase_36 | AC | 41 ms
49,244 KB |
testcase_37 | AC | 41 ms
49,496 KB |
testcase_38 | AC | 41 ms
49,152 KB |
testcase_39 | AC | 41 ms
49,116 KB |
testcase_40 | AC | 41 ms
49,140 KB |
testcase_41 | AC | 41 ms
48,984 KB |
testcase_42 | AC | 42 ms
49,240 KB |
testcase_43 | AC | 41 ms
49,356 KB |
testcase_44 | AC | 42 ms
49,236 KB |
testcase_45 | AC | 41 ms
49,020 KB |
testcase_46 | AC | 42 ms
48,968 KB |
testcase_47 | AC | 41 ms
49,140 KB |
testcase_48 | AC | 41 ms
49,092 KB |
testcase_49 | AC | 41 ms
49,120 KB |
testcase_50 | AC | 42 ms
49,092 KB |
testcase_51 | AC | 42 ms
49,344 KB |
testcase_52 | AC | 42 ms
49,080 KB |
testcase_53 | AC | 42 ms
49,432 KB |
testcase_54 | AC | 42 ms
49,084 KB |
testcase_55 | AC | 42 ms
49,220 KB |
testcase_56 | AC | 41 ms
47,148 KB |
testcase_57 | AC | 41 ms
49,240 KB |
testcase_58 | AC | 41 ms
49,192 KB |
testcase_59 | AC | 41 ms
49,132 KB |
testcase_60 | AC | 41 ms
49,520 KB |
testcase_61 | AC | 42 ms
49,004 KB |
testcase_62 | AC | 42 ms
49,256 KB |
testcase_63 | AC | 41 ms
49,500 KB |
testcase_64 | AC | 42 ms
49,116 KB |
testcase_65 | AC | 42 ms
49,236 KB |
testcase_66 | AC | 41 ms
48,964 KB |
testcase_67 | AC | 41 ms
49,520 KB |
testcase_68 | AC | 43 ms
47,064 KB |
testcase_69 | AC | 42 ms
49,440 KB |
testcase_70 | AC | 42 ms
49,172 KB |
testcase_71 | AC | 42 ms
49,492 KB |
testcase_72 | AC | 41 ms
49,216 KB |
testcase_73 | AC | 43 ms
49,172 KB |
testcase_74 | AC | 42 ms
49,288 KB |
testcase_75 | AC | 42 ms
49,240 KB |
testcase_76 | AC | 41 ms
49,284 KB |
testcase_77 | AC | 42 ms
49,168 KB |
testcase_78 | AC | 42 ms
49,284 KB |
testcase_79 | AC | 42 ms
49,152 KB |
testcase_80 | AC | 41 ms
49,128 KB |
testcase_81 | AC | 42 ms
49,516 KB |
testcase_82 | AC | 41 ms
48,976 KB |
testcase_83 | AC | 41 ms
49,000 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; import java.util.NoSuchElementException; public class Main { static PrintWriter out; static InputReader ir; static void solve() { long n = 2L * ir.nextLong(); long ub = (long) Math.sqrt(Long.MAX_VALUE), lb = 0; while (ub - lb > 1) { long mid = (ub + lb) / 2; if (mid * (mid + 1) >= n) { ub = mid; } else { lb = mid; } } if (ub * (ub + 1) == n) { out.println("YES"); out.println(ub); } else { out.println("NO"); } } public static void main(String[] args) { ir = new InputReader(System.in); out = new PrintWriter(System.out); solve(); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer = new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) { this.in = in; this.curbuf = this.lenbuf = 0; } public boolean hasNextByte() { if (curbuf >= lenbuf) { curbuf = 0; try { lenbuf = in.read(buffer); } catch (IOException e) { throw new InputMismatchException(); } if (lenbuf <= 0) return false; } return true; } private int readByte() { if (hasNextByte()) return buffer[curbuf++]; else return -1; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private void skip() { while (hasNextByte() && isSpaceChar(buffer[curbuf])) curbuf++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (!isSpaceChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } int res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } long res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public double nextDouble() { return Double.parseDouble(next()); } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } public char[][] nextCharMap(int n, int m) { char[][] map = new char[n][m]; for (int i = 0; i < n; i++) map[i] = next().toCharArray(); return map; } } static void tr(Object... o) { out.println(Arrays.deepToString(o)); } }