Cody

# Problem 51. Find the two most distant points

Solution 2615254

Submitted on 26 Jun 2020 by Li Kehan Li
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))

a = 4 b = 2 s = 0 0 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 0 s = 0 1 0 0 0 0 0 0 s = 0 1 8 0 0 0 0 0 0 0 0 0 s = 0 1 8 1 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 1 8 1 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 1 8 1 0 0 5 0 0 0 0 0 0 0 0 0 s = 0 1 8 1 0 0 5 2 0 0 0 0 0 0 0 0 s = 0 1 8 1 0 0 5 2 0 0 0 0 0 0 0 0 s = 0 1 8 1 0 0 5 2 0 0 0 5 0 0 0 0 s = 0 1 8 1 0 0 5 2 0 0 0 5 0 0 0 0 c = 1 d = 3 ix = 1 3

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

a = 4 b = 2 s = 0 0 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 0 s = 0 1 0 0 0 0 0 0 s = 0 1 8 0 0 0 0 0 0 0 0 0 s = 0 1 8 100 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 1 8 100 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 1 8 100 0 0 5 0 0 0 0 0 0 0 0 0 s = 0 1 8 100 0 0 5 101 0 0 0 0 0 0 0 0 s = 0 1 8 100 0 0 5 101 0 0 0 0 0 0 0 0 s = 0 1 8 100 0 0 5 101 0 0 0 68 0 0 0 0 s = 0 1 8 100 0 0 5 101 0 0 0 68 0 0 0 0 c = 2 d = 4 ix = 2 4

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

a = 2 b = 2 s = 0 0 0 0 s = 0 0 0 0 s = 0 2501 0 0 s = 0 2501 0 0 c = 1 d = 2 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))

a = 6 b = 2 s = 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 1158001 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 1158001 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 1158001 0 0 0 68 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 1158001 0 0 0 68 10728 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 1158001 0 0 0 68 10728 1154408 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 1158001 0 0 0 68 10728 1154408 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 1158001 0 0 0 68 10728 1154408 0 0 0 0 10100 0 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 1158001 0 0 0 68 10728 1154408 0 0 0 0 10100 1152100 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 1158001 0 0 0 68 10728 1154408 0 0 0 0 10100 1152100 0 0 0 0 0 0 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 1158001 0 0 0 68 10728 1154408 0 0 0 0 10100 1152100 0 0 0 0 0 1354400 0 0 0 0 0 0 s = 0 41 18 50 11250 1146050 0 0 5 101 10601 1158001 0 0 0 68 10728 1154408 0 0 0 0 10100 1152100 0 0 0 0 0 1354400 0 0 0 0 0 0 c = 5 d = 6 ix = 5 6

### Community Treasure Hunt

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

Start Hunting!