A place to air possible concerns or difficulties in understanding ProjectEuler problems. This forum is not meant to publish solutions. This forum is NOT meant to discuss solution methods or giving hints how a problem can be solved.
Forum rules
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
In particular don't post any code fragments or results.
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
hk wrote:Thanks.
I'm still a bit baffled why:
"there are exactly 2060 cuboids for which the shortest distance is integer when M=100," doesn't raise any thorn.
Should be: "there are exactly 2060 cuboids for which the shortest distance is an integer when M=100"
Most people probably inserted the article subconsiously, without realizing it was missing.
IMHO "shortest distance is an integer" is less clumsy than "shortest route has integer length".
thundre wrote:
Should be: "there are exactly 2060 cuboids for which the shortest distance is an integer when M=100"
Most people probably inserted the article subconsiously, without realizing it was missing.
IMHO "shortest distance is an integer" is less clumsy than "shortest route has integer length".
I agree with you, but I don't think hk likes using "an" here (although I'm not sure why) -- same reason why he didn't change the earlier case to "an integer."
Look good into the proposed sentence for the first case:
"The shortest route is not always an integer"
A route cannot be an integer, at least not in my opinion.
A route is a path you follow. One of the properties it can have is its length.
I think my criticism about that proposed sentence has a deeper meaning than peculiarities of some language or other.
War ruins the life and health of untold numbers of innocent children.
I'm missing 665, 755, 761, and 854.
I checked 665, and the three "shortest paths" are 12.53, 12.53, and 13. So the shortest path is not 13. As I understand the problem, this should not be included.
I would strongly suggest you read this thread from the start.
I have and I'm still not sure what's wrong.
Is 665 a solution or not? I'm getting that it's not because there are shorter paths than 13, but it was included in thundre's list, so I'm not sure.
The other thread is a mess of semantics and word disputes so I'm starting a new one. The accepted answer does not match mine so here I am. I have used my algorithm to compute correctly:
99, 1975
100, 2060
in accordance with the example provided. My number that results in 1,000,000 is nowhere near the official answer. Using some predictive analysis, you can guess where my answer falls based on this chart. Do you have any pointers for someone that correctly arrives at the example but whose following results look like this: http://i.imgur.com/eFHHM.png
Thanks
If your answer lies close to where that graph suggests, then your answer is too low. That means your value has less than a million solutions, so if you write some additional code that ensures each of your million solutions is valid and unique then you'll find your problem.
@garyp.
It's not up to you to decide a new topic must be created.
So I merged the two topics.
The reason for that is that it isn't helpful to have more than one thread for a problem.
Everybody after you would have to scan both threads which makes this forum yet more messy.
(And thanks for having forced me to do some moderating)
War ruins the life and health of untold numbers of innocent children.