もんセレクション

各位の数字の和を求めるメソッドをテスト駆動開発する（Project Euler 問20）

今回の問題 Factorial digit sum n! means n × (n − 1) × … × 3 × 2 × 1 For example, 10! = 10 × 9 × … × 3 × […]

今回の問題 Counting Sundays You are given the following information, but you may prefer to do some research for you […]

今回の問題 Maximum path sum I By starting at the top of the triangle below and moving to adjacent numbers on the ro […]

今回の問題 Number letter counts If the numbers 1 to 5 are written out in words: one, two, three, four, five, then t […]

今回の問題 Power digit sum 2**15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of th […]

今回の問題 Lattice paths Starting in the top left corner of a 2×2 grid, and only being able to move to the right an […]

今回の問題 Longest Collatz sequence The following iterative sequence is defined for the set of positive integers: n […]

今回の問題 Large sum Work out the first ten digits of the sum of the following one-hundred 50-digit numbers. 以下の50桁 […]

今回の問題 Highly divisible triangular number The sequence of triangle numbers is generated by adding the natural n […]

テスト駆動開発の著者である t-wadaさんこと、和田卓人さんの講演会に行ってきました。前回の【まつもとゆきひろ氏　特別講演】20代エンジニアのためのプログラマー勉強法と同様にエンジニアのみならず若手社会人すべてに通ず […]