1
0
www.mikescher.com/www/statics/euler/euler_014_explanation.md
2017-11-08 17:39:51 +01:00

107 B

Again a simple problem, we get the length of every sequence (= until they reach 1) and print the highest.