Search found 15 matches

by KING-OLE
Thu Sep 10, 2020 12:49 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 724
Replies: 6
Views: 1613

Re: Problem 724

heteroing wrote: Thu Sep 10, 2020 10:28 am The problem wants the expectation of the average distance of all drones once the process completes.
Thanks, and I must have been tired last night, as the only way to get to a non-integer is by taking the average. :-)
by KING-OLE
Thu Sep 10, 2020 3:44 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 724
Replies: 6
Views: 1613

Problem 724

Not sure I understand the question. Are you looking for the distance of:
  1. All packages added
  2. The package that has traveled the longest
  3. The average distance all packages has traveled
Thanks.
by KING-OLE
Wed Nov 13, 2019 4:03 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 688
Replies: 9
Views: 4081

Re: Problem 688

Thank you for clarifying DJohn.

The language had me misunderstanding the task. I would have preferred something like "Stack n plates in k piles. No pile must remain empty."

Anyway, I understand the question now, so I will now see if I can solve it. :-)
by KING-OLE
Wed Nov 13, 2019 2:50 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 688
Replies: 9
Views: 4081

Re: Problem 688

"We stack n plates into k non-empty piles where each pile is a different size." So, the new plates are n, and the k piles are NOT empty, therefore old or existing. EDIT: Or am I reading that wrong? - Does it simply mean that I have to place at least one plate on each pile, leaving none emp...
by KING-OLE
Tue Nov 12, 2019 8:10 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 688
Replies: 9
Views: 4081

Problem 688

I have problems understanding the exact question.

Do the piles need to have different counts of plates:

1) before the new plates are added,
2) added to each pile,
3) after new plates are added
4) all or some of the above - which? _____________

Thanks.
by KING-OLE
Mon Apr 16, 2018 4:40 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 437
Replies: 4
Views: 2645

Re: Problem 437

You should be able to find many examples with an exhaustive brute force search. Thanks. Hmm, then obviously I am doing something wrong somewhere. I have a brute force test looping through all p's < 10,000 and all fpr's < p, and the example (11,8) is the only result I get. Back to the drawing board.
by KING-OLE
Mon Apr 16, 2018 2:49 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 437
Replies: 4
Views: 2645

Re: Problem 437

Just making sure I understand this.

Must fpr<p?

If so, for p<10000, the only solution I get is the one shown as the example, where p=11 and fpr=8.

If I however allow fpr<100000, I find 2 solutions, and if fpr<1000000, I find 3.

I am confused.

Thanks.
by KING-OLE
Wed Mar 21, 2018 6:50 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 583
Replies: 1
Views: 1068

Problem 583

Having not been able to find the answer yet, I was wondering if the flap is tricky. :D It states that the flap is an isosceles triangle, but while I have assumed the identical sides are the top sides of the flap, it could in theory be the left side and the side crossing the paper, leaving the flap l...
by KING-OLE
Wed May 17, 2017 4:36 pm
Forum: News, Suggestions, and FAQ
Topic: Difficulty Ratings
Replies: 27
Views: 15771

Re: Difficulty Ratings

@muthuVeerappanR: Thanks for your thoughts. I have not solved any of the problems you've mentioned, although I've looked at them all. @sjhillier: Thank you - much appreciated. :-) @v6ph1: Thanks for your input. Time is not an issue for me. I'm not in a hurry, so I take my time. If I'm busy, it just ...
by KING-OLE
Tue May 16, 2017 9:18 pm
Forum: News, Suggestions, and FAQ
Topic: Difficulty Ratings
Replies: 27
Views: 15771

Re: Difficulty Ratings

Just my 2 cents - and I know people will likely disagree with me on this, but here goes. I've been a regular visitor since my nephew told me about the site back in 2008. I've spent many "fun" hours solving problems, but somewhere around problem 350 to 400, the difficulty began to increase,...
by KING-OLE
Sun Oct 25, 2015 1:33 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 531
Replies: 10
Views: 6405

Re: Problem 531

Thanks - that helps. :D
by KING-OLE
Sun Oct 25, 2015 12:43 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 531
Replies: 10
Views: 6405

Problem 531

Maybe I'm not quite awake yet, but I don't understand the question. In the example, a system of x=2%4 and x=4%6 gives the result 10. Is the meaning of "mod" in this question something else? This has been out for just over 8 hours, and 74 people have already solved it, so I think I'm missin...
by KING-OLE
Tue Dec 23, 2014 6:59 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 494
Replies: 10
Views: 4825

Re: Problem 494

Thanks to jaap & v6ph1 . You both clarified the meaning, and I was able to reproduce f(5) and f(10). Not at f(20) yet, as my solutions takes too long still (one is just plain too slow, and the other eats too much memory). I've had several "light bulb moments" while fighting this one, w...
by KING-OLE
Mon Dec 22, 2014 10:34 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 494
Replies: 10
Views: 4825

Re: Problem 494

jaap wrote:Yes, this one. The words if and only if means that the two parts are either both true or both false. So if ai<aj, then bi<bj and vice versa, and equivalently if ai>=aj, then bi>=bj and vice versa.
Thanks - I'll try and see if I can get it to match the example.
by KING-OLE
Mon Dec 22, 2014 9:39 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 494
Replies: 10
Views: 4825

Re: Problem 494

Not asking for hints or clues, but would kindly request an explanation on the meaning of this wording: Let Sm be the set of all sequence prefixes of length m. Two sequences {a1, a2, ..., am} and {b1, b2, ..., bm} in Sm are said to belong to the same prefix family if ai < aj if and only if bi < bj fo...