Cody

Steve Eddins

600
Rank
12
Badges
1834
Score
51 – 100 of 188

Steve Eddins received Indexing V Master badge

on 23 Oct 2020

Steve Eddins received Project Euler I Master badge

on 15 Oct 2020

Steve Eddins submitted a Comment to Problem 250. Project Euler: Problem 10, Sum of Primes

As suggested by David Verrelli on 15-Dec-2017, I have edited the problem statement to reconcile it with the test suite. For everyone's reference, the original problem statement was: The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below the input, N. But that problem statement didn't match one of the test suite cases. Since I didn't change the test suite, the solutions did not need to be rescored.

on 15 Oct 2020

Steve Eddins received Likeable badge for Problem 262. Swap the input arguments

on 15 Jan 2020

Steve Eddins submitted a Comment to Solution 347969

Alex, the tenth case case is false because there are only seven queens on the board.

on 1 Sep 2015

Steve Eddins submitted a Comment to Solution 111016

Hey guys ... Don't worry, I'm not going to mess with you by adding new test cases that are subject floating-point round-off error. This will be in interesting point to discuss when I post a follow-up on my blog.

on 13 Jul 2012

Steve Eddins submitted a Comment to Problem 820. Eliminate unnecessary polygon vertices

This is the second time I've gotten up in the middle of the night to try to fix this. ;-) In my previous attempt to fix test case 7, I was fooled by the diagram I drew. I've modified test case 7 again. When I run your latest solution, Cris, it passes. We'll see what happens when the solutions all get rescored again.

on 10 Jul 2012

Steve Eddins submitted a Comment to Problem 820. Eliminate unnecessary polygon vertices

Thanks, Richard. I have updated test case 7, and the solutions are being rescored.

on 10 Jul 2012

51 – 100 of 188