This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
A = [0 0; 120 120; 120 0];
y_correct = 7200;
assert(isequal(area_of_polygon(A),y_correct))
|
2 | Pass |
A = [1 2; 12 3; 6 7];
y_correct = 25;
assert(isequal(area_of_polygon(A),y_correct))
|
3 | Pass |
A = [0 0; 0 100; 100 100; 100 0];
y_correct = 10000;
assert(isequal(area_of_polygon(A),y_correct))
|
4 | Pass |
A = [0 0; 0 200; 200 200; 200 0];
y_correct = 40000;
assert(isequal(area_of_polygon(A),y_correct))
|
5 | Pass |
A = [0 0; 0 50; 100 100; 100 0];
y_correct = 7500;
assert(isequal(area_of_polygon(A),y_correct))
|
6 | Pass |
A = [0 0; 200 100; 500 500; 400 1000; 100 300; -100 100; -300 -200];
y_correct = 230000;
assert(isequal(area_of_polygon(A),y_correct))
|
Make the vector [1 2 3 4 5 6 7 8 9 10]
29480 Solvers
Calculate the Levenshtein distance between two strings
304 Solvers
202 Solvers
221 Solvers
Create an index-powered vector
233 Solvers