Problem 8:Largest product in a series

题目描述：

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

73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450

代码：

nums="73167176531330624919225119674426574742355349194934\96983520312774506326239578318016984801869478851843\85861560789112949495459501737958331952853208805511\12540698747158523863050715693290963295227443043557\66896648950445244523161731856403098711121722383113\62229893423380308135336276614282806444486645238749\30358907296290491560440772390713810515859307960866\70172427121883998797908792274921901699720888093776\65727333001053367881220235421809751254540594752243\52584907711670556013604839586446706324415722155397\53697817977846174064955149290862569321978468622482\83972241375657056057490261407972968652414535100474\82166370484403199890008895243450658541227588666881\16427171479924442928230863465674813919123162824586\17866458359124566529476545682848912883142607690042\24219022671055626321111109370544217506941658960408\07198403850962455444362981230987879927244284909188\84580156166097919133875499200524063689912560717606\05886116467109405077541002256983155200055935729725\71636269561882670428252483600823257530420752963450"maxNum=0  for i in range(len(nums)-4):      temp=int(nums[i])*int(nums[i+1])*int(nums[i+2])*int(nums[i+3])*int(nums[i+4])      if temp>maxNum:          maxNum=temp  print maxNum 




                                             
        0        0           
	
				
	
					   
Problem 8:Largest product in a series
	  	   
Problem 8:Largest product in a series
	  	   
Problem 8:Largest product in a series
	  	   
Problem 8 Largest product in a series
	  	   
【Project Euler】【Problem 8】Largest product in a series
	  	   
project euler problem 8:Largest product in a series
	  	   
projecteuler---->problem=8----Largest product in a series
	  	   
Problem 8  Largest product in a series (暴力)
	  	   
Project Euler Problem 8: Largest product in a series
	  	   
PE 8 Largest product in a series
	  	   
欧拉计划（8）Largest product in a series
	  	   
8 Largest product in a series - Project Euler
	  	   
project euler 8 Largest product in a series
	  	   
Problem 11:Largest product in a grid
	  	   
Problem 11 Largest product in a grid
	  	   
Project Euler 008 Largest product in a series
	  	   
欧拉项目第8题 Largest product in a series
	  	   
Largest product in a grid（ Project Euler problem 11）
	     		  
	  	   
常用的Android指令和模拟器参数
	  	   
通过实例体会   fork()同时创建多个子进程
	  	   
利用JSP交互式打印表格
	  	   
图论算法  最短时间
	  	   
Java 高新技术（内省）
	  	   
Problem 8:Largest product in a series
	  	   
二进制十进制相互转换
	  	   
CoAP学习笔记1--概述
	  	   
Boost库学习—智能指针Shared_ptr学习01
	  	   
MFC-day01
	  	   
2014年春
	  	   
C++中空类的大小
	  	   
nyoj 94 cigarettes
	  	   
J​a​v​a​ ​类​中​各​成​分​加​载​顺​序​ ​和​ ​内​存​中​的​存​放​位​置