## Search found 79 matches

- Sun Sep 03, 2017 5:36 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 244
- Replies:
**11** - Views:
**3565**

### Re: Problem 244

I think the trick here is to represent <snipped by moderator (hk)>

- Mon Aug 14, 2017 5:10 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 161
- Replies:
**3** - Views:
**3011**

### Re: Problem 161

The answer for a 9x3 grid is indeed 3127. So you got it correct!

- Tue Aug 08, 2017 1:12 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 219
- Replies:
**10** - Views:
**3976**

### Re: Problem 219

Thanks Assato for posting the above two values, they were great help for me in verifying the correctness of my algorithm.

- Tue Aug 01, 2017 9:00 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 227
- Replies:
**41** - Views:
**11628**

### Re: Problem 227

Could someone confirm that when there are only 4 players, the expected waiting time for the game to be over is (36 / 5) = 7.2?

- Thu Jul 13, 2017 1:11 pm
- Forum: News, Suggestions, and FAQ
- Topic: Difficulty Ratings
- Replies:
**28** - Views:
**10826**

### Re: Difficulty Ratings

Thanks for the detailed response, Marcus. I guess any system that would incorporate the problem solver's skill, could be resource intensive. I have not tried my hand at implementing such a system. I was thing about problem difficulty's in general and at a **high level** (did not sweat the details) c...

- Mon Jul 10, 2017 12:47 pm
- Forum: News, Suggestions, and FAQ
- Topic: Difficulty Ratings
- Replies:
**28** - Views:
**10826**

### Re: Difficulty Ratings

Thanks for the suggestions, DJohn! I am currently solving problems in the descending order of 'Solved By' and have identified about 30 problems with 'Solved By' > 1000 that I have not solved. These problems have difficulty ratings in the 40% to 70% range, a little bit outside the difficulty range I ...

- Sat Jul 08, 2017 5:15 pm
- Forum: News, Suggestions, and FAQ
- Topic: Difficulty Ratings
- Replies:
**28** - Views:
**10826**

### Re: Difficulty Ratings

@euler: The slogan: "NOTE: Please do not contact Project Euler if you are unable to solve a particular problem. If you can't solve it, then you can't solve it!", I thought was letting users know that if they can't solve a problem, they should not expect any sort of assistance from PE admins, and sho...

- Sat Jul 08, 2017 3:19 pm
- Forum: News, Suggestions, and FAQ
- Topic: Difficulty Ratings
- Replies:
**28** - Views:
**10826**

### Re: Difficulty Ratings

I guess my claim of 500 super-smart solvers on PE is far off. Anybody on levels 20+ can be classified as super-smart problem solvers, even if they don't consider themselves to be super-smart. But, we should note that someone not in 20+ levels, but has average-difficulty of problems solved in the upp...

- Sat Jul 08, 2017 12:06 pm
- Forum: News, Suggestions, and FAQ
- Topic: Difficulty Ratings
- Replies:
**28** - Views:
**10826**

### Re: Difficulty Ratings

Thanks hk for correcting the definition of difficulty. Even with this definition of difficulty, my claim is that there are at least around 500 very smart problem solvers on PE. Once a new problem is released, if this group of smart problem solvers solve the problem very quickly, that doesn't make th...

- Sat Jul 08, 2017 6:14 am
- Forum: News, Suggestions, and FAQ
- Topic: Difficulty Ratings
- Replies:
**28** - Views:
**10826**

### Re: Difficulty Ratings

As I mentioned earlier on this thread, I simply sort the problems in ascending order of difficulty and solve the problems. This way I know that the problems I am solving are at my skill level and I am not attempting to bite more than I can chew. Having an accurate difficulty level makes life easier ...

- Sun Jun 11, 2017 1:00 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 548
- Replies:
**5** - Views:
**2516**

### Re: Problem 548

This problem for some reason does not have sample results, so can someone verify for n <= 10 ^ 8, the sum of g(n) == n is 3?8?1?7?5.

