Created
April 14, 2017 15:30
-
-
Save LuxXx/4e64e1009647ec4e4a7d47eeb33f6db7 to your computer and use it in GitHub Desktop.
Project Euler - Problem 8
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package euler; | |
import java.util.Comparator; | |
import java.util.PriorityQueue; | |
public class AdjacentDigits { | |
private static String n = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"; | |
private static int n(int i) { | |
return n.charAt(i) - 48; | |
} | |
public static void main(String[] args) { | |
PriorityQueue<Long> q = new PriorityQueue<>(new Comparator<Long>() { | |
@Override | |
public int compare(Long o1, Long o2) { | |
if (o1.longValue() == o2.longValue()) return 0; | |
return (o1.longValue() < o2.longValue() ? 1 : -1); | |
} | |
}); | |
for (int i = 0; i < n.length() - 13 - 1; i++) { | |
int[] series = new int[13]; | |
for (int j = 0; j < 13; j++) { | |
series[j] = n(i+j); | |
} | |
long p = 1; | |
for (int j = 0; j < series.length; j++) { | |
p *= series[j]; | |
} | |
q.add(p); | |
} | |
System.out.println(q.peek()); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment