This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 0;
y_correct = 1;
assert(isequal(Belln(n),y_correct))
|
2 | Pass |
n = 5;
y_correct = [1 1 2 5 15 52];
assert(isequal(Belln(n),y_correct))
|
3 | Pass |
n = 9;
y_correct = [1 1 2 5 15 52 203 877 4140 21147];
assert(isequal(Belln(n),y_correct))
|
Project Euler: Problem 8, Find largest product in a large string of numbers
315 Solvers
Find best placement for ordered dominoes (harder)
205 Solvers
246 Solvers
242 Solvers
248 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!