You are viewing a single comment's thread. Return to all comments →
#python import math t = int(input().strip()) for a0 in range(t): n,k = input().strip().split(' ') n,k = [int(n),int(k)] num = input().strip() maximum=0 for x in range(n-k+1): product=math.prod([int(num[i]) for i in range(x, x+k)]) if product>maximum: maximum=product print(maximum)
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #8: Largest product in a series
You are viewing a single comment's thread. Return to all comments →