Project Euler Forum

You can find out by trying both options for F(10,10).
Somewhat higher in this thread you can even find smaller cases to verify which of the two options holds.

Tristen's problem solved, no need for further reactions.

Dear pysaumont, could you please look for the right place to put your question? I take it that you are talking about posts on the main site projecteuler.net. As long as your post is the last post in a thread you are not allowed to make a new one. The reason is that this prevents people to fill the e...

As far as I know there hasn't been changed anything to the pdf's.
And I would certainly not call them horrible, iunformatted and what you were calling them.
Are you sure you are referring to the same documents?

Many languages have an operator that takes two integers and calculates the bitwise xor of those two integers.
That saves the tedious converting to binary and back.
In many languages that operator is ^. (C and derivatives, Java , Python)
In your case that would be: 72^97 which gives 41.

There's actually no need to have looked up the answer somewhere.
Some people simply try some answers around the value their program gives. Just to rule out off by one answers.

I've looked through the thread and that answers about the ace but i still cant work out why im off by one. Is there any chance i could PM you a list of my results for each pair of hands and you let me know which one is wrong? EDIT: I managed to solve it, no help needed anymore Great. Next time plea...

Yes, but not a question you should try to answer here.
Selecting a single sentence from a longer post is not the way to go.
Please let your grey cells do a little bit of working instead of trolling here.

The problem was that you posted something you thought was a solution. Several people tried to answer your questions. In my opinion you have been served enough. Actually Lilstalker didn't ask you a question. Lilstalker translated the question of the problem to the translation if it he gave you. That ...

No, the overviews are not updated because the source files seem to be lost. To prevent your solution to be lost foreverone of the next days I made your post in the forum permanent. I'm going to remove the spoilers in your post. It happens more often that later on new solutions appear in the forums. ...

@Junglemath:
If you think you have formulated a solution you can test it out on the given examples. Don't post one in the hope it will be correct.
PS i've removed your (wrong) assumption.

For the time being I think there has been enough here.
Please stop it now.

If that's your attitude: please go ahead, but before doing so remove yourself from the leaderboard by removing yourself from public view. The leaderboard is for people that solve the problems all by themselves. There's one thing I can tell you: As admin I can view all solution threads. Some 110 prob...

Incidental scraping of public information should pose no problem I think. However, large scale scraping eats our rare resources and is discouraged. If you want to do that for some reason you can have access to public data using the commands you can find in https://projecteuler.chat/viewtopic.php?p=3...

There's another problem with your proposal:
automatically copying things to the user's clipboard might destroy data the user has put there for later use.
If this happens the user can rightfully complain about that.

I'm no expert, but do you think this would be possible on all different operating systems?
All versions of Windows, all versions of macOS, Android, Linux, etc..
Honestly, I doubt it.

That depends: If you talk openly with your friends so that others for years to come can follow your discussion you should be more careful than when you talk with your friends on a private channel. If the discussion is on a public channel I would avoid everything that might serve as a clue. If the di...

The simple answer is: the difficulty assessment is automatically calculated based on solver times.
We've no better way to do it..

Please have a look at the fastest solvers table....

On the Archive page there are up and down arrows above several columns. If you press the up arrow of the 'Solved by' column problems are sorted by the number of solvers in ascending order. If you press the down arrow of the 'Difficulty' column you get the problems sorted by difficulty in descending ...

I don't know if you are aware of the following sites. They might suit your needs better.
https://www.ocf.berkeley.edu/~wwu/riddles/intro.shtml
https://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi