Search found 2 matches

by phil88
Wed May 21, 2014 10:11 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 008
Replies: 102
Views: 36795

Re: Problem 008

D'oh... must of skipped that post. Changing from int to long long solved that one!
Thanks rayfil!
by phil88
Wed May 21, 2014 9:40 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 008
Replies: 102
Views: 36795

Re: Problem 008

Hi, First time post here... I'm using Project Euler to practice with C++ as it's a coding language I've not used before. On my version of Problem 8, it asks me to find the greatest product of 13 adjacent digits. I've constructed a program (I won't post the code, as per rules) and I've tested it with...