Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
N=5;K=3;
assert(isequal(num_sum(N,K),5))
|
2 | Pass |
N=7;K=4;
assert(isequal(num_sum(N,K),11))
|
3 | Pass |
N=7;K=3;
assert(isequal(num_sum(N,K),8))
|
4 | Pass |
N=15;K=6;
assert(isequal(num_sum(N,K),110))
|
5 | Pass |
N=20;K=4;
assert(isequal(num_sum(N,K),108))
|
6 | Pass |
N=12;K=9;
assert(isequal(num_sum(N,K),73))
|
7 | Pass |
N=13;K=3;
assert(isequal(num_sum(N,K),21))
|
8 | Pass |
N=12;K=2;
assert(isequal(num_sum(N,K),7))
|
9 | Pass |
N=15;K=2;
assert(isequal(num_sum(N,K),8))
|
3875 Solvers
Project Euler: Problem 7, Nth prime
339 Solvers
169 Solvers
137 Solvers
Longest run of consecutive numbers
191 Solvers