結果

問題 No.538 N.G.S.
ユーザー kenkooookenkoooo
提出日時 2017-06-30 22:43:17
言語 Java21
(openjdk 21)
結果
AC  
実行時間 58 ms / 2,000 ms
コード長 4,011 bytes
コンパイル時間 4,108 ms
コンパイル使用メモリ 77,220 KB
実行使用メモリ 53,336 KB
最終ジャッジ日時 2023-10-25 04:19:56
合計ジャッジ時間 8,831 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
53,308 KB
testcase_01 AC 56 ms
53,308 KB
testcase_02 AC 55 ms
53,300 KB
testcase_03 AC 54 ms
53,304 KB
testcase_04 AC 56 ms
53,328 KB
testcase_05 AC 55 ms
51,264 KB
testcase_06 AC 55 ms
53,296 KB
testcase_07 AC 56 ms
53,296 KB
testcase_08 AC 55 ms
53,296 KB
testcase_09 AC 55 ms
51,396 KB
testcase_10 AC 56 ms
53,308 KB
testcase_11 AC 55 ms
53,312 KB
testcase_12 AC 56 ms
53,308 KB
testcase_13 AC 56 ms
52,368 KB
testcase_14 AC 55 ms
53,336 KB
testcase_15 AC 54 ms
53,304 KB
testcase_16 AC 56 ms
53,316 KB
testcase_17 AC 54 ms
52,400 KB
testcase_18 AC 56 ms
52,228 KB
testcase_19 AC 54 ms
52,396 KB
testcase_20 AC 56 ms
53,296 KB
testcase_21 AC 56 ms
52,220 KB
testcase_22 AC 55 ms
53,308 KB
testcase_23 AC 58 ms
53,304 KB
testcase_24 AC 55 ms
52,408 KB
testcase_25 AC 55 ms
53,296 KB
testcase_26 AC 55 ms
52,376 KB
testcase_27 AC 55 ms
51,408 KB
testcase_28 AC 55 ms
53,296 KB
testcase_29 AC 55 ms
53,304 KB
testcase_30 AC 56 ms
53,316 KB
testcase_31 AC 57 ms
53,308 KB
testcase_32 AC 57 ms
53,300 KB
testcase_33 AC 57 ms
53,304 KB
testcase_34 AC 56 ms
52,200 KB
testcase_35 AC 57 ms
51,400 KB
testcase_36 AC 55 ms
51,404 KB
testcase_37 AC 56 ms
53,304 KB
testcase_38 AC 55 ms
53,296 KB
testcase_39 AC 56 ms
52,372 KB
testcase_40 AC 55 ms
53,304 KB
testcase_41 AC 56 ms
53,300 KB
testcase_42 AC 55 ms
53,296 KB
testcase_43 AC 55 ms
52,232 KB
testcase_44 AC 56 ms
51,420 KB
testcase_45 AC 56 ms
52,228 KB
testcase_46 AC 54 ms
52,412 KB
testcase_47 AC 55 ms
52,384 KB
testcase_48 AC 54 ms
53,296 KB
testcase_49 AC 54 ms
53,304 KB
testcase_50 AC 56 ms
53,296 KB
testcase_51 AC 55 ms
53,296 KB
testcase_52 AC 56 ms
51,400 KB
testcase_53 AC 55 ms
53,308 KB
testcase_54 AC 56 ms
53,308 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;

public class Main {

  private void solve(FastScanner in, PrintWriter out) {
    long a = in.nextInt();
    long b = in.nextInt();
    long c = in.nextInt();
    if (a == 0) {
      long r = (c - b) / b;
      out.println(r * c + b);
      return;
    }

    long d = (b * b - c * a);
    long r = (b * (b - a) - (b * b - c * a)) / a;
    out.println((r * c + d) / (b - a));
  }

  public static void main(String[] args) {
    PrintWriter out = new PrintWriter(System.out);
    new Main().solve(new FastScanner(), out);
    out.close();
  }

  private static class FastScanner {

    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int bufferLength = 0;

    private boolean hasNextByte() {
      if (ptr < bufferLength) {
        return true;
      } else {
        ptr = 0;
        try {
          bufferLength = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (bufferLength <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) {
        return buffer[ptr++];
      } else {
        return -1;
      }
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) {
        ptr++;
      }
    }

    boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public 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();
    }

    long nextLong() {
      if (!hasNext()) {
        throw new NoSuchElementException();
      }
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

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

    double[] nextDoubleArray(int n) {
      double[] array = new double[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextDouble();
      }
      return array;
    }

    double[][] nextDoubleMap(int n, int m) {
      double[][] map = new double[n][];
      for (int i = 0; i < n; i++) {
        map[i] = nextDoubleArray(m);
      }
      return map;
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int n) {
      int[] array = new int[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextInt();
      }
      return array;
    }

    public long[] nextLongArray(int n) {
      long[] array = new long[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextLong();
      }
      return array;
    }

    public String[] nextStringArray(int n) {
      String[] array = new String[n];
      for (int i = 0; i < n; i++) {
        array[i] = next();
      }
      return array;
    }

    public char[][] nextCharMap(int n) {
      char[][] array = new char[n][];
      for (int i = 0; i < n; i++) {
        array[i] = next().toCharArray();
      }
      return array;
    }

    public int[][] nextIntMap(int n, int m) {
      int[][] map = new int[n][];
      for (int i = 0; i < n; i++) {
        map[i] = nextIntArray(m);
      }
      return map;
    }
  }
}
0