<commit_before>{-
Find the greatest product of five consecutive digits in the 1000-digit number.
-}

import Data.Char

digits_str = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"
window_size = 5

--issue: types

-- TODO: /0
calc_max_digit_prod :: (Fractional a, Eq a) => [a] -> a -> [a]
calc_max_digit_prod digits last_prod
	| length digits == window_size = [product digits]
	| otherwise =
		curr_prod
		:
		calc_max_digit_prod
			(tail digits)
			curr_prod
			where curr_prod = case head digits of
				0 -> product $ take
					window_size
					$ tail digits
				_ -> ((last_prod / (head digits)) * curr_digit)
				where curr_digit = digits !! window_size

digits = map fromIntegral $ map digitToInt digits_str
prods = calc_max_digit_prod digits initial_sum
	where initial_sum = product $ take window_size digits

sought = maximum prods<commit_msg>Cleaned up 8.<commit_after>{-
Find the greatest product of five consecutive digits in the 1000-digit number.
-}

import Data.Char

digits_str = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"
window_size = 5

calc_max_digit_prod :: (Fractional a, Eq a) => [a] -> a -> [a]
calc_max_digit_prod digits last_prod
	| length digits == window_size = [product digits]
	| otherwise =
		curr_prod
		:
		calc_max_digit_prod
			(tail digits)
			curr_prod
			where curr_prod = case head digits of
				0 -> product $ take
					window_size
					$ tail digits
				_ -> ((last_prod / (head digits)) * curr_digit)
				where curr_digit = digits !! window_size

digits :: [Double]
digits = map fromIntegral $ map digitToInt digits_str

prods :: [Double]
prods = calc_max_digit_prod digits initial_sum
	where initial_sum = product $ take window_size digits

main = do
	(putStrLn . show) $ maximum prods
{'fraction_non_alphanumeric': 0.04065934065934066, 'fraction_numerical': 0.5532967032967033, 'mean_word_length': 9.256338028169013, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 13, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6568339', 'n_tokens_mistral': 2641, 'n_tokens_neox': 1399, 'n_words': 172}