Cody

# Bryce

Rank
Badges
##### 130
Score
1 – 19 of 19
 on 17 Feb 2013 on 17 Feb 2013 on 17 Feb 2013 on 17 Feb 2013 on 17 Feb 2013 on 17 Feb 2013 on 17 Feb 2013 Bryce submitted a Comment to Solution 25216 Hmmm, description is a little confusing. Is length(x) always = length(y)? Are they nx1 or 1xn? Anyhow, I submitted several possible solutions (e.g. z = x'*y, z = sum(x.*y)) all of which failed the test suite ... but they work fine on my machine! on 2 Feb 2012 Bryce submitted a Comment to Solution 25194 Seems to me that the "best" answer would be tf = logical(mod(n,2)). But I guess the description does not explicitly require logicals, so maybe I am reading too much into the problem. Using logical makes the solution 17 compared to 13 without. on 2 Feb 2012 Bryce received Commenter badge for Solution 25194 on 2 Feb 2012 on 2 Feb 2012 on 2 Feb 2012 on 2 Feb 2012 on 2 Feb 2012 on 2 Feb 2012 Bryce submitted Solution 25161 to Problem 167. Pizza! on 2 Feb 2012 Bryce submitted Solution 25157 to Problem 167. Pizza! on 2 Feb 2012 Bryce received Solver badge for Solution 25155 on 2 Feb 2012 Bryce submitted Solution 25155 to Problem 167. Pizza! on 2 Feb 2012
1 – 19 of 19