Project Question

[G854izwU]

So im on Problem 8 on Project Euler and the problem is now.

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

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

I am going to be honest with you this completely confuses me! The problems took a huge jump from 7 to 8 in skill level and I'm a bit stuck. The reason I am doing these problems is to learn but I have NO idea where to start! If somebody could just give me a bit of an idea where to start I would be very grateful! If any of you decide to help me out at all please don't post any source code as I want to try to write all the code by myself but any advice on what my code might need to include would be great! Thanks

-TheNewKid-

[oonej]

its really not hard, all you do is group the first 5... store it, then compare it with the 2nd 3rd 4th 5th 6th numbers and see if its a greater product ... rinse and repeat till the end of the document

[G854izwU]

I get that part, that's not what I'm confused about. I just don't know how to store the 1000 digit number so that I can work with it. Any ideas?

[LB]

std::string?

std::string num =
"73167176531330624919225119674426574742355349194934"
"96983520312774506326239578318016984801869478851843"
"85861560789112949495459501737958331952853208805511"
"12540698747158523863050715693290963295227443043557"
"66896648950445244523161731856403098711121722383113"
"62229893423380308135336276614282806444486645238749"
"30358907296290491560440772390713810515859307960866"
"70172427121883998797908792274921901699720888093776"
"65727333001053367881220235421809751254540594752243"
"52584907711670556013604839586446706324415722155397"
"53697817977846174064955149290862569321978468622482"
"83972241375657056057490261407972968652414535100474"
"82166370484403199890008895243450658541227588666881"
"16427171479924442928230863465674813919123162824586"
"17866458359124566529476545682848912883142607690042"
"24219022671055626321111109370544217506941658960408"
"07198403850962455444362981230987879927244284909188"
"84580156166097919133875499200524063689912560717606"
"05886116467109405077541002256983155200055935729725"
"71636269561882670428252483600823257530420752963450";

(string literals concatenate, so there are no newline characters)

[oonej]

or store them into an array..

[LB]

Fine then - const char *num = ...you know the rest.

[G854izwU]

Like I said earlier I'm not that far in C++ yet this is the most advanced program I have made so far so if you could dumb down what you mean and explain a bit L B that would be great!

Like what does std:: do?

[LB]

Whether you use std:;string or const char *, you can just access the elements like this:
num[index]
Though, with std::string you can get the size of it:
num.size()


Hint: consider looping.

[G854izwU]

Thanks guys!