Code Kata: Project Euler #4, Finding Palindromes

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 ...

Code Kata: Project Euler #2 with CMake

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 ...