Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions
dc483ea4fd
www.mikescher.com/www/statics/euler/Euler_Problem-014_explanation.md

107 B
Raw Blame History

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