Cody

Problem 2664. Divisors for big integer

Solution 2606989

Submitted on 24 Jun 2020 by Viet Nga Bui
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 = 10; y_correct = 4; assert(isequal(divisors_Big(x),y_correct))

n = 2

2   Pass
x = 28; y_correct = 6; assert(isequal(divisors_Big(x),y_correct))

n = 2

3   Pass
x = 28; y_correct = 6; assert(isequal(divisors_Big(x),y_correct))

n = 2

4   Pass
x = 784; y_correct = 15; assert(isequal(divisors_Big(x),y_correct))

n = 2

5   Pass
x = 1452637; y_correct = 2; assert(isequal(divisors_Big(x),y_correct))

n = 2

6   Pass
x = 5452637; y_correct = 4; assert(isequal(divisors_Big(x),y_correct))

n = 2

7   Pass
x = 16452637; y_correct = 2; assert(isequal(divisors_Big(x),y_correct))

n = 2

8   Pass
x = 116452637; y_correct = 8; assert(isequal(divisors_Big(x),y_correct))

n = 2

9   Pass
x = 416452638; y_correct = 32; assert(isequal(divisors_Big(x),y_correct))

n = 2

10   Pass
x = 12250000; y_correct = 105; assert(isequal(divisors_Big(x),y_correct))

n = 2

11   Pass
x = 2031120; y_correct = 240; assert(isequal(divisors_Big(x),y_correct))

n = 2

12   Pass
x = 76576500; y_correct = 576; assert(isequal(divisors_Big(x),y_correct))

n = 2

13   Pass
x = 816452637; y_correct = 32; assert(isequal(divisors_Big(x),y_correct))

n = 2

14   Pass
x = 103672800; y_correct = 648; assert(isequal(divisors_Big(x),y_correct))

n = 2

15   Pass
x = 842161320; y_correct = 1024; assert(isequal(divisors_Big(x),y_correct))

n = 2