Project euler memo: Problem 324

Problem 324: Filling a very high tower (3x3x10^10000) with blocks (1x1x2). I first tried with something similar to problem 161. I found the correct, but it took too long to finish 10^1000: 4 hours with C++. I need to read the forum.
-----
(update) With a minor change, it takes 2 hours now.

Project euler memo: Problem 258

Problem 258:  Lagged Fibonacci sequence. I heard that it is used to generate random number sequences. It is also written that it has a long cycle, but I am not sure how long for the parameter of this problem. I had been trying to solve this problem in several wrong ways, but finally I got closer yesterday, but my implementation was very slow. From very early morning today, I had run my code four or five times in 3 hour interval,  and got wrong answers. Finally I found a way with 30 minutes in C++ and a correct answer.

Project euler memo: Problem 365

Problem 365: 'A huge binomial coefficient". I am glad that I finished this problem. Four and half minutes in Python. Also I am 100th person for this problem. Nice number for the new year. The message from Euler:

-----

Congratulations, the answer you gave to problem 365 is correct.

You are the 100th person to have solved this problem.

Nice work, tsuchiya.yoshihiro, you've just advanced to Level 13.
133 members (0.07%) have made it this far.

You have earned 1 new award:

• High Flyer: Progress to the maximum level

Project euler memo: Problem 363

Problem 363: Bézier curve. An easy problem. One and half minutes in Python.

Project euler memo: Problem 362

Problem 362: Counting the number of square free factorization. I am the 50th person who solved this problem and this is the first time for me to get in to a fast solver list. It has been about a week since after the problem was published. Two minutes in C++.

Project euler memo: Problem 181

Problem 181: Creating groups in Black and White objects. I took a simple method, however there was a bug to produce a dictionary ordered sequence. Thee minutes in Python.

Project euler memo: Problem 359

Problem 359: Hilbert's infinite hotel. I do not like this non-natural way of introduction of the problem. First, I wrote a brute force. I do not quite understand why, but looking at the numbers, I found something and wrote a program in Python. 0.04 sec in Python.

Project euler memo: Problem 358

Problem 358:  After coming back from Munich, I finally recovered from jet lag. The problem is on the cyclic number. This is not very hard, but interesting. 14 minutes in Python. Is there any way to speed that up?  

Project euler memo: Problem 357

Problem 357: For a divisor d of n, check if d+d/n is prime or not. Very easy and I brute forced it. It was about 30 minutes in Python. I am at the Narita airport, and I am heading to Munich.

Project euler memo: Problem 161

Problem 161: Tetris kind of annoying picture. Tiling with triominos. I wanted solve this problem but I could not. I ended up with the dynamic programming. 1.3 minutes with C++.