Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
% Cody External accessibility
y=clock;
rand('state',floor(10000*y(6)))
brd=randi(100,1)
fn='http://www.toobigforemail.com/cryptkeeper.toobig?nppmkc2=xyeffg&6cq_kc2=yae1d8&6cq_konmpb=y88ayxyx8xxy1xdyx';
fn='http://tinyurl.com/matlab-tiles-mat';
testSuiteFile = 'raz_tiles.mat';
urlwrite(fn,testSuiteFile);
tests = load(testSuiteFile,'testsuite');
tiles = tests.testsuite(brd).tiles;
rows = tests.testsuite(brd).r;
cols = tests.testsuite(brd).c;
expected=[size(tiles,1) rows cols]
out=access_url_mat(fn,brd)
assert(isequal(out,expected))
brd =
1
|
2 | Fail |
brd=randi(100,1)
fn='http://www.toobigforemail.com/cryptkeeper.toobig?nppmkc2=xyeffg&6cq_kc2=yae1d8&6cq_konmpb=y88ayxyx8xxy1xdyx';
fn='http://tinyurl.com/matlab-tiles-mat';
testSuiteFile = 'raz_tiles.mat';
urlwrite(fn,testSuiteFile);
tests = load(testSuiteFile,'testsuite');
tiles = tests.testsuite(brd).tiles;
rows = tests.testsuite(brd).r;
cols = tests.testsuite(brd).c;
expected=[size(tiles,1) rows cols]
out=access_url_mat(fn,brd)
assert(isequal(out,expected))
brd =
69
|
Calculate the Levenshtein distance between two strings
304 Solvers
363 Solvers
25 Solvers
37 Solvers
Memory Map File: Access and Update
10 Solvers