We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Here is the output from my test using the ProjectEuler Problem 149. I got the problem correct but I took the spoiler out of the following output:
-393027 86613
time in milliseconds = 243
Press any key to continue . . .
The first two numbers are a check of the lagged Fibonacci generator namely s[10] and s[100]. The blank line is where the correct output was taken from the output display.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #149: Searching for a maximum-sum subsequence.
You are viewing a single comment's thread. Return to all comments →
Here is the output from my test using the ProjectEuler Problem 149. I got the problem correct but I took the spoiler out of the following output:
-393027 86613
time in milliseconds = 243 Press any key to continue . . .
The first two numbers are a check of the lagged Fibonacci generator namely s[10] and s[100]. The blank line is where the correct output was taken from the output display.