project-euler-100

[RADIOACTIVE] solutions to the first 100 challenges of project euler
git clone git://git.figbert.com/project-euler-100.git
Log | Files | Refs | README

commit d4839fb3bb19dba2a2ab1a9d01b78c54758bbca8
parent 5b2b51069ba1a30fff86139a767cfbfff44b6d27
Author: therealFIGBERT <figbertwelner@gmail.com>
Date:   Sat, 25 Jan 2020 18:40:36 -0800

Add solution to problem 8

Diffstat:
Aproblem008.py | 24++++++++++++++++++++++++
1 file changed, 24 insertions(+), 0 deletions(-)

diff --git a/problem008.py b/problem008.py @@ -0,0 +1,24 @@ +# problemName = "Largest product in a series" +# problemNum = 8 +# solutionBy = "FIGBERT" +# language = "Python" +# dateCompleted = "25/01/2020" +from math import prod + +VAL = 7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450 + +def productOfString(string): + return prod([int(i) for i in string]) + +def findLargestProduct(num): + start, end, strNum = 0, 13, str(num) + largestProduct = 0 + while end <= len(strNum): + if productOfString(strNum[start:end]) > largestProduct: + largestProduct = productOfString(strNum[start:end]) + start += 1 + end += 1 + return largestProduct + +answer = findLargestProduct(VAL) +print(f"The value of the greatest product of thirteen adjacent digits in the provided 1000-digit number is {answer}")