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 |
assert(isempty(regexp(evalc('type rot_hardway'),'(eval|fliplr|flipud|flipdim|rot90|)')))
|
2 | Pass |
x = [1 2 3;4 5 6;7 8 9];
y_correct = [3 6 9;2 5 8;1 4 7];
assert(isequal(rot_hardway(x),y_correct))
|
3 | Pass |
x = [sqrt(-1) 2 3;4 5 6;7 8 9];
y_correct = [3 6 9;2 5 8;sqrt(-1) 4 7];
assert(isequal(rot_hardway(x),y_correct))
|
4 | Pass |
x = magic(9);
y_correct = rot90(magic(9));
assert(isequal(rot_hardway(x),y_correct))
|
Project Euler: Problem 10, Sum of Primes
556 Solvers
Find perfect placement of non-rotating dominoes (easier)
228 Solvers
312 Solvers
264 Solvers
206 Solvers