結果

問題 No.316 もっと刺激的なFizzBuzzをください
ユーザー yuya178yuya178
提出日時 2017-09-21 19:12:57
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,639 bytes
コンパイル時間 2,668 ms
コンパイル使用メモリ 86,704 KB
実行使用メモリ 38,072 KB
最終ジャッジ日時 2024-11-08 19:32:59
合計ジャッジ時間 6,391 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
37,860 KB
testcase_01 AC 69 ms
37,960 KB
testcase_02 WA -
testcase_03 AC 68 ms
37,584 KB
testcase_04 AC 72 ms
37,664 KB
testcase_05 AC 68 ms
37,760 KB
testcase_06 AC 71 ms
37,812 KB
testcase_07 AC 69 ms
37,860 KB
testcase_08 AC 66 ms
37,676 KB
testcase_09 AC 70 ms
37,780 KB
testcase_10 AC 70 ms
37,584 KB
testcase_11 AC 69 ms
37,768 KB
testcase_12 AC 70 ms
37,872 KB
testcase_13 AC 72 ms
37,632 KB
testcase_14 AC 69 ms
37,860 KB
testcase_15 AC 69 ms
37,604 KB
testcase_16 AC 69 ms
37,548 KB
testcase_17 AC 68 ms
37,500 KB
testcase_18 AC 70 ms
37,528 KB
testcase_19 AC 79 ms
38,008 KB
testcase_20 AC 71 ms
37,984 KB
testcase_21 AC 72 ms
38,056 KB
testcase_22 AC 69 ms
37,740 KB
testcase_23 AC 70 ms
37,652 KB
testcase_24 AC 69 ms
37,924 KB
testcase_25 AC 67 ms
37,724 KB
testcase_26 AC 75 ms
37,656 KB
testcase_27 AC 71 ms
37,988 KB
testcase_28 AC 68 ms
37,700 KB
testcase_29 AC 69 ms
38,072 KB
testcase_30 AC 70 ms
37,496 KB
testcase_31 AC 67 ms
37,604 KB
testcase_32 AC 69 ms
37,780 KB
testcase_33 AC 71 ms
37,876 KB
testcase_34 AC 69 ms
37,560 KB
testcase_35 AC 71 ms
37,628 KB
testcase_36 AC 69 ms
37,712 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
 
public class Main {
    static InputStream is;
    static PrintWriter out;
    static String INPUT = "";
    
    static void solve()
    {
        int N = ni();
        int a = ni();
        int b = ni();
        int c = ni();

        long d = lcm(a,b);
        long e = lcm(b,c);
        long f = lcm(c,a);
        long g = lcm(d,e);

        long res = N/a+N/b+N/c-N/d-N/e-N/f+N/g;

        out.println(res);

    }
    private static long gcd(long m, long n) {
            if(m < n) return gcd(n, m);
            if(n == 0) return m;
            return gcd(n, m % n);
        }
    private static long lcm(long m, long n) {
            return m * (n /gcd(m, n));
    }
    
    public static void main(String[] args) throws Exception
    {
        long S = System.currentTimeMillis();
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        solve();
        out.flush();
        long G = System.currentTimeMillis();
        tr(G-S+"ms");
    }
    
    private static boolean eof()
    {
        if(lenbuf == -1)return true;
        int lptr = ptrbuf;
        while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
        
        try {
            is.mark(1000);
            while(true){
                int b = is.read();
                if(b == -1){
                    is.reset();
                    return true;
                }else if(!isSpaceChar(b)){
                    is.reset();
                    return false;
                }
            }
        } catch (IOException e) {
            return true;
        }
    }
    
    private static byte[] inbuf = new byte[1024];
    static int lenbuf = 0, ptrbuf = 0;
    
    private static int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
//  private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
    private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private static double nd() { return Double.parseDouble(ns()); }
    private static char nc() { return (char)skip(); }
    
    private static String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private static char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private static char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    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 int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0