Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = 1;
y_correct = 3;
assert(isequal(Nth_polite(x),y_correct))
|
2 | Pass |
%%
x = 2;
y_correct = 5;
assert(isequal(Nth_polite(x),y_correct))
|
3 | Pass |
%%
x = 4;
y_correct = 7;
assert(isequal(Nth_polite(x),y_correct))
|
4 | Pass |
%%
x = 5;
y_correct = 9;
assert(isequal(Nth_polite(x),y_correct))
|
5 | Pass |
%%
x = 7;
y_correct = 11;
assert(isequal(Nth_polite(x),y_correct))
|
6 | Pass |
%%
x = 11;
y_correct = 15;
assert(isequal(Nth_polite(x),y_correct))
|
7 | Pass |
%%
x = 12;
y_correct = 17;
assert(isequal(Nth_polite(x),y_correct))
|
8 | Pass |
%%
x = 14;
y_correct = 19;
assert(isequal(Nth_polite(x),y_correct))
|
9 | Pass |
%%
x = 19;
y_correct = 24;
assert(isequal(Nth_polite(x),y_correct))
|
10 | Pass |
%%
x = 21;
y_correct = 26;
assert(isequal(Nth_polite(x),y_correct))
|
11 | Pass |
%%
x = 27;
y_correct = 33;
assert(isequal(Nth_polite(x),y_correct))
|
12 | Pass |
%%
x = 64;
y_correct = 71;
assert(isequal(Nth_polite(x),y_correct))
|
13 | Pass |
%%
x = 1e6;
y_correct = x+20;
assert(isequal(Nth_polite(x),y_correct))
|
14 | Pass |
%%
x = 1e7;
y_correct = x+24;
assert(isequal(Nth_polite(x),y_correct))
|
15 | Pass |
%%
x = 999999999;
y_correct = x+30;
assert(isequal(Nth_polite(x),y_correct))
|
1600 Solvers
Calculate the Levenshtein distance between two strings
456 Solvers
1763 Solvers
Project Euler: Problem 3, Largest prime factor
379 Solvers
Vectorize the digits of an Integer
269 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!