Many of you might know that over the weekend there was a AMD design contest. I was under the impression that such contests are coding heavy and it goes without saying that a potential turnoff for me. Thanks to my roommate, however, my impression changed significantly and I found out that majority of the problems were basically algorithmic puzzles. More importantly it turned out that once you found out the trick involved, the coding required was minimal.
I will give an example shortly. There are offcourse some problems on compiler design and related areas on which we have minimal knowledge. So to form an ideal team for these contests a partner majoring in CE/CS is a must.
Over the weekend me and my roommate (major CE) were able to solve 4 and half problems out of 5. Unfortunately, we were not able to submit our solution to the contest, since my roommate had to fly out of town and due to my “extraordinary” coding skills.
I am writing this post in hope that next year we would see someone from WNCG and especially from WSIL appearing on the LCD TV on the first floor as the winner of such a contest.

Example problem: Let z, l and m be a natural numbers, l less than m. Let p be a prime which appers in the prime factorization of z, e.g. 2 and 3 appear in the prime factorization of 24. The problem is to find out the number of natural numbers between l and m (including l and m) that have p ones in their binary representation.