Problem 008

[AndriiLastivka]

Hey. I am confused on what is meant by 'adjacent' in this problem? Does it mean adjacent horizontally, vertically and diagoally?

Thanks

[jaap]

Hey. I am confused on what is meant by 'adjacent' in this problem? Does it mean adjacent horizontally, vertically and diagoally?

Thanks

It is one long 1000 digit number, so there is no vertically or diagonally adjacent. It is only split over several lines so that it fits on the screen.

[programmer_]

Can someone explain me briefly what the Problem 8 says?

[Georg]

Find the greatest product of 13 consecutive digits in the 1000-digit number.

[hk]

@programmer_:
If you'd read the topics in the pink box:
-you'd found that there already existed a topic for this problem
-you'd called your post "Problem 008" instead of "Problem 8"
Please make the work of the moderators as easy as possible and read and follow instructions.

[horcle_buzz]

To the admins, please read my comment on the forum for Project 8 solutions. This is STILL unclear, and I was able to FINALLY solve it via a whim I had. The problem is POORLY presented and confusing for such a simple solution.

[mpiotte]

To the admins, please read my comment on the forum for Project 8 solutions. This is STILL unclear, and I was able to FINALLY solve it via a whim I had. The problem is POORLY presented and confusing for such a simple solution.

Please don't create a new topic when one already exist for a problem.
It you had any doubt about the meaning of the question, I'm sure the existing topic here would have resolved them.

[jumbledwords]

I've found that a solution for Problem 8 that produces a larger product than the answer the problem accepts as correct. The 13 digits I've found are adjacent.

[Animus]

PM sent to jumbledwords.
edit: Question solved.

[Utsav_22]

I am unable to solve the question 8 and 11 properly using C language

[rayfil]

This seems to leave you with at least two choices if you want to continue enjoying solving problems on Project Euler. i.e.:

A. Continue learning how to use the C programming language. Many other participants have already succeeded solving those problems using that language.
B. Start learning some other programming language. However, you may reach the same dilemma if you don't become sufficiently proficient in that other language.

[Freiling]

The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.

73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450

Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?

Since 9989 appear consecutively, I am guessing that's what they mean. Finding for adjacent numbers would be far harder. Am I correct in my interpretation?

[kenbrooker]

Absotively, although, without checking, 9989 may also appear elsewhere (or even 9999)
"adjacently," only because the 1000-digit number is not presented as a number,
"consecutively" and "contiguously(?)"...

IOWords, IMHOpinion, your rewording is...
Superior Freiling

I guess an Administrator may move us to
Clarifications on PE Problems?

[sjhillier]

Thanks, post moved as suggested.

In terms of an answer, your alternative wording might indeed be better, but personally I'm reluctant to change the wording of a problem that has been around for so long. The older the problem, the more the wording should stand I feel, unless it really is misleading, but others may feel differently.

[kenbrooker]

Thanks sjhillier and I agree with your feeling that the wording is not necessarily misleading
if one keeps in mind that the problem refers to a "number",
not to a two-dimensional array...

Or, as jaap posted, 4 years ago,
to the nearest day --

Re: Problem 008
Post by jaap » Thu Feb 26, 2015 4:08 am

AndriiLastivka wrote:
Hey. I am confused on what is meant by 'adjacent' in this problem? Does it mean adjacent horizontally, vertically and diagoally?
Thanks

It is one long 1000 digit number, so there is no vertically or diagonally adjacent. It is only split over several lines so that it fits on the screen.

[Freiling]

Ah, I see. I was unable to find that when searching. My apologies for the redundant post.

[kenbrooker]

I am just as "guilty" by finding jaap's post last instead of in the first place...

[funk_r]

Hello Admins,

I have to state that the wording of this quest misled me too.
Adjacent numbers in my understanding are something like this 3->4->5 and vice versa.
(structural neighborhood) but you ask for positional neighborhood.
Choose any position in the number take the next 13 consecutive digit. Find the position giving the maximum.

[hk]

The problem isn't about adjacent numbers but about adjacent digits.

[SawyerWest]

For some reason my program is finding the correct answer for 1, 2, 3, and 4 adjacent digits (I've tested) but for some reason not 13 digits (although it looks fine)? Am I allowed to post results for input != 13 to discuss?