Problem 790

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


See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
Post Reply
mdean
Posts: 206
Joined: Tue Aug 02, 2011 2:05 am

Problem 790

Post by mdean »

This may be a dumb question, but what is the definition of "grid square"? I'm picturing like a sheet of graph paper with lines at integer values of x and y and the smallest possible squares with integer coordinates. For example, $3\le x\le 4$ and $20\le y\le 21$ would be a grid square. However, if that were the case, there would be fewer than 196 clocks in the example interval.

196 seems to suppose each coordinate is a grid square, like $(4,20)$ contains a clock. So this I assume this grid would be more like a spreadsheet with each box having one set of (x,y) coordinates?
Image
User avatar
hk
Administrator
Posts: 12832
Joined: Sun Mar 26, 2006 10:34 am
Location: Haren, Netherlands

Re: Problem 790

Post by hk »

Probably it would have been better to call it "in each grid point" instead of square.
Image
War ruins the life and health of untold numbers of innocent children.
Post Reply