Search found 120 matches
- Sat Feb 27, 2021 9:03 pm
- Forum: News, Suggestions, and FAQ
- Topic: Errors/Warnings/Bugs
- Replies: 624
- Views: 208635
Re: Errors/Warnings/Bugs
thanks - works for me now.
- Sat Feb 27, 2021 7:39 pm
- Forum: News, Suggestions, and FAQ
- Topic: Errors/Warnings/Bugs
- Replies: 624
- Views: 208635
Re: Errors/Warnings/Bugs
I solved the latest problem 749. After I typed in my solution, they showed me, I was 70th. But I can not enter the solution thread (no access) and neither the problem description nor my progress showed my that I've solved the problem. EDIT: The last entry in the fastest solver table is 40 minutes ag...
- Thu Feb 18, 2021 9:28 pm
- Forum: News, Suggestions, and FAQ
- Topic: Number of solvers for the latest 160 problems
- Replies: 16
- Views: 1202
Re: Number of solvers for the latest 160 problems
You should consider time as one reason: I started around 14 years ago - at this time there were only around 140 problems available. During this time, I reached at best place 9 within my country and was within the best 200 solvers in the world. My progress was around 70%. But times change: I had time...
- Sat Oct 10, 2020 7:20 pm
- Forum: News, Suggestions, and FAQ
- Topic: Meetup of all hard-core users who solved above X number of problems?
- Replies: 4
- Views: 1195
Re: Meetup of all hard-core users who solved above X number of problems?
Meetings are not a clever idea this year. Two countries have not published any cases - Turkmenistan and North Korea. And according to the statistics, meetings there would be save as there are only one (North Korea) respectively two (Turkmenistan) members with more than 100 problems solved. Otherwise...
- Sat Apr 25, 2020 7:14 pm
- Forum: News, Suggestions, and FAQ
- Topic: Tips for someone trying to get top 50?
- Replies: 3
- Views: 1975
Re: Tips for someone trying to get top 50?
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...
- Wed Apr 22, 2020 6:33 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 155
- Replies: 17
- Views: 9841
Re: Problem 155
50 is missing:
r(60,60) = 30
r(60,60,60) = 20
p(r(60,60),r(60,60,60)) = 50
r(60,60) = 30
r(60,60,60) = 20
p(r(60,60),r(60,60,60)) = 50
- Wed Apr 01, 2020 9:13 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 679
- Replies: 2
- Views: 1569
Re: Problem 679
Have you checked overlapping occurances?
"arearea"
"arearea"
- Fri Jan 03, 2020 6:38 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 695
- Replies: 2
- Views: 1584
Re: Problem 695
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.
For clarification the three points should be chosen that the rectangles combine to a clear non-square rectangle.
- Mon Oct 21, 2019 11:00 pm
- Forum: News, Suggestions, and FAQ
- Topic: Errors/Warnings/Bugs
- Replies: 624
- Views: 208635
Re: Errors/Warnings/Bugs
Thanks - for me, it's working again. 

- Mon Oct 21, 2019 9:58 pm
- Forum: News, Suggestions, and FAQ
- Topic: Errors/Warnings/Bugs
- Replies: 624
- Views: 208635
Re: Errors/Warnings/Bugs
It seems the site is offline:
https://downforeveryoneorjustme.com/projecteuler.net
https://downforeveryoneorjustme.com/projecteuler.net
- Thu Aug 15, 2019 8:35 pm
- Forum: Recreational
- Topic: Mystery of Problem 480.
- Replies: 2
- Views: 3054
Re: Mystery of Problem 480.
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...
- Sun Jun 30, 2019 9:28 pm
- Forum: Number Theory
- Topic: Generate tuples of pairwise coprimes with limit on largest element
- Replies: 2
- Views: 5820
Re: Generate tuples of pairwise coprimes with limit on largest element
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.
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.
- Mon May 20, 2019 10:34 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 662
- Replies: 6
- Views: 5454
Re: Problem 662
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,...
- Sat Jan 12, 2019 12:06 am
- Forum: Recreational
- Topic: Some problem and user statistics
- Replies: 6
- Views: 8897
Re: Some problem and user statistics
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...
- Wed Jan 02, 2019 11:28 pm
- Forum: News, Suggestions, and FAQ
- Topic: Code optimization techniques
- Replies: 20
- Views: 9250
Re: Code optimization techniques
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,...
- Wed Jan 02, 2019 12:48 am
- Forum: News, Suggestions, and FAQ
- Topic: Code optimization techniques
- Replies: 20
- Views: 9250
Re: Code optimization techniques
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...
- Fri Dec 14, 2018 11:14 pm
- Forum: Discrete Mathematics
- Topic: Sorting...
- Replies: 4
- Views: 8674
Re: Sorting...
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...
- Wed Sep 12, 2018 6:10 am
- Forum: News, Suggestions, and FAQ
- Topic: New Language
- Replies: 2
- Views: 3599
Re: New Language
viewtopic.php?f=49&t=2903&p=31055&hilit ... ipt#p31055
It is already there.
It is already there.
- Thu Aug 23, 2018 9:03 pm
- Forum: Programming languages
- Topic: which compiler to use for c++ programs
- Replies: 2
- Views: 7034
Re: which compiler to use for c++ programs
You should clarify it: Do you mean websites?
Most of us use an installed compiler:
gcc, visual studio c++, intel or llvm
Most of us use an installed compiler:
gcc, visual studio c++, intel or llvm
- Tue Aug 21, 2018 10:20 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 113
- Replies: 1
- Views: 1527
Re: Problem 113
Yes - bouncing is stated clearly as neither increasing nor decreasing.