結果

問題 No.598 オーバーフローファンタジー
ユーザー hiromi_ayase
提出日時 2017-11-24 22:29:17
言語 Java11
(openjdk 11.0.6)
結果
AC  
実行時間 147 ms / 2,000 ms
コード長 2,615 Byte
コンパイル時間 2,298 ms
使用メモリ 24,424 KB
最終ジャッジ日時 2020-05-02 03:32:36

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 138 ms
24,404 KB
testcase_01 AC 138 ms
24,404 KB
testcase_02 AC 135 ms
24,392 KB
testcase_03 AC 138 ms
24,404 KB
testcase_04 AC 135 ms
24,368 KB
testcase_05 AC 137 ms
24,408 KB
testcase_06 AC 137 ms
24,412 KB
testcase_07 AC 134 ms
24,412 KB
testcase_08 AC 136 ms
24,408 KB
testcase_09 AC 138 ms
24,404 KB
testcase_10 AC 135 ms
24,408 KB
testcase_11 AC 140 ms
24,408 KB
testcase_12 AC 141 ms
24,412 KB
testcase_13 AC 137 ms
24,408 KB
testcase_14 AC 139 ms
24,408 KB
testcase_15 AC 134 ms
24,400 KB
testcase_16 AC 139 ms
24,412 KB
testcase_17 AC 137 ms
24,404 KB
testcase_18 AC 136 ms
24,412 KB
testcase_19 AC 136 ms
24,404 KB
testcase_20 AC 141 ms
24,412 KB
testcase_21 AC 139 ms
24,408 KB
testcase_22 AC 137 ms
24,412 KB
testcase_23 AC 144 ms
24,408 KB
testcase_24 AC 147 ms
24,412 KB
testcase_25 AC 146 ms
24,404 KB
testcase_26 AC 144 ms
24,404 KB
testcase_27 AC 137 ms
24,424 KB
testcase_28 AC 135 ms
24,400 KB
testcase_29 AC 135 ms
24,404 KB
testcase_30 AC 134 ms
24,404 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
public class Main {
  private static void solve() {
    long n = ni();
    long x = ni();
    long a = ni();
    long b = ni();
    
    
    long ret1 = (x + a - 1) / a;
    long ret2 = ((1L << (n - 1)) - x + b - 1) / b;
    System.out.println(Math.min(ret1, ret2));
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}


0