User talk:Lord Klotski

Welcome
Hi, welcome to SFU ACM Codebook Wiki! Thanks for your edit to the List of Numerical Analysis Algorithms page.

Please leave a message on my talk page if I can help with anything! -- Hakukakotai (Talk) 04:48, November 11, 2009

Greatest Common Multiple?
Bad Andrew, bad :P

It's Greatest Common Divisor, not Greatest Common Multiple... The greatest common multiple of two numbers is infinity :P

I fixed up the article, renamed it, made links to it, and put in some cleaner code.

This wiki is fun :D I added a whole bunch of graph stuff.

142.58.94.146 00:02, January 14, 2010 (UTC) Wesley

Lol fuck. Nice call.

I added some interesting mathy stuff a while back...you might be interested in Big Integer Square Root (that algorithm is FAST) and you might not have seen the random walk stuff before either....

I haven't decided yet whether I should post my solutions to some of the crazy math problems on UVA that I've been solving. I've finished over 2/3 of the problems in the math section of the section 6 thingy...lots of fun probability DP there :D. If you want some hints for your site, I could send you some I guess lolz :)

Lord Klotski 07:12, December 7, 2009 (UTC)Andrew

Sounds nice actually... what's your user ID? I want to know which problems you've done so I can harass you about them when I can't do them :P

DP, Graph, Geometry, Math... these are the arenas I must learn.

Peter and I did the 2007 Pacific Northwest Regional as a practice yesterday... In 2007, Peter, Cosmin and I solved 4 / 11 problems and ended in 25th. Peter and I did 7 problems in 3.5 hours and would've been in 9th place, without a third teammate and an extra 90 minutes :D Obviously we've improved... Highly recommended as a practice contest. Has a nice range of difficulty.

142.58.94.146 00:02, January 14, 2010 (UTC) Wesley