62 now; got within 900.

Great! One more MATLAB player in the top 1000. From the statistics, C/C++ wins by far. The next one is Python, which is just a free version of MATLAB (very similar to MATLAB, I heard).

I did the 100! and 2^1000 problems the same way. Also there is a problem about finding maximum digital sum for a^b (1<=a,b<=100).

I think these are the only three problems I used that approach.

Many people in the forum there used the big number capabilities of languages (Java, Python, Ruby, Mathematica ...), which I also regard as cheating A few solutions from other people did surprise me for their elegance.

Many C/C++ users will think MATLAB is cheating too.

. My view is that if I know how to do it in that approach, then I have proved I can do it, I don't have to do it for every problem with the slow approach.

BTW, I didn't know there's a forum until you mentioned it. I went in and checked, it is a great forum, but where do people discuss these problems? There are quite a few subforums, which one do they use to discuss these problems?

I think they should have a contest on what is the shortest code for each problem. I may win a couple of problems for the shortest solution.

I have four problem solutions under 30 charactors, and two of them under 15.

The reason I admire Prof. W so much is that he is at the very top at everything he does.

I wish this was true. The fact is that I suck at many things I do.

I solved #176 and #179, and those still count as one each. I think they should have some kind of weight system and give more point for the harder problems. For example, 1 point for problems 1-9, 2 points for problems 10-99, 3 points for problems 100+, etc.

After I got on the top 1000, I started to do problems by their natural order. There is no reason for me to select later ones, since I will meet them later anyway. Now, I have solved every problem from 1 to 59, the next one will be No. 60.

My question is how do we get to the top? Suppose I solve all the problems some day, I will still be behind to those who solve those problems earlier.