結果
問題 | No.166 マス埋めゲーム |
ユーザー | nCk_cv |
提出日時 | 2015-04-20 18:50:03 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 122 ms / 1,000 ms |
コード長 | 3,710 bytes |
コンパイル時間 | 4,016 ms |
コンパイル使用メモリ | 78,448 KB |
実行使用メモリ | 56,056 KB |
最終ジャッジ日時 | 2023-09-18 01:41:56 |
合計ジャッジ時間 | 5,904 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 118 ms
55,584 KB |
testcase_01 | AC | 118 ms
55,592 KB |
testcase_02 | AC | 120 ms
55,680 KB |
testcase_03 | AC | 119 ms
55,624 KB |
testcase_04 | AC | 120 ms
55,876 KB |
testcase_05 | AC | 117 ms
55,572 KB |
testcase_06 | AC | 118 ms
55,344 KB |
testcase_07 | AC | 118 ms
56,056 KB |
testcase_08 | AC | 118 ms
55,488 KB |
testcase_09 | AC | 119 ms
55,632 KB |
testcase_10 | AC | 120 ms
55,964 KB |
testcase_11 | AC | 120 ms
55,760 KB |
testcase_12 | AC | 118 ms
55,816 KB |
testcase_13 | AC | 121 ms
55,724 KB |
testcase_14 | AC | 117 ms
55,744 KB |
testcase_15 | AC | 119 ms
55,560 KB |
testcase_16 | AC | 119 ms
55,476 KB |
testcase_17 | AC | 118 ms
55,732 KB |
testcase_18 | AC | 122 ms
55,668 KB |
testcase_19 | AC | 118 ms
55,364 KB |
testcase_20 | AC | 119 ms
55,376 KB |
testcase_21 | AC | 122 ms
55,392 KB |
ソースコード
import java.awt.geom.Point2D; import java.io.*; import java.math.BigInteger; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.Deque; import java.util.HashMap; import java.util.HashSet; import java.util.List; import java.util.NoSuchElementException; import java.util.PriorityQueue; import java.util.Scanner; import java.util.Stack; import java.util.TreeMap; public class Main { static PrintWriter out = new PrintWriter(System.out); static FastScanner sc = new FastScanner(); static Scanner stdIn = new Scanner(System.in); public static void main (String[]agrs){ long h = sc.nextLong(); long w = sc.nextLong(); long n = sc.nextLong(); long k = sc.nextLong(); long sum = h * w; sum %= n; if(sum == 0) { sum = n; } if(sum == k) { System.out.println("YES"); } else { System.out.println("NO"); } out.flush(); } } //------------------------------// //-----------// class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 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++;} public 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(); } public 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(); } } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int 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(); } } public double nextDouble() { return Double.parseDouble(next()); } }