結果
問題 | No.593 4進FizzBuzz |
ユーザー | hiromi_ayase |
提出日時 | 2017-11-10 23:01:31 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 223 ms / 2,000 ms |
コード長 | 2,549 bytes |
コンパイル時間 | 4,604 ms |
コンパイル使用メモリ | 82,988 KB |
実行使用メモリ | 63,004 KB |
最終ジャッジ日時 | 2023-08-16 03:40:40 |
合計ジャッジ時間 | 10,728 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
50,804 KB |
testcase_01 | AC | 71 ms
50,740 KB |
testcase_02 | AC | 68 ms
50,616 KB |
testcase_03 | AC | 69 ms
50,764 KB |
testcase_04 | AC | 69 ms
50,580 KB |
testcase_05 | AC | 68 ms
50,892 KB |
testcase_06 | AC | 69 ms
50,664 KB |
testcase_07 | AC | 69 ms
50,668 KB |
testcase_08 | AC | 70 ms
50,804 KB |
testcase_09 | AC | 69 ms
50,640 KB |
testcase_10 | AC | 69 ms
50,620 KB |
testcase_11 | AC | 70 ms
50,604 KB |
testcase_12 | AC | 69 ms
50,700 KB |
testcase_13 | AC | 68 ms
50,632 KB |
testcase_14 | AC | 69 ms
50,724 KB |
testcase_15 | AC | 71 ms
50,604 KB |
testcase_16 | AC | 207 ms
62,412 KB |
testcase_17 | AC | 205 ms
62,544 KB |
testcase_18 | AC | 207 ms
63,004 KB |
testcase_19 | AC | 220 ms
62,388 KB |
testcase_20 | AC | 211 ms
62,900 KB |
testcase_21 | AC | 204 ms
62,524 KB |
testcase_22 | AC | 222 ms
62,528 KB |
testcase_23 | AC | 203 ms
61,220 KB |
testcase_24 | AC | 210 ms
62,612 KB |
testcase_25 | AC | 208 ms
62,672 KB |
testcase_26 | AC | 221 ms
62,148 KB |
testcase_27 | AC | 219 ms
62,108 KB |
testcase_28 | AC | 207 ms
62,752 KB |
testcase_29 | AC | 223 ms
62,656 KB |
testcase_30 | AC | 209 ms
62,648 KB |
testcase_31 | AC | 203 ms
62,660 KB |
testcase_32 | AC | 205 ms
62,524 KB |
testcase_33 | AC | 220 ms
62,332 KB |
testcase_34 | AC | 204 ms
62,128 KB |
ソースコード
public class Main { private static void solve() { char[] n = ns(); long mod = 0; for (char c : n) { long x = c - '0'; mod *= 4; mod += x; mod %= 15; } if (mod == 0) { System.out.println("FizzBuzz"); } else if (mod % 3 == 0) { System.out.println("Fizz"); } else if (mod % 5 == 0) { System.out.println("Buzz"); } else { System.out.println(n); } } 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)); } }