Older blog entries for MAK (starting at number 6)

Very happy today. Did very well in today's topcoder match. This is also the first time I got myself a slight advantage there by using a language with built in big number support.

Reading a lot of open source code. I must admit reading code from real world, living breathing projects (as opposed to quick and dirty hacks to solve a particular algorithmic problem, often deliberately aiming to minimize characters typed as well) has greatly improved my coding style.

While reading about memoization, I stumbled into decorators and decorator libraries for python. Really useful. Wrote my own memoization decorator for python, using ideas lifted from some perl and python code and a few additions of my own. I'll probably make it available online soon.

I've started reading SICP. Fascinating book. But can't build mit-scheme on my machine because I simply don't have enough memory. The ubuntu repositories are no help either because I use 7.04, which they just stopped supporting. I can find compiled binaries elsewhere, but I guess I might as well use this excuse to install 8.04LTS.

Moved my blog from LiveJournal to WordPress. WordPress looks so much cooler, and its open source to boot. The only catch was that LiveJournal only allows one month to be exported at a time. But this wasn't a problem for me since I only started there this month.

Just solved this problem at SPOJ. Pretty easy, but didn't risk getting a time limit exceeded verdict with Python and coded in C++ instead. The problem could be made slightly more interesting by increasing the number of jobs and the range of priorities (e.g. 10^5 perhaps).

Downloaded and built from source xmlrpc-c. I still prefer Python (or even Java) for xmlrpc, but knowing how to do it in C will surely prove useful later. Its fun to set up clients and servers in different languages and have them talk to each other.

I'm certified as an Apprentice now! Thanks to fzort, badvogato, zanee, and ncm.

Got pwned at the last TopCoder single round match. The easy problem could be solved by using a O(n) string search method. I tried Rabin-Karp, but made a very stupid mistake. A learning experience nonetheless. Posted a longer rant/post-match analysis in my LiveJournal blog.

Downloaded source of quite a few open source projects in the last few days. Going through them very carefully. mod_virgule code still baffles me. But I'm slowly making progress. The fact that many of the projects in the projects page here are either dead or have broken links (some even sound bogus) is also causing me some frustration.

Solved another problem at SPOJ. Currently mine is the only accepted Python solution there, but probably not for long.

Just noticed that fzort certified me as apprentice. Thanks fzort! However, advogato still considers me an observer.

Sent example code in Python for blogspam. Got a reply within a few minutes that it will be included with other sample code in Perl and Ruby (already done at this moment see here). Thanks Stevey!

Started reading up on Primitive Roots, trying to solve a problem related to Diffie-Hellman.

Here's a link to my small webapp on google app engine. It's a very simple pastebin clone. I just hacked it together from looking at the example code for appengine. Right now it is barely usable, and I have plans to make major improvements when I have time.

Just created my Advogato account. I had actually heard of Advogato quite a few years ago, but had not signed up. This time I actually stumbled in here while searching for hints on a SPOJ problem. But this time I actually took a good look and realised that this was a lot more than a mere blog site.

Looking at projects from the projects page now. Hopefully will find something to work on soon.