Project Euler Forum

In general: 1. Find a specialization. 1a. Train this part. 2. Read the problem max. 1s after the publishing 3. Code fast to solve it within the top 50. To be serious: 65 problems with a maximum difficulty of 20% is not so much. You just need time to get better an better. Read the solutions in the so...

50 is missing:
r(60,60) = 30
r(60,60,60) = 20
p(r(60,60),r(60,60,60)) = 50

Have you checked overlapping occurances?
"arearea"

The Unit-Square is the black one.
For clarification the three points should be chosen that the rectangles combine to a clear non-square rectangle.

Thanks - for me, it's working again.

It seems the site is offline:
https://downforeveryoneorjustme.com/projecteuler.net

Statistics: There are ~5*10^17 possible words in it. And a lot of them are readable. Now calculate all of their Numbers. Build sums of three of them: You should find a sum which appears multiple times. (see Goldbach's conjecture) It is guaranteed if there are at least 1.5*10^6 readable words. And th...

You may work with a check-list for the primes:
1. Generate a list of all primes up to the limit
2. generate the first number by selecting primes (and powers) and cancel them out
3. go on for the 2nd, 3rd, ... number.

For a smaller example 2x2: You can go: 0,0 - 0,1 - 0,2 - 1,2 - 2,2 0,0 - 0,1 - 1,1 - 2,1 - 2,2 0,0 - 0,1 - 1,1 - 1,2 - 2,2 0,0 - 1,0 - 1,1 - 2,1 - 2,2 0,0 - 1,0 - 1,1 - 1,2 - 2,2 0,0 - 1,0 - 2,0 - 2,1 - 2,2 --> 6 solutions only with step = 1 AND: (Two 1-steps and one 2-step) 0,0 - 0,1 - 0,2 - 2,2 0,...

What about the number of the best placements per person (ordered like in the olympic games)? 1. xyz (50 times 1st) 2. abc (26 times 1st) ... 19. dfg (40 times 2nd) ... Many of these statistics are interesting - but they are only as half as interesting, if you can not find your self in it. :wink: And...

I just changed your output so for each return, the current n is reported: -> the return is called twice as it's called by different function calls. For example fib(2) (the 4th call of fib) is startet, but it is still in progress until the result of fib(0) is returned. lookup[] = [-1, -1, -1, -1, -1,...

It's only the return section of the previously called functions: The first calls of fib(5), fib(4), fib(3) and fib(2) did not immediately return - they need to call fib(n-1) and fib(n-2) first. So read it as follows: Stack: fib(5) (A.1) Call fib(5) -> nothing known; call fib(4) and fib(3) Stack: A T...

There is the problem of the handling of entries with equal values. So your "ArraySort" is not an algorithm for sorting, but for the mathematical union-sort operation. The algorithm of Array.sort() is not specified by the language it self: It can differ by the implementation - for primitive types, th...

viewtopic.php?f=49&t=2903&p=31055&hilit ... ipt#p31055
It is already there.

You should clarify it: Do you mean websites?

Most of us use an installed compiler:
gcc, visual studio c++, intel or llvm

Yes - bouncing is stated clearly as neither increasing nor decreasing.

Right angle triangle should be clear enough. Only 1 angle of a degenerated triangle can be determined exactly: 0° between the two identical sides. The other two angles are undetermined. In any problem description, corner cases are named extra. (Integer 0, degenerated polygons,...) But this does not ...

For sure, mod 6 will have a better performance than mod 2 -> the speedup is around 1.4 ... 1.5 and for mod 30, we will have a speedup of 1.8 in comparison to mod 2. It is possible to optimize the performance of the higher versions as mod 6. But the max performance (n/2)/EulerPhi(n), which is only hi...

I don't know how the checks will be compiled, but I think, there is a hidden complexity in the loop checking: e.g. res = k + step while res in D or res % 30 not in (1, 7, 11, 13, 17, 19, 23, 29): You iterate through all (uneven) multiples - even if you don't store them, but in the case mod 6, you on...

The graphic is not updated immediately after a problem is solved and sometimes, the browser cache stores an old version.
So: try to view the picture in 1 hour and reload it without cache (Ctrl + F5 in most browsers).