Cody

# Problem 51. Find the two most distant points

Solution 2098436

Submitted on 19 Jan 2020 by Yujie Xu
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
p = [0 0; 1 0; 2 2; 0 1]; ix_correct = [1 3]; assert(isequal(mostDistant(p),ix_correct))

y = [] ix = 1.0000 2.0000 1.0000 1.0000 4.0000 1.0000 2.0000 4.0000 1.4142 2.0000 3.0000 2.2361 3.0000 4.0000 2.2361 1.0000 3.0000 2.8284 ix = 1 3

2   Pass
p = [0 0; 1 0; 2 2; 0 10]; ix_correct = [2 4]; assert(isequal(mostDistant(p),ix_correct))

y = [] ix = 1.0000 2.0000 1.0000 2.0000 3.0000 2.2361 1.0000 3.0000 2.8284 3.0000 4.0000 8.2462 1.0000 4.0000 10.0000 2.0000 4.0000 10.0499 ix = 2 4

3   Pass
p = [0 0; -1 50]; ix_correct = [1 2]; assert(isequal(mostDistant(p),ix_correct))

y = [] ix = 1.0000 2.0000 50.0100 ix = 1 2

4   Pass
p = [5 5; 1 0; 2 2; 0 10; -100 20; 1000 400]; ix_correct = [5 6]; assert(isequal(mostDistant(p),ix_correct))

y = [] ix = 1.0e+03 * 0.0020 0.0030 0.0022 0.0010 0.0030 0.0042 0.0010 0.0020 0.0064 0.0010 0.0040 0.0071 0.0030 0.0040 0.0082 0.0020 0.0040 0.0100 0.0040 0.0050 0.1005 0.0020 0.0050 0.1030 0.0030 0.0050 0.1036 0.0010 0.0050 0.1061 0.0010 0.0060 1.0705 0.0040 0.0060 1.0734 0.0030 0.0060 1.0744 0.0020 0.0060 1.0761 0.0050 0.0060 1.1638 ix = 5 6