public static void main(String[] args) {
		int[] digits = {0,1,2,3,4,5,6,7,8,9};
		T t = new T();
		
		long biggest = 0;
		int count = 0;
		do {
			if (digits[0] == 0)
				continue;
			if (++count % 100000 == 0) {
				System.out.println(count + "/"+3628800);
				System.out.println("Current biggest: "+biggest + " " + t);
			}
			
			for (long[] candidate : getCandidates(digits)) {
				long scalar = candidate[0];
				StringBuilder sb = new StringBuilder();
				for (int i = 1; i < candidate.length; i++) {
					sb.append(""+scalar*candidate[i]);
				}
				if (isPandigital(sb.toString())) {
					long pandigital = Long.parseLong(sb.toString());
					if (pandigital > biggest) {
						System.out.println(Arrays.toString(digits));
						biggest = pandigital;
						System.out.println(pandigital);
					}
				}
			}
		} while(Euler.permute(digits, digits.length));
		System.out.println(biggest + " "+t);
		
	}