Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 5;
y_correct = 0.5;
assert(abs(polarised(x)-y_correct) < 1e-10)
|
2 | Pass |
x = 180;
y_correct = 0.5;
assert(abs(polarised(x)-y_correct) < 1e-10)
|
3 | Pass |
x = 365;
y_correct = 0.5;
assert(abs(polarised(x)-y_correct) < 1e-10)
|
4 | Pass |
x = [91, 1];
y_correct = 0;
assert(abs(polarised(x)-y_correct) < 1e-10)
|
5 | Pass |
a = randi([-360, 360]);
b = 90*(1+2*randi([-3, 3]));
x = [a, a+b];
y_correct = 0;
assert(abs(polarised(x)-y_correct) < 1e-10)
|
6 | Pass |
a = randi([-360, 360]);
b = 90*(1+2*randi([-3, 3]));
x = [a, a+b];
y_correct = 0;
assert(abs(polarised(x)-y_correct) < 1e-10)
|
7 | Pass |
x = [0, 22.5];
y_correct = 0.85355339059/2;
assert(abs(polarised(x)-y_correct) < 1e-10)
|
8 | Pass |
x = [0, -45];
y_correct = 0.25;
assert(abs(polarised(x)-y_correct) < 1e-10)
|
9 | Pass |
x = [5, 140];
y_correct = 0.25;
assert(abs(polarised(x)-y_correct) < 1e-10)
|
10 | Pass |
x = 5 + (1:5)*22.5;
y_correct = 0.53079004294/2;
assert(abs(polarised(x)-y_correct) < 1e-10)
|
Return a list sorted by number of occurrences
1504 Solvers
1159 Solvers
Remove the small words from a list of words.
672 Solvers
Test if a Number is a Palindrome without using any String Operations
181 Solvers
Golomb's self-describing sequence (based on Euler 341)
106 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!