I have to write a JAVA program that'll solve the following problem. What 13 digits give the highest product and what Is said product?? I tried to run the code in Online GDB compiler and got the following 2 last screenshot. This is my code so far and I wish to know if it is correct.... import java.util.Scanner;public class Main{public static void main(String[] args){Scanner sc = new Scanner(System.in);int[] array = new int[1000];for (int i = 0; i < 1000; i++){array[i] = sc.nextInt();}long p = 1;for (int i = 0; i < 13; i++){p = p * array[i];}long ma=p;for (int i = 13; i < 1000; i++){ if(array[i-13]!=0) { long np = (p/array[i-13])*array[i];if(np>ma){ma=np;}p=np; }}System.out.println(ma);}} inputstdoutstderrCompiled Successfully. memory: 34004 time: 0.18 exit code: 05000940 Largest product in a seriesProblem 8The four adjacent digits in the 1000-digit number that have the greatest product are 9 x 9 x 8 × 9 = 5832.7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?

I think your code is wrong for above problem: import java.util.Scanner; public class Main {…

Answered: have to write a JAVA program that'll…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

I have to write a JAVA program that'll solve the following problem. What 13 digits give the highest product and what Is said product?? I tried to run the code in Online GDB compiler and got the following 2 last screenshot. This is my code so far and I wish to know if it is correct....

import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int[] array = new int[1000];
for (int i = 0; i < 1000; i++)
{
array[i] = sc.nextInt();
}
long p = 1;
for (int i = 0; i < 13; i++)
{
p = p * array[i];
}
long ma=p;
for (int i = 13; i < 1000; i++)
{
if(array[i-13]!=0)
{
long np = (p/array[i-13])*array[i];
if(np>ma)
{
ma=np;
}
p=np;
}