結果
問題 | No.842 初詣 |
ユーザー | tak |
提出日時 | 2019-07-02 13:24:17 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 84 ms / 2,000 ms |
コード長 | 3,756 bytes |
コンパイル時間 | 3,609 ms |
コンパイル使用メモリ | 77,820 KB |
実行使用メモリ | 37,504 KB |
最終ジャッジ日時 | 2024-07-21 06:52:48 |
合計ジャッジ時間 | 5,664 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,612 KB |
testcase_01 | AC | 53 ms
36,196 KB |
testcase_02 | AC | 52 ms
36,044 KB |
testcase_03 | AC | 56 ms
36,544 KB |
testcase_04 | AC | 55 ms
36,388 KB |
testcase_05 | AC | 64 ms
36,700 KB |
testcase_06 | AC | 53 ms
36,428 KB |
testcase_07 | AC | 57 ms
36,512 KB |
testcase_08 | AC | 52 ms
36,604 KB |
testcase_09 | AC | 56 ms
36,340 KB |
testcase_10 | AC | 84 ms
37,504 KB |
testcase_11 | AC | 53 ms
36,480 KB |
testcase_12 | AC | 63 ms
36,544 KB |
testcase_13 | AC | 56 ms
36,500 KB |
testcase_14 | AC | 54 ms
36,424 KB |
testcase_15 | AC | 53 ms
36,316 KB |
testcase_16 | AC | 53 ms
36,060 KB |
testcase_17 | AC | 58 ms
36,500 KB |
testcase_18 | AC | 66 ms
36,664 KB |
testcase_19 | AC | 56 ms
36,620 KB |
testcase_20 | AC | 79 ms
36,816 KB |
ソースコード
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 a = io.Int(); int b = io.Int(); int c = io.Int(); int d = io.Int(); int e = io.Int(); int f = io.Int(); int g = io.Int(); Boolean isOk = false; for (int iA = 0; iA <= a; iA++) { for (int iB = 0; iB <= b; iB++) { for (int iC = 0; iC <= c; iC++) { for (int iD = 0; iD <= d; iD++) { for (int iE = 0; iE <= e; iE++) { for (int iF = 0; iF <= f; iF++) { int amount = 500 * iA + 100 * iB + 50 * iC + 10 * iD + 5 * iE + 1 * iF; isOk |= amount == g; } } } } } } System.out.println(isOk?"YES":"NO"); } } 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; } }