Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today
19Rank
11Badges
8165Score

Paul Berglund submitted Solution 517402 to Problem 2635. Higher! Lower!

on 28 Oct 2014 at 3:55

Paul Berglund submitted Solution 516927 to Problem 2635. Higher! Lower!

on 26 Oct 2014 at 18:18

Paul Berglund submitted a Comment to Problem 2585. How to reverse spdiags ?

% this problem is not guaranteed solvable isequal(spdiags([eye(5) zeros(5)]),spdiags(eye(5)))

on 5 Oct 2014 at 0:17

Paul Berglund submitted Solution 508429 to Problem 2609. If-then-else

on 4 Oct 2014 at 23:56

Paul Berglund submitted a Comment to Solution 502450

I think that this solution is perfectly legitimate. Why try to solve it "properly"? It's not like you are using eval or something like that. regexprep is a perfectly legitimate tool to use.

on 18 Sep 2014

Paul Berglund received ASEE Challenge Master badge

on 18 Sep 2014

Paul Berglund submitted a Comment to Problem 2534. Path of least resistance - Move all direction

OK, you're right about test case 2. I was wrong. But I get 6 for test case 1, not 7. The shortest path does not include upper right corner.

on 3 Sep 2014

Paul Berglund submitted a Comment to Problem 2534. Path of least resistance - Move all direction

I get 11 for test case 2.

on 1 Sep 2014

Paul Berglund submitted a Comment to Problem 2534. Path of least resistance - Move all direction

I don't understand how this works with negative elements. For example if the input matrix is [0 -1;0 0] it is possible to obtain an arbitrarily low score by going [EastWest] sufficiently many times then EastSouth.

on 30 Aug 2014