結果

問題 No.857 素振り
ユーザー tak
提出日時 2019-11-14 18:14:14
言語 Java
(openjdk 23)
結果
RE  
実行時間 -
コード長 2,813 bytes
コンパイル時間 3,742 ms
コンパイル使用メモリ 78,096 KB
実行使用メモリ 36,904 KB
最終ジャッジ日時 2024-09-21 21:26:33
合計ジャッジ時間 4,989 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 2 RE * 6
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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 x = io.Int();
        int y = io.Int();
        int z = io.Int();
        int ans = z;
        if(x <= z) ans--;
        if(y <= z) ans--;
        System.out.println(ans);
    }
}
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;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0