Project Euler にチャレンジ：Problem 2

Problem 1～　Problem 51～

問題一覧(51～)

問題文

Problem 51[素数の桁の置き換え(Prime digit replacements)]

Problem 52[置換倍数(Permuted multiples)]

Problem 53[組み合わせ問題(Combinatoric selections)]

Problem 54[ポーカーの役問題(Poker hands)]

Problem 55[リクレル数(Lychrel numbers)]

Problem 56[乗数数の桁の合計(Powerful digit sum)]

Problem 57[平方根の収束(Square root convergents)]

Problem 58[うずまき素数(Spiral primes)]

Problem 59[XOR(排他的論理和)の復号化(XOR decryption)]

Problem 60[素数のペア(Prime pair sets)]

Problem 61[周期的な角数(Cyclical figurate numbers)]

Problem 62[3乗の順列(Cubic permutations)]

Problem 63[べき乗数の桁数の個数(Powerful digit counts)]

Problem 64[奇数周期の平方根(Odd period square roots)]

Problem 65[e の収束(Convergents of e)]

Problem 66[ディオファントス方程式(Diophantine equation)]

Problem 67(経路の最大の合計その２[Maximum path sum II])

Problem 68([Magic 5-gon ring])

Problem 69( 互いに素の最大値 [Totient maximum])

Problem 70( 互いに素の並び替え [Totient permutation])

Problem 71( 順序付き分数 [Ordered fractions])

Problem 72( 分数を数える [Counting fractions])

Problem 73( 範囲内の分数を数える [Counting fractions in a range])

Problem 74 桁の階乗チェーン( [Digit Factorial Chains])

Problem 75 一通りの整数の直角三角形( [Singular Integer Right Triangles])

Problem 76 和の種類のカウント(Counting Summations)

Problem 77 素数の和の種類のカウント(Counting Summations)

Problem 78 [コインの山分け(Coin Partitions)]

Problem 79 [パスコードの導出(Passcode Derivation)]

Problem 80 (平方根10進展開[Square Root Digital Expansion])

Problem 81(経路の和 :二つの方向[Path Sum: Two Ways])

Problem 82 経路の和:３方向 [Path Sum: Three Ways])

Problem 83 経路の和:４方向 [Path Sum: Four Ways])

(C) めい