Largest product in a series

Computer Science Level 3

The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.

The 1000 digit Number is Here

Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?

Try other problems Here


The answer is 23514624000.

Rishabh Deep Singh by Rishabh Deep Singh , 23, India

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Masbahul Islam
Nov 22, 2017

1 Helpful 0 Interesting 0 Brilliant 0 Confused 
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
 
public class Main {
    public static void main( String[] args ) {
        final String num = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450";
        long greatestProduct = 0;
        for (int i = 0; i < num.length() - 12; i++) {
            long sum = (long)Character.getNumericValue(num.charAt(i))*
                    Character.getNumericValue(num.charAt(i+1))*
                    Character.getNumericValue(num.charAt(i+2))*
                    Character.getNumericValue(num.charAt(i+3))*
                    Character.getNumericValue(num.charAt(i+4))*
                    Character.getNumericValue(num.charAt(i+5))*
                    Character.getNumericValue(num.charAt(i+6))*
                    Character.getNumericValue(num.charAt(i+7))*
                    Character.getNumericValue(num.charAt(i+8))*
                    Character.getNumericValue(num.charAt(i+9))*
                    Character.getNumericValue(num.charAt(i+10))*
                    Character.getNumericValue(num.charAt(i+11))*
                    Character.getNumericValue(num.charAt(i+12));
            if (sum > greatestProduct)
                greatestProduct = sum;
        }
        System.out.println(greatestProduct);
    }
}

0 Helpful 0 Interesting 0 Brilliant 0 Confused

for j in range(1,13): product*=int(st[i+j])

Hasmik Garyaka - 3 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...