100% Guaranteed Results


Project Euler #8: Largest product in a series Solved
$ 15.99
Category:

Description

5/5 – (1 vote)

This problem is a programming version of Problem 8 from projecteuler.net
Find the greatest product of consecutive digits in the digit number.
Input Format
First line contains that denotes the number of test cases.
First line of each test case will contain two integers & .
Second line of each test case will contain a digit integer.
Constraints

Output Format
Print the required answer for each test case.
Sample Input 0

Sample Output 0

Explanation 0
and selecting consequetive digits, we have
. Where gives maximum product as
, lies in all selection of consequetive digits hence maximum product remains

Reviews

There are no reviews yet.

Be the first to review “Project Euler #8: Largest product in a series Solved”

Your email address will not be published. Required fields are marked *

Related products