Project Euler - Problem 41

euler.java

package euler;

public class Pandigital {
	public static void main(String[] args) {
		int n = 1_000_000_000;

        // initially assume all integers are prime
        boolean[] isPrime = new boolean[n+1];
        for (int i = 2; i <= n; i++) {
            isPrime[i] = true;
        }

        for (int factor = 2; factor*factor <= n; factor++) {

            // if factor is prime, then mark multiples of factor as non-prime
            // suffices to consider multiples factor, factor+1, ...,  n/factor
            if (isPrime[factor]) {
                for (int j = factor; factor*j <= n; j++) {
                    isPrime[factor*j] = false;
                }
            }
        }
        
        for (int i = 0; i < isPrime.length; i++) {
			if (isPrime[i] && isPandigital(String.valueOf(i)))
				System.out.println(i);
		}
        
	}
	public static boolean isPandigital(String s) {
		for (int i = 1; i <= s.length(); i++) {
			if (!s.contains(String.valueOf(i))) {
				return false;
			}
		}
		return true;
	}
}