Cody

Problem 1025. Divisors of an integer

Solution 2957047

Submitted on 17 Sep 2020 by Benjamin
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
x = 1; y_correct = 1; assert(isequal(divisor(x),y_correct))

f = 1 n = 1 f = 1 1 f = 1 1

2   Pass
x = 12; y_correct = [1 2 3 4 6 12]; assert(isequal(divisor(x),y_correct))

f = 2 2 3 n = 7 f = 2 2 3 2 2 3 2 2 3 2 2 3 2 2 3 2 2 3 2 2 3 2 2 3 f = 1 1 1 1 1 3 1 2 1 1 2 3 2 1 1 2 1 3 2 2 1 2 2 3

3   Pass
x = 10; y_correct = [1 2 5 10]; assert(isequal(divisor(x),y_correct))

f = 2 5 n = 3 f = 2 5 2 5 2 5 2 5 f = 1 1 1 5 2 1 2 5

Suggested Problems

More from this Author2

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!