Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = 1;
y_correct = 6;
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
2 | Pass |
%%
x = 2;
y_correct = 5;
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
3 | Pass |
%%
x = 3;
y_correct = 4;
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
4 | Pass |
%%
x = 4;
y_correct = 3;
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
5 | Pass |
%%
x = 5;
y_correct = 2;
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
6 | Pass |
%%
x = 6;
y_correct = 1;
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
7 | Pass |
%%
x = 1:6;
y_correct = 6:-1:1;
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
8 | Pass |
%%
x = [6,4,3];
y_correct = [1,3,4];
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
9 | Pass |
%%
x = [5,5,2];
y_correct = [2,2,5];
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
10 | Pass |
%%
x = [3,1,6];
y_correct = [4,6,1];
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
11 | Pass |
%%
x = [5,4,3];
y_correct = [2,3,4];
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
12 | Pass |
%%
x = [3,1,2,6,1,5,4,6,1,3];
y_correct = [4,6,5,1,6,2,3,1,6,4];
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
13 | Pass |
%%
x = [1,6,1,5,5,6,1,3,2,5];
y_correct = [6,1,6,2,2,1,6,4,5,2];
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
14 | Pass |
%%
x = [3,6,2,2,1,1,6,4,4,1];
y_correct = [4,1,5,5,6,6,1,3,3,6];
assert(isequal(dice_roll_opposite_face(x),y_correct))
|
2531 Solvers
2936 Solvers
Given an unsigned integer x, find the largest y by rearranging the bits in x
525 Solvers
Find the "ordinary" or Euclidean distance between A and Z
119 Solvers
Rounding off numbers to n decimals
282 Solvers