結果
問題 | No.648 お や す み |
ユーザー | denderaKawazu |
提出日時 | 2018-02-09 23:30:32 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,257 bytes |
コンパイル時間 | 2,117 ms |
コンパイル使用メモリ | 74,724 KB |
実行使用メモリ | 56,328 KB |
最終ジャッジ日時 | 2024-04-17 09:34:58 |
合計ジャッジ時間 | 14,438 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 129 ms
54,068 KB |
testcase_01 | AC | 127 ms
54,144 KB |
testcase_02 | AC | 110 ms
52,820 KB |
testcase_03 | AC | 125 ms
54,096 KB |
testcase_04 | AC | 129 ms
54,408 KB |
testcase_05 | AC | 115 ms
52,888 KB |
testcase_06 | AC | 125 ms
53,008 KB |
testcase_07 | AC | 126 ms
53,888 KB |
testcase_08 | AC | 130 ms
53,980 KB |
testcase_09 | AC | 126 ms
54,256 KB |
testcase_10 | AC | 128 ms
54,172 KB |
testcase_11 | AC | 126 ms
54,104 KB |
testcase_12 | AC | 122 ms
53,888 KB |
testcase_13 | AC | 129 ms
54,100 KB |
testcase_14 | AC | 124 ms
53,852 KB |
testcase_15 | AC | 128 ms
54,172 KB |
testcase_16 | AC | 127 ms
53,868 KB |
testcase_17 | AC | 129 ms
54,132 KB |
testcase_18 | AC | 132 ms
54,140 KB |
testcase_19 | AC | 127 ms
53,884 KB |
testcase_20 | AC | 130 ms
54,320 KB |
testcase_21 | AC | 128 ms
54,116 KB |
testcase_22 | AC | 131 ms
54,108 KB |
testcase_23 | AC | 130 ms
54,520 KB |
testcase_24 | AC | 127 ms
54,028 KB |
testcase_25 | AC | 126 ms
54,140 KB |
testcase_26 | AC | 126 ms
53,844 KB |
testcase_27 | AC | 130 ms
54,272 KB |
testcase_28 | AC | 129 ms
54,172 KB |
testcase_29 | AC | 131 ms
54,176 KB |
testcase_30 | AC | 130 ms
54,392 KB |
testcase_31 | AC | 127 ms
54,148 KB |
testcase_32 | AC | 115 ms
53,024 KB |
testcase_33 | AC | 127 ms
54,024 KB |
testcase_34 | AC | 115 ms
53,100 KB |
testcase_35 | AC | 127 ms
54,244 KB |
testcase_36 | AC | 126 ms
54,096 KB |
testcase_37 | AC | 127 ms
53,876 KB |
testcase_38 | AC | 125 ms
54,240 KB |
testcase_39 | AC | 124 ms
54,276 KB |
testcase_40 | AC | 127 ms
53,988 KB |
testcase_41 | AC | 129 ms
54,236 KB |
testcase_42 | AC | 127 ms
54,140 KB |
testcase_43 | AC | 127 ms
54,060 KB |
testcase_44 | AC | 126 ms
54,292 KB |
testcase_45 | AC | 116 ms
53,108 KB |
testcase_46 | AC | 114 ms
53,236 KB |
testcase_47 | AC | 125 ms
54,180 KB |
testcase_48 | AC | 116 ms
52,856 KB |
testcase_49 | AC | 126 ms
54,120 KB |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | AC | 116 ms
52,832 KB |
testcase_61 | AC | 127 ms
54,448 KB |
testcase_62 | AC | 115 ms
53,020 KB |
testcase_63 | AC | 129 ms
54,084 KB |
testcase_64 | AC | 116 ms
54,256 KB |
testcase_65 | AC | 116 ms
53,120 KB |
testcase_66 | AC | 124 ms
54,212 KB |
testcase_67 | AC | 129 ms
54,412 KB |
testcase_68 | AC | 128 ms
54,212 KB |
testcase_69 | AC | 126 ms
53,988 KB |
testcase_70 | AC | 116 ms
53,084 KB |
testcase_71 | AC | 116 ms
53,124 KB |
testcase_72 | AC | 134 ms
54,312 KB |
testcase_73 | AC | 134 ms
54,152 KB |
testcase_74 | AC | 129 ms
54,284 KB |
testcase_75 | AC | 130 ms
54,380 KB |
testcase_76 | AC | 117 ms
54,488 KB |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | AC | 126 ms
54,096 KB |
testcase_83 | AC | 129 ms
54,052 KB |
ソースコード
import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Scanner; /** * Built using CHelper plug-in * Actual solution is at the top */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; Scanner in = new Scanner(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskC solver = new TaskC(); solver.solve(1, in, out); out.close(); } static class TaskC { public void solve(int testNumber, Scanner in, PrintWriter out) { long n = in.nextLong(); long maxN = n; long minN = 0; while (maxN - minN > -1) { long cn = (maxN + minN) / 2; long sum = cn * (cn + 1) / 2; if (sum == n) { out.println("YES"); out.println(cn); return; } else if (sum > n) { maxN = cn - 1; } else if (sum < n) { minN = cn + 1; } } out.println("NO"); } } }