結果
問題 | No.316 もっと刺激的なFizzBuzzをください |
ユーザー | wdkkou |
提出日時 | 2019-09-06 16:38:36 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 59 ms / 1,000 ms |
コード長 | 2,955 bytes |
コンパイル時間 | 2,563 ms |
コンパイル使用メモリ | 77,488 KB |
実行使用メモリ | 37,000 KB |
最終ジャッジ日時 | 2024-06-24 00:25:29 |
合計ジャッジ時間 | 5,717 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
36,720 KB |
testcase_01 | AC | 58 ms
36,432 KB |
testcase_02 | AC | 57 ms
36,940 KB |
testcase_03 | AC | 55 ms
36,948 KB |
testcase_04 | AC | 57 ms
36,800 KB |
testcase_05 | AC | 59 ms
36,304 KB |
testcase_06 | AC | 58 ms
36,512 KB |
testcase_07 | AC | 58 ms
36,928 KB |
testcase_08 | AC | 58 ms
36,804 KB |
testcase_09 | AC | 59 ms
36,556 KB |
testcase_10 | AC | 59 ms
36,692 KB |
testcase_11 | AC | 51 ms
36,988 KB |
testcase_12 | AC | 49 ms
36,872 KB |
testcase_13 | AC | 47 ms
36,928 KB |
testcase_14 | AC | 49 ms
36,780 KB |
testcase_15 | AC | 49 ms
36,252 KB |
testcase_16 | AC | 49 ms
36,864 KB |
testcase_17 | AC | 48 ms
36,444 KB |
testcase_18 | AC | 48 ms
36,700 KB |
testcase_19 | AC | 49 ms
36,988 KB |
testcase_20 | AC | 47 ms
36,892 KB |
testcase_21 | AC | 48 ms
36,444 KB |
testcase_22 | AC | 47 ms
36,624 KB |
testcase_23 | AC | 47 ms
36,624 KB |
testcase_24 | AC | 49 ms
37,000 KB |
testcase_25 | AC | 51 ms
36,756 KB |
testcase_26 | AC | 56 ms
36,724 KB |
testcase_27 | AC | 59 ms
36,592 KB |
testcase_28 | AC | 56 ms
36,852 KB |
testcase_29 | AC | 59 ms
36,416 KB |
testcase_30 | AC | 56 ms
36,444 KB |
testcase_31 | AC | 58 ms
36,892 KB |
testcase_32 | AC | 59 ms
36,892 KB |
testcase_33 | AC | 59 ms
36,860 KB |
testcase_34 | AC | 58 ms
36,904 KB |
testcase_35 | AC | 57 ms
36,716 KB |
testcase_36 | AC | 58 ms
36,592 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) { FastScanner sc = new FastScanner(); long n = sc.nextLong(); long a = sc.nextLong(); long b = sc.nextLong(); long c = sc.nextLong(); long ans = n / a + n / b + n / c; ans -= n / lcm(a, b); ans -= n / lcm(b, c); ans -= n / lcm(c, a); ans += n / lcm(a, lcm(b, c)); System.out.println(ans); } public static long lcm(long a, long b) { return a / gcd(a, b) * b; } public static long gcd(long a, long b) { if (b == 0) { return a; } return gcd(b, a % b); } } 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; } public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; 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() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }