Cody

# Problem 42914. Counting the Grand Primes

Solution 1495024

Submitted on 16 Apr 2018
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   Fail
N = 1000; y_correct = 0; assert(isequal(grandPrimeCounter(N),y_correct))

Undefined function or variable 'rlo'. Error in grandPrimeCounter (line 3) hi = round(uint64(rlo + 1000)); Error in Test1 (line 3) assert(isequal(grandPrimeCounter(N),y_correct))

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

Undefined function or variable 'rlo'. Error in grandPrimeCounter (line 3) hi = round(uint64(rlo + 1000)); Error in Test2 (line 3) assert(isequal(grandPrimeCounter(N),y_correct))

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

Undefined function or variable 'rlo'. Error in grandPrimeCounter (line 3) hi = round(uint64(rlo + 1000)); Error in Test3 (line 3) assert(isequal(grandPrimeCounter(N),y_correct))

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

Undefined function or variable 'rlo'. Error in grandPrimeCounter (line 3) hi = round(uint64(rlo + 1000)); Error in Test4 (line 3) assert(isequal(grandPrimeCounter(N),y_correct))

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

Undefined function or variable 'rlo'. Error in grandPrimeCounter (line 3) hi = round(uint64(rlo + 1000)); Error in Test5 (line 3) assert(isequal(grandPrimeCounter(N),y_correct))

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

Undefined function or variable 'rlo'. Error in grandPrimeCounter (line 3) hi = round(uint64(rlo + 1000)); Error in Test6 (line 3) assert(isequal(grandPrimeCounter(N),y_correct))