Saturday, April 19th, 2008
This weekend, I solved problem 4 of Project Euler:
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
I designed a routine that checks whether ...
Posted in english, nerdism | No Comments »
Sunday, April 13th, 2008
This weekend, I tackled the Project Euler problem #3:
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
Pretty straightforward: Just test and recurse.
Posted in english, nerdism | No Comments »
Sunday, April 6th, 2008
Recently, I started to use the autotools for building a project. But I am really unhappy with it - although a lot of special cases can be handled by the toolchain, it is extremely complex to use and prone to user errors. Auto-Hell, I guess... So, this code kata is ...
Posted in english, nerdism | No Comments »
Sunday, March 30th, 2008
Following the example of doing code katas, I spend my sunday morning thinking about integer performance in C++. Project Euler provides a nice collection of mathematical problems. As it turns out, some of my assumptions on C++ were totally wrong :-)
Posted in english, nerdism | No Comments »