The Seed Stopper......(Smokey!)

I am having my exams on the 9th and 11th of this month. The first exam is Software Testing which sucks so much, i had to take a diversion today! and guess what a mad scientist does? I created a very small plugin for Azureus which does nothing other than preventing it from seeding any of the files downloaded.
I know this goes against the principles of bit torrent protocol, but for people like me who have a bandwidth of just 10KB/s for upload, its a tough call :( . Anyway I am providing the link here, help yourself. Seed Stopper!!

Also have a look at the release notes for info about installing the plugin.

My Multimedia keyboard works.!!!

What a wonderfull feeling.......yesterday by accident i moved the volume scroll on my system.... It is a multimedia keyboard .... however i never expected that linux has installed the appropriate drivers for it .The above screen shot is that of the volume and the bottom is that of mute. Besides the play,next,previous,stop all work..By the way i am using kubuntu :) . Go linux !!! Go!!!! You rock

An dissapointing topcoder contest....

Yesteday topcoder conducted its srm contest at 10:30 pm . Even though it was pretty late for us i did not mind since i usually sleep late into the night. It was damn cold in my room which was pretty unusual in a city like chennai . I donot know whether it was the climate or was it my body that started freezing ? This was my first top coder srm and i wished i did properly . I was not able to get the gist of the first problem . I got a bit confused . the second problem was regarding a problem validating a knight's move .
the full code is here :http://www.topcoder.com/stat?c=problem_solution&rm=263249&rd=10658&pm=7245&cr=20718854
for (int i = 0; i < cells.length; i+=2) {
if(!this.valid(parse(cells[i]),parse(cells[i+1])))
return "Invalid";
}
this loop was the mistake i did. here what i did was that i paired up two consequtive moves instead of sequence
so suppose you have a sequence of moves say

"D5", "F6", "C6", "A5",

so what my code did was validate knights move from D5->F6 and then the next validate C6->A5
however it should have been

D5->F6, F6->C6,C6->A5 .

then the corrected loop looks something like this
for (int i = 0; i < cells.length; i+=1) {
if(!this.valid(parse(cells[i]),parse(cells[i+1])))
return "Invalid";
}
so its i+=1 and not i+=2!!!!!
damn this seemed to be the easiest that top coder could ask and i messed it up!!!!

the next 1000 sum was easy.......but never did it strike me to use dp or memoization .
so i did the normal way and it took too much time to execute ! :(
http://www.topcoder.com/stat?c=problem_statement&pm=7244&rd=10658&rm=263249&cr=20718854
and here is my solution
http://www.topcoder.com/stat?c=problem_solution&rd=10658&rm=263249&cr=20718854&pm=7244

better luck next time!!!