Cody

Solution 942869

Submitted on 26 Aug 2016 by goc3
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
N = 1000; y_correct = 0; assert(isequal(grandPrimeCounter(N),y_correct))

y = 0

2   Pass
N = 1234; y_correct = 13; assert(isequal(grandPrimeCounter(N),y_correct))

y = 13

3   Pass
N = 12345; y_correct = 280; assert(isequal(grandPrimeCounter(N),y_correct))

y = 280

4   Pass
N = 123456; y_correct = 1925; assert(isequal(grandPrimeCounter(N),y_correct))

y = 1925

5   Pass
N = 1234567; y_correct = 13142; assert(isequal(grandPrimeCounter(N),y_correct))

y = 13142

6   Pass
N = 99999900; y_correct = 586509; assert(isequal(grandPrimeCounter(N),y_correct))

y = 586509