Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
lat='19d26m10.6sN';
long='99d4m20.2sW';
y_correct = [2939,338.5];
[a,b]=IdahoFalls(lat,long);
assert(isequal([a,b],y_correct))
|
2 | Pass |
lat='22d18m32.1sN';
long='113d54m52.8sE';
y_correct = [11322,32.2];
[a,b]=IdahoFalls(lat,long);
assert(isequal([a,b],y_correct))
|
3 | Pass |
lat='33d56m46sS';
long='151d10m38sE';
y_correct = [13019,54.0];
[a,b]=IdahoFalls(lat,long);
assert(isequal([a,b],y_correct))
|
4 | Pass |
lat='40d38m24.3sN';
long='73d46m42.9sW';
y_correct = [3149,288.7];
[a,b]=IdahoFalls(lat,long);
assert(isequal([a,b],y_correct))
|
5 | Pass |
lat='55d58m20.7sN';
long='37d24m47.1sE';
y_correct = [8588,337.8];
[a,b]=IdahoFalls(lat,long);
assert(isequal([a,b],y_correct))
|
6 | Pass |
lat='46d36m24sN';
long='111d59m0.1sW';
y_correct = [344,181.2];
[a,b]=IdahoFalls(lat,long);
assert(isequal([a,b],y_correct))
|
649 Solvers
889 Solvers
356 Solvers
Circular Primes (based on Project Euler, problem 35)
75 Solvers
Geometry: Find Circle given 3 Non-Colinear Points
41 Solvers