1 files changed, 36 insertions, 0 deletions
diff --git a/mat/euler/8/prog.py b/mat/euler/8/prog.py
new file mode 100755
index 0000000..b22756c
--- /dev/null
+++ b/mat/euler/8/prog.py
@@ -0,0 +1,36 @@
+#!/usr/bin/env python3
+"""
+To ni moj program. To je program helpful sošolca, s pomočjo katerega sem izvedel, da 23 milijard velika številka NE paše v unsigned int.
+"""
+problem = """The four adjacent numbers in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.
+
+7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450
+
+Find the thirteen adjacent list in the 1000-digit number that have the greatest product. What is the value of this product?"""
+
+Process = """
+1. """
+
+num = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"
+
+y = list(num)
+
+def Multi(k) :  
+	f = [int(n) for n in k]
+	prod = 1
+	for a in f : 
+		prod =  prod * a 
+	return prod
+
+def productFinder (z) :
+	max_product  = 0
+	for n in range (987) :
+		subset = z[n : n + 13]
+		product = Multi(subset)		
+		if product > max_product :
+			print(subset)
+			max_product = product
+	return max_product
+
+
+print(productFinder(y))