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;b=0;
res=0;
assert(isequal(myXOR(a,b),res))
|
2 | Pass |
%%
a=1;b=1;
res=0;
assert(isequal(myXOR(a,b),res))
|
3 | Pass |
%%
a=1;b=0;
res=1;
assert(isequal(myXOR(a,b),res))
|
4 | Pass |
%%
a=0;b=1;
res=1;
assert(isequal(myXOR(a,b),res))
|
5 | Pass |
%%
a=[0 0 1 1];b=[1 0 1 0];
res=[1 0 0 1];
assert(isequal(myXOR(a,b),res))
|
Find the peak 3n+1 sequence value
791 Solvers
Project Euler: Problem 6, Natural numbers, squares and sums.
782 Solvers
412 Solvers
402 Solvers
309 Solvers