Cody

# Problem 2664. Divisors for big integer

Solution 1977499

Submitted on 15 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
x = 10; y_correct = 4; assert(isequal(divisors_Big(x),y_correct))

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

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

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

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

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

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

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

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

Out of memory. Type "help memory" for your options. Error in divisors_Big (line 2) y = sum(mod(x,1:x)==0); Error in Test9 (line 3) assert(isequal(divisors_Big(x),y_correct))

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

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

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

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

Out of memory. Type "help memory" for your options. Error in divisors_Big (line 2) y = sum(mod(x,1:x)==0); Error in Test13 (line 3) assert(isequal(divisors_Big(x),y_correct))

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

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

Out of memory. Type "help memory" for your options. Error in divisors_Big (line 2) y = sum(mod(x,1:x)==0); Error in Test15 (line 3) assert(isequal(divisors_Big(x),y_correct))