探索算法的極致，鍛煉邏輯的深度。Z2集訓(xùn)隊的小伙伴們，寒假刷題計劃現(xiàn)已進(jìn)入高潮階段。

接下來，讓我們一起查看“Z2集訓(xùn)隊寒假刷題計劃-歐拉計劃標(biāo)程【一】”。

Z2集訓(xùn)隊寒假刷題計劃-歐拉計劃題目標(biāo)程【一】

第001-020題標(biāo)程：

001題? ?3或5的倍數(shù)

(multiples of 3 and 5)

002題? ?偶數(shù)斐波那契數(shù)

(even Fibonacci numbers)

003題? ?最大質(zhì)因數(shù)

(largest prime factor)

004題? ?最大回文數(shù)乘積

(largest palindrome product)

005題? ?最小公倍數(shù)

(smallest multiple)

006題? ?和的平方與平方的和之間的差值

(Sum square difference)

標(biāo)程①

標(biāo)程②

007題? ?第10001個質(zhì)數(shù)

(10001st?prime)

008題? ?序列中的最大乘積

(Largest product in a series)

附：string s = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450";

009題? ?特殊的畢達(dá)哥拉斯三元數(shù)

(Special Pythagorean triplet)

標(biāo)程①

標(biāo)程②

010題? ?質(zhì)數(shù)的和

(Summation of primes)

標(biāo)程①

標(biāo)程②

011題? ?網(wǎng)格中的最大乘積

(largest product in a grid)

012題? ?多約數(shù)的三角形數(shù)

(highly divisible triangular number)

013題? ?大數(shù)之和

(large sum)

014題? ?最長考拉茲序列

(Longest Collatz sequence)

015題? ?網(wǎng)格路徑

(lattice paths)

016題? ?冪的數(shù)字和

(power digit sum)

017題? ?表達(dá)數(shù)字的英文字母計數(shù)

(number letter counts)

018題? ?最大路徑和

(maximum path sum I)

019題? ?周日計數(shù)

(counting Sundays)

020題? ?階乘數(shù)字和

(factorial digit sum)