Cody

Problem 42791. Number of divisors of a given number

Solution 861786

Submitted on 1 Apr 2016 by Richard Zapor
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))

ps = 1 6880 2 2 2 2 2 5 43

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

ps = 1 5050 2 5 5 101

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

ps = 1 188325 3 3 3 3 3 5 5 31

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

ps = 1 76576500 2 2 3 3 5 5 5 7 11 13 17

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

ps = 1 74 2 37

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

ps = 1.0e+09 * 0.0000 1.4758 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000 0.0000

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

ps = 1 314721 3 3 11 11 17 17