Members in Shoutbox
None.
Shoutbox Search
Shoutbox Commands
/w [name] > Whisper
/r > Reply to last whisper /me > Marks as action Shoutbox Information
Moderators may delete any and all shouts at will.
|
Global Shoutbox
Please log in to shout.
[2014-12-15. : 9:28 pm] Jack -- Sacrieur you can optimize more by not running FindDivisorSum for every number. If you've already found the divisor sum, add it to a list or array and then later just check to see if it already exists instead of recalculating.[2014-12-15. : 9:12 pm] jjf28 -- CorboCorbo shouted: Hello CorboCorbo shouted: Hello CorboCorbo shouted: Hello [2014-12-15. : 8:19 pm] KrayZee -- I think SEN should sue Sony. "Sony Entertainment Network" has the initials SEN.[2014-12-15. : 3:20 pm] *jjf28 SacrieurSacrieur shouted: disregard the first link regards first link*[2014-12-15. : 3:19 pm] jjf28 -- twilight_marinetwilight_marine shouted: hey guys is it possible to trigger detect mutalisk cocoon? possible, it's done in storm the fort, perhaps it looks to see whether players command exactly 0 mutalisks? I haven't checked what it uses specifically[2014-12-15. : 3:16 pm] twilight_marine -- hey guys is it possible to trigger detect mutalisk cocoon?[2014-12-15. : 11:45 am] Moose -- Chicken on a raft on a Monday morning, ah what a terrible sight to see! Dabtoes forward and the dustmen aft, sittin there a pickin at a chicken on a raft![2014-12-15. : 10:50 am] Roy -- I don't know what m is supposed to be, though; Sacrieur declares a variable but doesn't initialize it in the for loop, so it'd be a compile error.[2014-12-15. : 10:17 am] Jack -- SacrieurSacrieur shouted: Any numbers n/2 + 1 through n - 1 aren't going to be divisors. Same is true for any number n/3 + 1 through n/2 - 1 and so on. how much more efficient is that than going through all possibilities?[2014-12-15. : 8:17 am] O)FaRTy1billion[MM] -- anyway, time for bed. I have work in the morning and I was super tired all day at work today ;o[2014-12-15. : 8:14 am] O)FaRTy1billion[MM] -- I hoard my files. I have maps and data from like 4 comptuers ago on this computer.[2014-12-15. : 8:07 am] O)FaRTy1billion[MM] -- This is the extent of my attempts at terrain editing. I never bothered actually blending the terrain types ... [2014-12-15. : 8:02 am] Sacrieur -- So anyway back to this Euler problem, all you have to do is take the divisors you found and use modulus. Once you get to 100 or a sufficiently low number for the for loop, you can just iterate through them normally since this would likely be more efficient than division.[2014-12-15. : 7:59 am] O)FaRTy1billion[MM] -- gah, photobucket made finding old pictures even harder. |