結果
問題 | No.810 割った余りの個数 |
ユーザー | tak |
提出日時 | 2019-07-03 19:30:55 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 39 ms / 2,000 ms |
コード長 | 2,760 bytes |
コンパイル時間 | 4,548 ms |
コンパイル使用メモリ | 74,784 KB |
実行使用メモリ | 49,656 KB |
最終ジャッジ日時 | 2023-10-14 09:50:38 |
合計ジャッジ時間 | 6,280 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
49,284 KB |
testcase_01 | AC | 38 ms
49,184 KB |
testcase_02 | AC | 37 ms
49,240 KB |
testcase_03 | AC | 37 ms
49,256 KB |
testcase_04 | AC | 35 ms
49,656 KB |
testcase_05 | AC | 36 ms
49,312 KB |
testcase_06 | AC | 35 ms
49,172 KB |
testcase_07 | AC | 34 ms
49,252 KB |
testcase_08 | AC | 34 ms
49,396 KB |
testcase_09 | AC | 34 ms
49,104 KB |
testcase_10 | AC | 33 ms
47,204 KB |
testcase_11 | AC | 36 ms
49,108 KB |
testcase_12 | AC | 38 ms
49,072 KB |
testcase_13 | AC | 39 ms
49,128 KB |
testcase_14 | AC | 36 ms
49,228 KB |
testcase_15 | AC | 37 ms
49,212 KB |
testcase_16 | AC | 39 ms
49,232 KB |
testcase_17 | AC | 39 ms
49,472 KB |
testcase_18 | AC | 39 ms
49,328 KB |
testcase_19 | AC | 38 ms
49,188 KB |
testcase_20 | AC | 39 ms
49,192 KB |
testcase_21 | AC | 39 ms
49,128 KB |
testcase_22 | AC | 37 ms
47,532 KB |
testcase_23 | AC | 36 ms
49,248 KB |
testcase_24 | AC | 37 ms
49,084 KB |
testcase_25 | AC | 36 ms
49,476 KB |
testcase_26 | AC | 38 ms
49,312 KB |
testcase_27 | AC | 37 ms
49,080 KB |
testcase_28 | AC | 37 ms
48,996 KB |
testcase_29 | AC | 36 ms
49,360 KB |
ソースコード
import java.io.PrintWriter; import java.util.*; import java.io.*; public class Solver { public static void main(String[] args) { new Solver().stream(); } final IO io = new IO(); final PrintWriter out = new PrintWriter(System.out); void stream() { solve(); out.flush(); } void solve() { int L = io.Int(); int R = io.Int(); int M = io.Int(); System.out.println(Math.min(M, R - L + 1)); } } class IO { private final InputStream in = System.in; private final byte[] buffer = new byte[1 << 12]; private int ptr = 0, buffLen = 0; private boolean hasNextByte() { if (ptr < buffLen) return true; ptr = 0; try { buffLen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } return buffLen > 0; } private int readByte() { return hasNextByte() ? buffer[ptr++] : -1; } private boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } //ASCII private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } private boolean hasNext() { skipUnprintable(); return hasNextByte(); } private 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 String String() { return next(); } public char Char() { return next().charAt(0); } public int Int() { return Integer.parseInt(next()); } public long Long() { return Long.parseLong(next()); } public double Double() { return Double.parseDouble(next()); } public String[] StringArr(final int n) { final String[] arr = new String[n]; for (int i = 0; i < n; ++i) arr[i] = String(); return arr; } public char[] CharArr(final int n) { final char[] arr = new char[n]; for (int i = 0; i < n; ++i) arr[i] = Char(); return arr; } public int[] IntArr(final int n) { final int[] arr = new int[n]; for (int i = 0; i < n; ++i) arr[i] = Int(); return arr; } public long[] LongArr(final int n) { final long[] arr = new long[n]; for (int i = 0; i < n; ++i) arr[i] = Long(); return arr; } public double[] DoubleArr(final int n) { final double[] arr = new double[n]; for (int i = 0; i < n; ++i) arr[i] = Double(); return arr; } }