結果

問題 No.316 もっと刺激的なFizzBuzzをください
ユーザー threepipes_s
提出日時 2015-12-09 00:42:28
言語 Java
(openjdk 23)
結果
AC  
実行時間 59 ms / 1,000 ms
コード長 2,627 bytes
コンパイル時間 2,407 ms
コンパイル使用メモリ 79,648 KB
実行使用メモリ 37,184 KB
最終ジャッジ日時 2024-11-21 11:23:51
合計ジャッジ時間 5,738 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
 
public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {Solve solve = new Solve();solve.solve();}
}
class Solve{
	void solve() throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		Writer out = new Writer();
		int n = in.nextInt();
		long[] a = new long[3];
		long res = 0;
		for(int i=0; i<3; i++) a[i] = in.nextLong();
		for(int i=1; i<1<<3; i++){
			long tmp = 1;
			for(int j=0; j<3; j++){
				if((i&1<<j)==0) continue;
				tmp = lcm(tmp, a[j]);
			}
			res += n/tmp*(Integer.bitCount(i)%2==0?-1:1);
		}
		System.out.println(res);
	}
	
	static long gcd(long a, long b){
		return b == 0 ? a : gcd(b, a % b);
	}

	// 最小公倍数
	static long lcm(long a, long b){
		return a * b / gcd(a, b);
	}
}
 
class MultiSet<T> extends HashMap<T, Integer>{
	@Override
	public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
}
class Timer{
	long time;
	public void set(){time = System.currentTimeMillis();}
	public long stop(){return System.currentTimeMillis()-time;}
}
class Writer extends PrintWriter{
	public Writer(String filename) throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer() throws IOException{super(System.out);}
}
class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException 
	{reader = new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename) throws FileNotFoundException
	{reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	public String readLine() throws IOException{return reader.readLine();}
	public long nextLong() throws IOException, NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt() throws NumberFormatException, IOException
	{return (int) nextLong();}
	public double nextDouble() throws NumberFormatException, IOException 
	{return Double.parseDouble(nextToken());}
}
0