ZOJ2836 容斥原理

Given a list of integers (A₁, A₂, ..., A_n), and a positive integer M, please find the number of positive integers that are not greater than M and dividable by any integer from the given list.

import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

public class Main {
	public static void main(String[] args) {
		new Task().solve() ; 
	}
}

class Task {
	InputReader in = new InputReader(System.in);
	PrintWriter out = new PrintWriter(System.out);

	void solve() {
		while(in.hasNext()){
			int n = in.nextInt() , m = in.nextInt() ;
			Set<Integer> hash = new HashSet<Integer>() ;
			for(int i = 0 ; i < n ; i++){
				hash.add(in.nextInt()) ;
			}
			n = hash.size() ;
			int[] val = new int[n] ;
			int idx = 0 ;
			for(int v : hash){
			     val[idx++] = v ;	
			}
			int sum = 0 ; 
			int limit = 1<<n ;
			for(int bit = 1 ; bit < limit ; bit++){
				int lcm = 1 , cnt = 0 ;
				for(int i = 0 ; i < n ; i++){
					if((bit & (1 << i)) > 0){
						lcm = lcm(lcm , val[i]) ;
						cnt++ ;
					}
				}
				sum += m / lcm * ((cnt&1) > 0 ? 1 : -1) ; 
			}
			out.println(sum) ;
			//out.flush();
		}
		out.flush();
	}
	
	int gcd(int x , int y){
		return y == 0 ? x : gcd(y , x%y) ;
	}

	int lcm(int x , int y){
		return x / gcd(x , y) * y ;
	}
}

class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream), 32768);
		tokenizer = new StringTokenizer("");
	}

	private void eat(String s) {
		tokenizer = new StringTokenizer(s);
	}

	public String nextLine() {
		try {
			return reader.readLine();
		} catch (Exception e) {
			return null;
		}
	} 

	public boolean hasNext() {
		while (!tokenizer.hasMoreTokens()) {
			String s = nextLine();
			if (s == null)
				return false;
			eat(s);
		}
		return true;
	}

	public String next() {
		hasNext();
		return tokenizer.nextToken();
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}

	public BigInteger nextBigInteger() {
		return new BigInteger(next());
	}

}