blaat - MATLAB Cody - MATLAB Central

blaat

1106
Rank
5
Badges
2020
Score
View Community Profile
51 – 100 of 205

blaat submitted a Comment to Solution 41338

What it does: it finds the maximum number of occurrences for each prime number smaller than x in the factorisations of the numbers 1:x (e.g., for x = 10, the maximum number of occurrences for 2 is 3, since 2*2*2 = 8). If the product of all prime factors taken to the power of their maximum # of occurrences is then taken, the smallest number that is divisible by 1:10 is obtained. So for x = 10: 2 * 2 * 2 * 3 * 3 * 5 * 7 = 2520.

on 14 Feb 2012

blaat submitted Solution 40827 to Problem 160. So many choices

on 14 Feb 2012

blaat submitted Solution 40817 to Problem 304. Bottles of beer

on 14 Feb 2012

blaat submitted Solution 38652 to Problem 164. Right and wrong

on 12 Feb 2012

blaat submitted Solution 38630 to Problem 125. Remove DC

on 12 Feb 2012

blaat submitted Solution 38629 to Problem 163. Love triangles

on 12 Feb 2012

blaat submitted Solution 38599 to Problem 151. Magic!

on 12 Feb 2012

blaat submitted Solution 38223 to Problem 129. All capital?

on 12 Feb 2012

blaat submitted Solution 38206 to Problem 109. Check if sorted

on 12 Feb 2012

blaat submitted Solution 38204 to Problem 106. Weighted average

on 12 Feb 2012

blaat submitted Solution 37571 to Problem 174. Roll the Dice!

on 11 Feb 2012

blaat submitted a Comment to Solution 33563

Nice :) I was trying to think of clever ways to use convolution, but didn't manage. This should be the leading solution instead of the lookup based on the test cases..

on 11 Feb 2012

blaat submitted Solution 37326 to Problem 167. Pizza!

on 11 Feb 2012
51 – 100 of 205
Go to top of page