EDIT: Solved the problem. The above number is not correct.

Thanks,

vamsikal3

EDIT: Solved the problem. The above number is not correct.

Thanks,

vamsikal3

- Sun Jun 11, 2017 5:22 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 018
- Replies:
**50** - Views:
**14668**

### Re: Problem 018

At any given node you have two choices, the node in the next row, to your immediate left and node in the next row to your immediate right. Any path from the top row node to the nodes in that bottom-most row is allowed, as long as you pick the next node as mentioned above. So the optimal path *might*...

- Sat Jun 10, 2017 2:51 pm
- Forum: News, Suggestions, and FAQ
- Topic: The Archivist award.
- Replies:
**11** - Views:
**2991**

### Re: The Archivist award.

So, hk what you are saying is, solving a problem collaboratively, (say using PM on this website) is fine, as long as it does not leave a paper trail for future PE solvers? So in theory, I should be able to start a thread, asking people interested in solving PE 585 to join me via PM.

- Sat Jun 10, 2017 8:03 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 017
- Replies:
**83** - Views:
**24895**

### Re: Problem 017

We have to include the "and". It is stated in the problem statement. NOTE: Do not count spaces or hyphens. For example, 342 (three hundred and forty-two) contains 23 letters and 115 (one hundred and fifteen) contains 20 letters. The use of "and" when writing out numbers is in compliance with British...

- Sat Jun 10, 2017 5:11 am
- Forum: News, Suggestions, and FAQ
- Topic: The Archivist award.
- Replies:
**11** - Views:
**2991**

### Re: The Archivist award.

Maybe collaborating on every problem may not be a good idea, but what about problems like PE 585 which have a near 100% difficulty, maybe a group might have a better chance of solving the problem collectively, than an individual (Since only 54 individuals have solved the problem in about 6 months).

- Fri Jun 09, 2017 7:42 pm
- Forum: News, Suggestions, and FAQ
- Topic: The Archivist award.
- Replies:
**11** - Views:
**2991**

### Re: The Archivist award.

I am not sure whether I will be able to earn the Master of Archives award, because some problems are really hard and have been solved only by a handful of people like for example the "Problem 585 Nested Square Roots" problem. I spent a few days on the problem and came up with an algorithm that can g...

- Tue May 30, 2017 11:48 am
- Forum: News, Suggestions, and FAQ
- Topic: The Archivist award.
- Replies:
**11** - Views:
**2991**

### Re: The Archivist award.

Thanks for the response, Euler. So I have to rely on the problem development team to post enough easy to medium problems to keep my archivist status.

- Tue May 30, 2017 5:04 am
- Forum: News, Suggestions, and FAQ
- Topic: The Archivist award.
- Replies:
**11** - Views:
**2991**

### The Archivist award.

I recently got the Archivist award for solving 299 out of 595 problems. Now, (say) if I stop solving problems for a while and the number of problems in the archive increases to say 600+, will I still keep my Archivist award. In short, is there a way you could lose your Archivist award for being idle...

- Sun May 28, 2017 4:54 am
- Forum: Programming languages
- Topic: Rust 1.0!
- Replies:
**6** - Views:
**7959**

### Re: Rust 1.0!

I have used Rust to solve 4 or 5 problems. My experience has been that while it seems to be a good language to program in, it needs a library like the C++ STL, there are some good crates out there though. Also, understanding / getting used to the "borrowing" concept takes some time.

- Mon May 22, 2017 4:28 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 333
- Replies:
**11** - Views:
**4422**

### Re: Problem 333

Thanks hk!

EDIT: Solved the problem. Posted my solution to the thread where I have asked a question. Can someone take a look at the solution thread and answer my question, possibly via PM.

EDIT: Solved the problem. Posted my solution to the thread where I have asked a question. Can someone take a look at the solution thread and answer my question, possibly via PM.