I'm working on code to solder the Project Euler problem #8. This is the one
where you have to find the greatest product of any five digits found in order
in a one thousand digit number. It sort of worked briefly. This version
worked(I had line 25 uncommented):
https://github.com/wackyvorlon/mar
On Aug 14, 2012, at 2:57 PM, Paul Anderson wrote:
> I'm working on code to solder the Project Euler problem #8. This is the one
> where you have to find the greatest product of any five digits found in order
> in a one thousand digit number. It sort of worked briefly. This version
> worked(I h
Well, now I feel sufficiently stupid:) Thanks!
On 2012-08-14, at 6:19 PM, Jim Gibson wrote:
>
>>
>
> Have you tried printing out the values of ($1,$2,$3,$4,$5), $cur, and pos
> $numb for each iteration? I think you will find it most informative to do so.
>
> Hint: you should be using a whil
Paul Anderson wrote:
[ snip ]
#!/usr/bin/myperl -w
# euler8.pl --- Euler Problem 8
# Author: Paul Anderson
# Created: 14 Aug 2012
# Version: 0.01
use warnings;
use diagnostics;
use 5.16.0;
#use strict;
no strict;
# The number.
$numb="7316717653133062491922511967442657474235534919493496983
