problem8 finds the 'n' adjacent digits in the 1000-digit number that
have the greatest product
problem8(digits)
| digits | Max number of digits to compute |
|---|
The expected value
This function has the following complexity O($n^2$)
https://projecteuler.net/problem=8 for more info about it
problem8(2)#> Error: '../data/problem_8.txt' does not exist in current working directory ('/home/farm/Documents/project-euler/src/r/docs/reference').problem8(4)#> Error: '../data/problem_8.txt' does not exist in current working directory ('/home/farm/Documents/project-euler/src/r/docs/reference').problem8(13)#> Error: '../data/problem_8.txt' does not exist in current working directory ('/home/farm/Documents/project-euler/src/r/docs/reference').