結果
問題 | No.928 軽減税率? |
ユーザー | hiromi_ayase |
提出日時 | 2019-11-22 22:03:12 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 110 ms / 1,000 ms |
コード長 | 3,143 bytes |
コンパイル時間 | 3,076 ms |
コンパイル使用メモリ | 78,516 KB |
実行使用メモリ | 52,108 KB |
最終ジャッジ日時 | 2023-08-01 11:52:19 |
合計ジャッジ時間 | 8,216 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 104 ms
51,212 KB |
testcase_01 | AC | 104 ms
51,064 KB |
testcase_02 | AC | 69 ms
50,680 KB |
testcase_03 | AC | 71 ms
50,744 KB |
testcase_04 | AC | 109 ms
51,016 KB |
testcase_05 | AC | 108 ms
50,880 KB |
testcase_06 | AC | 110 ms
51,028 KB |
testcase_07 | AC | 105 ms
51,060 KB |
testcase_08 | AC | 110 ms
49,160 KB |
testcase_09 | AC | 107 ms
51,000 KB |
testcase_10 | AC | 106 ms
50,880 KB |
testcase_11 | AC | 105 ms
51,044 KB |
testcase_12 | AC | 109 ms
51,056 KB |
testcase_13 | AC | 107 ms
50,876 KB |
testcase_14 | AC | 106 ms
51,064 KB |
testcase_15 | AC | 108 ms
51,096 KB |
testcase_16 | AC | 106 ms
50,956 KB |
testcase_17 | AC | 109 ms
51,108 KB |
testcase_18 | AC | 107 ms
51,016 KB |
testcase_19 | AC | 108 ms
50,980 KB |
testcase_20 | AC | 109 ms
51,092 KB |
testcase_21 | AC | 108 ms
52,108 KB |
testcase_22 | AC | 69 ms
50,716 KB |
testcase_23 | AC | 68 ms
50,916 KB |
testcase_24 | AC | 68 ms
50,852 KB |
testcase_25 | AC | 108 ms
51,088 KB |
testcase_26 | AC | 105 ms
51,080 KB |
testcase_27 | AC | 105 ms
51,124 KB |
testcase_28 | AC | 104 ms
51,100 KB |
testcase_29 | AC | 104 ms
51,124 KB |
testcase_30 | AC | 104 ms
51,080 KB |
testcase_31 | AC | 104 ms
51,060 KB |
testcase_32 | AC | 68 ms
50,840 KB |
testcase_33 | AC | 104 ms
51,144 KB |
testcase_34 | AC | 104 ms
50,876 KB |
testcase_35 | AC | 104 ms
51,096 KB |
ソースコード
public class Main { private static void solve() { int p = ni(); int q = ni(); int a = ni(); if (a == 0) { if (p >= q) { System.out.println(0); return; } int ret = 0; for (long v = 1; v <= (int) 1e7; v++) { long in = (100 + p) * v / 100; long out = (100 + q) * v / 100 + a; if (in >= out) { ret++; } } System.out.println((int) 1e9 - ret); } else { if (p <= q) { System.out.println(1000000000); return; } int ret = 0; for (long v = 1; v <= (int) 1e7; v++) { long in = (100 + p) * v / 100; long out = (100 + q) * v / 100 + a; if (in < out) { ret++; } } System.out.println(ret); } } 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)); } }