Cody

# Problem 42791. Number of divisors of a given number

Solution 1989701

Submitted on 24 Oct 2019
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
filetext = fileread('your_fcn_name.m'); assert(isempty(strfind(filetext, 'sqrt'))) assert(isempty(strfind(filetext, 'for')))

2   Pass
n= 6880; y_correct = 24; assert(isequal(your_fcn_name(n),y_correct))

y = 24

3   Pass
n= 5050; y_correct = 12; assert(isequal(your_fcn_name(n),y_correct))

y = 12

4   Pass
n= 188325; y_correct = 36; assert(isequal(your_fcn_name(n),y_correct))

y = 36

5   Pass
n= 76576500; y_correct = 576; assert(isequal(your_fcn_name(n),y_correct))

y = 576

6   Pass
n= 74; y_correct = 4; assert(isequal(your_fcn_name(n),y_correct))

y = 4

7   Fail
n=14^8 ; y_correct = 81; assert(isequal(your_fcn_name(n),y_correct))

Out of memory. Type "help memory" for your options. Error in your_fcn_name (line 2) K = 1:ceil(N/2); Error in Test7 (line 3) assert(isequal(your_fcn_name(n),y_correct))

8   Pass
n=314721 ; y_correct = 27; assert(isequal(your_fcn_name(n),y_correct))

y = 27