zoukankan      html  css  js  c++  java
  • projecteuler---->problem=8----Largest product in a series

    title:

    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位数的积,使其最大

    a="73167176531330624919225119674426574742355349194934"
    a1="96983520312774506326239578318016984801869478851843"
    a2="85861560789112949495459501737958331952853208805511"
    a3="12540698747158523863050715693290963295227443043557"
    a4="66896648950445244523161731856403098711121722383113"
    a5="62229893423380308135336276614282806444486645238749"
    a6="30358907296290491560440772390713810515859307960866"
    a7="70172427121883998797908792274921901699720888093776"
    a8="65727333001053367881220235421809751254540594752243"
    a9="52584907711670556013604839586446706324415722155397"
    a10="53697817977846174064955149290862569321978468622482"
    a11="83972241375657056057490261407972968652414535100474"
    a12="82166370484403199890008895243450658541227588666881"
    a13="16427171479924442928230863465674813919123162824586"
    a14="17866458359124566529476545682848912883142607690042"
    a15="24219022671055626321111109370544217506941658960408"
    a16="07198403850962455444362981230987879927244284909188"
    a17="84580156166097919133875499200524063689912560717606"
    a18="05886116467109405077541002256983155200055935729725"
    a19="71636269561882670428252483600823257530420752963450"
    a=a+a1+a2+a3+a4+a5+a6+a7+a8+a9+a10+a11+a12+a13+a14+a15+a16+a17+a18+a19
    resu=0
    for i in range(0,987):
    	s=1
    	for j in range(13):
    		s*=int(a[i+j]) 
    	if s > resu:
    		resu = s
    print resu



  • 相关阅读:
    excel套模板
    随便写写
    Ajax请求本页
    解除默认asp.net 上传文件大小的限制
    客户端获取mac ip 主机名
    获取客户端Mac
    vue中使用swiper出现Can't resolve 'swiper/dist/css/swiper.css'
    win10 输入法小技巧
    VS Code 编辑器配置备份
    axios报错: Cannot read property 'protocol' of undefined ....
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/5240107.html
Copyright © 2011-2022 走看看