Problem 443: GCD sequence. It's interesting and hard. I don't like it. One minute in Python.

## Sunday, January 25, 2015

## Friday, January 23, 2015

### Project Euler memo: Problem 497

Problem 497: Drunken Tower of Hanoi. Relatively easy. 24 minutes in Python.

## Monday, January 12, 2015

### Project Euler memo: Problem 435

Problem 435: Fibonacci coefficient polynomials. Straightforward computation of Fibonacci numbers with a little trick on modulo inverse. Less than 0.1 seconds in Python.

## Sunday, January 11, 2015

### Project Euler memo: Problem 430

Problem 430: Flipping discs. A kind of brute force on N. 10 minutes in Golang. I need to learn in the forum later.

## Saturday, January 10, 2015

### Project Euler memo: Problem 269

Problem 269: One of the two problems left in the 200s. 3 seconds in Python.

## Saturday, December 27, 2014

### Project Euler memo: Problem 449

Problem 449: Chocolate covered candy. Easier than I thought. 3 seconds in Python and 0.3 seconds in Golang.

## Tuesday, December 16, 2014

### Project Euler memo: Problem 493

Problem 493: Combination of balls. Very easy but I misunderstood the problem at first. It runs almost immediately in Python.

### Project Euler memo: Problem 461

Problem 461: First, I tried to solve this in Golang, and I wrote a terrible algorithm. After I finished it, I saw the forum, I tried to do the some thing others did, and I found that Golang consumes a lot of memory for Slice. I wrote the new one in C++. 10 seconds.

## Sunday, December 07, 2014

### Project Euler memo: Problem 491

Problem 491: Counting the number of double pan-digital numbers divisible by 11. Easy, but I needed time to debug with a smaller case. Two seconds in Python.

## Monday, December 01, 2014

### Project Euler memo: Problem 463

Problem 463: An old style problem. Very easy. Less than 0.1 sec in Python.