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 |
filetext = fileread('divisible_by_3.m');
assert(isempty(strfind(filetext, '*')),'* forbidden')
assert(isempty(strfind(filetext, 'mtimes')),'mtimes() forbidden')
assert(isempty(strfind(filetext, 'cross')),'cross() forbidden')
assert(isempty(strfind(filetext, 'prod')),'prod() forbidden')
assert(isempty(strfind(filetext, 'cumprod')),'cumprod() forbidden')
assert(isempty(strfind(filetext, 'times')),'times() forbidden')
assert(isempty(strfind(filetext, 'mldivide')),'mldivide() forbidden')
assert(isempty(strfind(filetext, 'mrdivide')),'mrdivide() forbidden')
assert(isempty(strfind(filetext, '/')),'/ forbidden')
assert(isempty(strfind(filetext, '\')),'\ forbidden')
assert(isempty(strfind(filetext, '^')),'^ forbidden')
assert(isempty(strfind(filetext, 'dot')),'dot() forbidden')
assert(isempty(strfind(filetext, 'rem')),'rem() forbidden')
assert(isempty(strfind(filetext, 'mod')),'mod() forbidden')
assert(isempty(strfind(filetext, 'round')),'round() forbidden')
assert(isempty(strfind(filetext, 'ceil')),'ceil() forbidden')
assert(isempty(strfind(filetext, 'floor')),'floor() forbidden')
assert(isempty(strfind(filetext, 'java')),'java forbidden')
|
2 | Pass |
n_str = '12';
assert(isequal(divisible_by_3(n_str),1))
a =
3
out =
3
tf =
logical
1
|
3 | Pass |
n_str = '13';
assert(isequal(divisible_by_3(n_str),0))
a =
4
out =
4
tf =
logical
0
|
4 | Pass |
n_str = '222';
assert(isequal(divisible_by_3(n_str),1))
a =
6
out =
6
tf =
logical
1
|
5 | Pass |
n_str = '232';
assert(isequal(divisible_by_3(n_str),0))
a =
7
out =
7
tf =
logical
0
|
6 | Pass |
n_str = '223';
assert(isequal(divisible_by_3(n_str),0))
a =
7
out =
7
tf =
logical
0
|
7 | Pass |
n_str = '1236127';
assert(isequal(divisible_by_3(n_str),0))
a =
22
a =
4
out =
4
tf =
logical
0
|
8 | Pass |
n_str = '123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890';
assert(isequal(divisible_by_3(n_str),1))
a =
810
a =
9
out =
9
tf =
logical
1
|
9 | Pass |
n_str = '1234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901';
assert(isequal(divisible_by_3(n_str),0))
a =
811
a =
10
a =
1
out =
1
tf =
logical
0
|
10 | Pass |
n_str = '123678900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000';
assert(isequal(divisible_by_3(n_str),1))
a =
36
a =
9
out =
9
tf =
logical
1
|
11 | Pass |
n_str = '123678900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001';
assert(isequal(divisible_by_3(n_str),0))
a =
37
a =
10
a =
1
out =
1
tf =
logical
0
|
12 | Pass |
n_str = '3141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342117067982148086513282306647093844609550582231725359408128481117450284102701938521105559644622948954930381964428810975665933446128475648233786783165271201909145648566923460348610454326648213393607260249141273724587006606315588174881520920962829254091715364367892590360011330530548820466521384146951941511609433057270365759591953092186117381932611793105118548074462379962749567351885752724891227938183011949129833673362440656643086021394946395224737190702179860943702770539217176293176752384674818467669405132000568127145263560827785771342757789609173637178721468440901224953430146549585371050792279689258923542019956112129021960864034418159813629774771309960518707211349999998372978049951059731732816096318595024459455346908302642522308253344685035261931188171010003137838752886587533208381420617177669147303598253490428755468731159562863882353787593751957781857780532171226806613001927876611195909216420198938095257201065485863278865936153381827968230301952035301852968995773622599413891249721775283479131515574857242454150695950829533116861727855889075098381754637464939319255060400927701671139009848824012858361603563707660104710181942955596198946767837449448255379774726847104047534646208046684259069491293313677028989152104752162056966024058038150193511253382430035587640247496473263914199272604269922796';
assert(isequal(divisible_by_3(n_str),1))
a =
6306
a =
15
a =
6
out =
6
tf =
logical
1
|
13 | Pass |
n_str = '1010010101011010101001011010100101101010010100101101010011010100101';
assert(isequal(divisible_by_3(n_str),1))
a =
33
a =
6
out =
6
tf =
logical
1
|
14 | Pass |
ind = randi(4);
switch ind
case 1
n_str = '12';
assert(isequal(divisible_by_3(n_str),1))
case 2
n_str = '1234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901';
assert(isequal(divisible_by_3(n_str),0))
case 3
n_str = '123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890';
assert(isequal(divisible_by_3(n_str),1))
case 4
n_str = '1236127';
assert(isequal(divisible_by_3(n_str),0))
end
a =
3
out =
3
tf =
logical
1
|
15 | Pass |
ind = randi(4);
switch ind
case 1
n_str = '1010010101011010101001011010100101101010010100101101010011010100101';
assert(isequal(divisible_by_3(n_str),1))
case 2
n_str = '12';
assert(isequal(divisible_by_3(n_str),1))
case 3
n_str = '123678900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001';
assert(isequal(divisible_by_3(n_str),0))
case 4
n_str = '13';
assert(isequal(divisible_by_3(n_str),0))
end
a =
33
a =
6
out =
6
tf =
logical
1
|
16 | Pass |
ind = randi(4);
switch ind
case 1
n_str = '13';
assert(isequal(divisible_by_3(n_str),0))
case 2
n_str = '123678900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000';
assert(isequal(divisible_by_3(n_str),1))
case 3
n_str = '123678900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001';
assert(isequal(divisible_by_3(n_str),0))
case 4
n_str = '123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890';
assert(isequal(divisible_by_3(n_str),1))
end
a =
37
a =
10
a =
1
out =
1
tf =
logical
0
|
2726 Solvers
Arrange Vector in descending order
1806 Solvers
07 - Common functions and indexing 2
255 Solvers
171 Solvers
327 Solvers