Project Euler - 8

Esta é uma implementação para o problema 8 do Project Euler: Encontrar em um número de 1000 dígitos, o maior número da multiplicação de 13 dígitos adjacentes.

Clear-Host

[String]$milDig = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"
[Long]$Multi13 = 0
[Long]$curMulti = 0
$dig = (0,0,0,0,0,0,0,0,0,0,0,0,0)
$digSalvo = (0,0,0,0,0,0,0,0,0,0,0,0,0)

For ([Int32]$i=0; $i -lt 988; $i++) {
    For ($d=0;$d -lt 13;$d++) {
        $dig[$d] = [convert]::ToInt32($mildig[$i+$d],10)
    }    
    $curMulti = $dig[0]*$dig[1]*$dig[2]*$dig[3]*$dig[4]*$dig[5]*`
        $dig[6]*$dig[7]*$dig[8]*$dig[9]*$dig[10]*$dig[11]*$dig[12]

    If ($curMulti -gt $Multi13) { 
        $Multi13 = $curMulti
        For ([Int32]$d=0;$d -lt 13;$d++) {
            $digSalvo[$d] = $dig[$d]
        }
    }
}

Write-Host "Dígitos adjacentes com maior produto são:"
Write-Host $digSalvo[0] "x" $digSalvo[1] "x" $digSalvo[2] "x" $digSalvo[3] "x"`
           $digSalvo[4] "x" $digSalvo[5] "x" $digSalvo[6] "x" $digSalvo[7] "x"`
           $digSalvo[8] "x" $digSalvo[9] "x" $digSalvo[10] "x" $digSalvo[11] "x"`
           $digSalvo[12] "=" $Multi13

Os 13 dígitos adjacentes com maior produto são:
5 x 5 x 7 x 6 x 6 x 8 x 9 x 6 x 6 x 4 x 8 x 9 x 5 = 23514624000