Scroll down to see how it works. If you'd rather solve the problem yourself, don't scroll. . . . . . How it works (this is a spoiler): ========================================= We start with a variable, number, which contains the long (1000 digit number). We then take a var called "start loc", which will contain the position of the first character of our 13-character string of numbers. We take all thirteen and multiply them together, checking to see if they make the largest product. (If so, set them as the new largest.) We do this for ever start loc value from 1 to 1000 - 13 (so we don't go past the end of the number.) We end up with the largest product.
The @ProjectEuler account is created and maintained by @PullJosh. If you have questions, feel free to comment here or on my @PullJosh profile page for a much quicker response.
