Cody

Problem 1489. Hexagonal Tiling Dots in a Circle

Solution 1227475

Submitted on 9 Jul 2017 by Chris Cleveland
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('hexagonal_tiling_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 = 0; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

3   Pass
r = 0.5; N_correct = 0; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

4   Pass
r = 1; N_correct = 6; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

5   Pass
r = 1.5; N_correct = 6; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

6   Pass
r = 2; N_correct = 12; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

7   Pass
r = 2.5; N_correct = 12; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

8   Pass
r = 3; N_correct = 24; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

9   Pass
r = 5; N_correct = 60; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

10   Pass
r = 7.5; N_correct = 138; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

11   Pass
r = 10; N_correct = 246; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

12   Pass
r = 15; N_correct = 552; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

13   Pass
r = 20; N_correct = 960; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

14   Pass
r = 25; N_correct = 1506; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

15   Pass
r = 50; N_correct = 6024; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

16   Pass
r = 100; N_correct = 24186; assert(isequal(hexagonal_tiling_dots_in_circle(r),N_correct));

[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]