Project Euler Problem 8-Largest product in a series
2024-10-08 02:37:20
直接暴力
写完才想到，代码写矬了，扫一遍就出结果了，哪还用我写的这么麻烦
ss = '''73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450'''.split('\n')
nums = []
for ls in ss:
nums = nums+[int(x) for x in ls]
le = len(nums)
st = 12
res = 0
while st < le:
mul = 1
ost = st-12
while ost <= st:
mul *= nums[ost]
ost += 1
if mul > res:
res = mul
st += 1
print res
最新文章
- HTML5和HTML4的主要区别 [转]
- 今天执行grep命令差点把服务器搞崩
- 获取Windows下某进程监听的TCP/UDP端口
- [LintCode] Super Ugly Number 超级丑陋数
- [DFNews] What's coming in EnCase 7.08?
- TinyXML：一个优秀的C++ XML解析器
- [POI 2008]Mafia
- Winfrom皮肤样式的使用
- poj 3268 Silver Cow Party（最短路）
- nginx限制ip请求次数 以及并发次数
- img图片下有个间隙是为什么
- HTML之前端操作div标签布局
- 解决TOC与目录导航冲突问题
- python列表的基础操作
- 阿里云免费SSL证书申请与安装使用（IIS7）
- IdentityServer4【QuickStart】之切换到混合流并且添加API访问
- [译]A NON-TRIVIAL EXAMPLE OF MEDIATR USAGE
- django中的数据库迁移
- SQL Server中锁与事务隔离级别
- sql重复数据的过滤问题