1
0
www.mikescher.com/www/statics/euler/Euler_Problem-014_explanation.md

1 line
107 B
Markdown
Raw Permalink Normal View History

2017-11-08 17:39:50 +01:00
Again a simple problem, we get the length of every sequence (= until they reach `1`) and print the highest.