Cody

Solution 2019913

Submitted on 14 Nov 2019 at 7:31 by Duy Nguyen
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

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))

count = 0 n = 1

3   Pass
r = 1; n_correct = 5; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 5

4   Pass
r = 2; n_correct = 13; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 13

5   Pass
r = 3; n_correct = 29; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 29

6   Pass
r = 4; n_correct = 49; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 49

7   Pass
r = 5; n_correct = 81; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 81

8   Pass
r = 7.5; n_correct = 177; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 177

9   Pass
r = 10; n_correct = 317; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 317

10   Pass
r = 20; n_correct = 1257; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 1257

11   Pass
r = 30; n_correct = 2821; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 2821

12   Pass
r = 40; n_correct = 5025; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 5025

13   Pass
r = 50; n_correct = 7845; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 7845

14   Pass
r = 75; n_correct = 17665; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 17665

15   Pass
r = 100; n_correct = 31417; assert(isequal(dots_in_circle(r),n_correct))

count = 0 n = 31417