Find the Greatest Product of K consecutive digits in the Nth digit Number

Find the Greatest Product of K consecutive digits in the Nth digit Number


Source: Problem(8) of ProjectEuler.net

Python Implementation:

t=int(raw_input()) while(t>0): n,k=map(int,raw_input().split()) s=raw_input() list=[] list1=[] for i in range(len(s)): list.append(s[i]) for i in range(len(list)): mul=ord(list[i])-ord('0') j=i+1 k=i+5 if k<=len(list): for j in range(j,k,1): mul=mul*(ord(list[j]-ord('0'))) list1.append(mul) print max(list1) t-=1