Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
user_solution = fileread('dots_in_circle.m');
assert(isempty(strfind(user_solution,'regexp')));
assert(isempty(strfind(user_solution,'2str')));
assert(isempty(strfind(user_solution,'str2')));
assert(isempty(strfind(user_solution,'interp')));
assert(isempty(strfind(user_solution,'printf')));
assert(isempty(strfind(user_solution,'assert')));
|
2 | Pass |
%%
r = 0;
n_correct = 1;
assert(isequal(dots_in_circle(r),n_correct))
p =
0
n =
0
|
3 | Pass |
%%
r = 1;
n_correct = 5;
assert(isequal(dots_in_circle(r),n_correct))
p =
1
n =
0
|
4 | Pass |
%%
r = 2;
n_correct = 13;
assert(isequal(dots_in_circle(r),n_correct))
p =
2
n =
0
|
5 | Pass |
%%
r = 3;
n_correct = 29;
assert(isequal(dots_in_circle(r),n_correct))
p =
3
n =
0
|
6 | Pass |
%%
r = 4;
n_correct = 49;
assert(isequal(dots_in_circle(r),n_correct))
p =
4
n =
0
|
7 | Pass |
%%
r = 5;
n_correct = 81;
assert(isequal(dots_in_circle(r),n_correct))
p =
5
n =
0
|
8 | Pass |
%%
r = 7.5;
n_correct = 177;
assert(isequal(dots_in_circle(r),n_correct))
p =
8
n =
0
|
9 | Pass |
%%
r = 10;
n_correct = 317;
assert(isequal(dots_in_circle(r),n_correct))
p =
10
n =
0
|
10 | Pass |
%%
r = 20;
n_correct = 1257;
assert(isequal(dots_in_circle(r),n_correct))
p =
20
n =
0
|
11 | Pass |
%%
r = 30;
n_correct = 2821;
assert(isequal(dots_in_circle(r),n_correct))
p =
30
n =
0
|
12 | Pass |
%%
r = 40;
n_correct = 5025;
assert(isequal(dots_in_circle(r),n_correct))
p =
40
n =
0
|
13 | Pass |
%%
r = 50;
n_correct = 7845;
assert(isequal(dots_in_circle(r),n_correct))
p =
50
n =
0
|
14 | Pass |
%%
r = 75;
n_correct = 17665;
assert(isequal(dots_in_circle(r),n_correct))
p =
75
n =
0
|
15 | Pass |
%%
r = 100;
n_correct = 31417;
assert(isequal(dots_in_circle(r),n_correct))
p =
100
n =
0
|
Given an unsigned integer x, find the largest y by rearranging the bits in x
780 Solvers
337 Solvers
Back to basics 23 - Triangular matrix
634 Solvers
Sum the numbers on the main diagonal
453 Solvers
641 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!