project Eulert 学习笔记 之 problem 8
来源:互联网 发布:标准件网络销售如何做? 编辑:程序博客网 时间:2024/06/02 05:23
The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
题目很简单,求出给的这个千位数中哪13个连续的数的乘积是最大的,是多少?
给出解决方案:
number = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"
numlist=[int( number[item: item+1] ) for item in range(0, len(number), 1)] //数字转换为数组
xx = 0
for i in range(-1,986,1):
x = numlist[i+1] * numlist[i+2] * numlist[i+3] * numlist[i+4] * numlist[i+5] * numlist[i+6] * numlist[i+7] * numlist[i+8] * numlist[i+9] * numlist[i+10] * numlist[i+11] * numlist[i+12] * numlist[i+13]
if xx < x :
xx = x
print(xx)
思路很简单:先将这个千位数定义为str字符,然后将其分组,接着从第一位开始计算积,遍历,用大的替代小的,直到结束。
- project Eulert 学习笔记 之 problem 8
- project Eulert 学习笔记 之 problem 29
- project Eulert 学习笔记 之 problem 25
- project Eulert 学习笔记 之 problem 22
- Maven POM学习笔记之<Project>元素
- Project Euler - Problem 8
- Project Euler problem 8
- project Euler problem 8
- Project Euler:Problem 8
- Project-taobao 学习笔记
- castle project 学习笔记1
- 【安卓学习之常见问题】 使用Eclipse clean时,出现“cleaning all project has encountered a problem”提示
- 学习C#之First Project
- Dynamic Web Project 的学习笔记
- Dynamic Web Project 项目学习笔记
- Dynamic Web Project 的学习笔记
- InstallShield2010 Basic MSI Project 学习笔记
- Dynamic Web Project 的学习笔记
- 论文阅读《Spatiotemporal Multiplier Networks for Video Action Recognition》
- Android开发之版本统一规范
- js算法一则:不用if。。while。。for等循环和判断语句实现1+2+3+...+n的和
- 开源的excel读取库libxls在windows下的编译,且支持中文,全网首发
- Linux是什么
- project Eulert 学习笔记 之 problem 8
- Java进阶(十三)详解equals()方法
- Oracle SQL语句 on和where having的区别
- 定时器的应用
- Powerbuilder调用Webservice的两种方法
- 数据库基本语句
- 欢迎使用CSDN-markdown编辑器
- QEMU 简单几步搭建一个虚拟的ARM开发板
- STM32的优先级NVIC_PriorityGroupConfig的理解及其使用