Find the greatest product of five consecutive digits in the 1000-digit number.

1
2
3
4
5
6
7
8
9
10
11

product = int(digits[0]) * int(digits[1]) * int(digits[2]) * 
int(digits[3]) * int(digits[4])
i = 4
while(i < 1000):
	temp = int(digits[i]) * int(digits[i-1]) * int(digits[i-2])
 * int(digits[i-3]) * int(digits[i-4])
	if(temp > product):
		product = temp
	i = i + 1
 
print product

This entry was posted on Monday, July 14th, 2008 at 3:35 pm and is filed under Programming. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.