提出 #72882095

---

ソースコード 拡げる

/*
 * ------------------------------------------------------------
 * Author: Karan Singh Chauhan
 * © 2025 Karan Singh Chauhan. All rights reserved.
 * ------------------------------------------------------------
 * Competitive Programming Template (Java 21)
 * ------------------------------------------------------------
 * Features:
 *  -> Ultra-fast I/O (FastReader + PrintWriter)
 *  -> Common Math Utilities (GCD, LCM, Modular Arithmetic)
 *  -> Pair record + Custom sorting helpers
 *  -> Debug mode (auto-disabled for online judge)
 *  -> Auto file input/output (input.txt → output.txt)
 * ------------------------------------------------------------
 */

import java.io.*;
import java.util.*;

public class Main {

    static final long MOD = 1_000_000_007L;
    static final int INF = (int) 1e9;
    static final long LINF = (long) 1e18;

    static FastReader sc;
    static PrintWriter out;
    static boolean DEBUG = System.getProperty("ONLINE_JUDGE") == null;

    public static void main(String[] args) throws Exception {
        if (DEBUG) {
            try {
                sc = new FastReader(new FileInputStream("input.txt"));
                out = new PrintWriter(new FileOutputStream("output.txt"));
            } catch (FileNotFoundException e) {
                System.err.println(" input.txt not found! Falling back to standard input/output.");
                sc = new FastReader(System.in);
                out = new PrintWriter(new BufferedOutputStream(System.out));
            }
        } else {
            sc = new FastReader(System.in);
            out = new PrintWriter(new BufferedOutputStream(System.out));
        }

        int t = 1;
        // Uncomment below for multiple test cases

        while (t-- > 0) solve();

        out.flush();
        out.close();
    }

    static void solve() {
        //  Write your code here ↓↓↓
        int n = in();
        int k = in();

        int count = n;
        int beans = 0;
        int ans = 0;

        if(n >= k){
            System.out.println(0);
            return;
        }

        while (beans < k) {
            beans += count;
            ans++;
            count++;
        }
        System.out.println(ans - 1);
    }

    // ------------------------------------------------------------
    //  Smaller Reader For Fast Input
    // ------------------------------------------------------------

    static int in(){
        return sc.nextInt();
    }

    static long ll(){
        return sc.nextLong();
    }

    static String ss(){
        return sc.next();
    }

    static int[] ia(int n){
        return sc.readIntArray(n);
    }

    static long[] la(int n){
        return sc.readLongArray(n);
    }

    // ------------------------------------------------------------
    //  MATH UTILITIES
    // ------------------------------------------------------------
    static long gcd(long a, long b) {
        while (b != 0) { long tmp = a % b; a = b; b = tmp; } return a;
    }
    static long lcm(long a, long b) { return a / gcd(a, b) * b; }
    static long modAdd(long a, long b) { long res = (a + b) % MOD; return res < 0 ? res + MOD : res; }
    static long modSub(long a, long b) { long res = (a - b) % MOD; return res < 0 ? res + MOD : res; }
    static long modMul(long a, long b) { return (a % MOD) * (b % MOD) % MOD; }
    static long modPow(long base, long exp) { long res = 1; base %= MOD; while (exp > 0) { if ((exp & 1) == 1) res = (res * base) % MOD; base = (base * base) % MOD; exp >>= 1; } return res; }
    static long modInverse(long a) { return modPow(a, MOD - 2); }

    // ------------------------------------------------------------
    //  HELPER RECORDS / STRUCTURES (Java 21)
    // ------------------------------------------------------------
    record Pair(int x, int y) implements Comparable<Pair> {
        @Override
        public int compareTo(Pair o) {
            int cmp = Integer.compare(x, o.x);
            return cmp != 0 ? cmp : Integer.compare(y, o.y);
        }
        @Override
        public String toString() { return "(" + x + ", " + y + ")"; }
    }

    // ------------------------------------------------------------
    // ⚡ FAST INPUT READER
    // ------------------------------------------------------------
    static class FastReader {
        private final byte[] buffer = new byte[1 << 16];
        private int ptr = 0, len = 0;
        private final InputStream in;

        FastReader(InputStream stream) { in = stream; }

        private int readByte() {
            if (ptr >= len) {
                ptr = 0;
                try { len = in.read(buffer); if (len <= 0) return -1; } catch (IOException e) { return -1; }
            }
            return buffer[ptr++];
        }

        String next() {
            int c; StringBuilder sb = new StringBuilder();
            do { c = readByte(); } while (c <= ' ');
            while (c > ' ') { sb.append((char) c); c = readByte(); }
            return sb.toString();
        }

        int nextInt() {
            int c, sign = 1, val = 0;
            do { c = readByte(); } while (c <= ' ');
            if (c == '-') { sign = -1; c = readByte(); }
            while (c > ' ') { val = val * 10 + (c - '0'); c = readByte(); }
            return val * sign;
        }

        long nextLong() {
            int c, sign = 1; long val = 0;
            do { c = readByte(); } while (c <= ' ');
            if (c == '-') { sign = -1; c = readByte(); }
            while (c > ' ') { val = val * 10 + (c - '0'); c = readByte(); }
            return val * sign;
        }

        double nextDouble() { return Double.parseDouble(next()); }

        int[] readIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; }
        long[] readLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; }
    }

    // ------------------------------------------------------------
    //  DEBUG UTILITIES
    // ------------------------------------------------------------
    static void debug(Object... o) { if (DEBUG) out.println(Arrays.deepToString(o)); }
}

提出情報

ジャッジ結果