Code in C++ only Given an array of size N and two integers K and S, the special sum of a subarray is defined as follows: (Sum of all elements of the subarray) * (K -p * S) Where p = number of distinct prime factors of "product of all elements of the subarray". Find the maximum special sum by considering all non-empty subarrays of the given array. First line contains 3 integers N, K and S. Second line contains N integers, the elements of the array. Output a single integer. The maximum special sum considering all non-empty subarrays of the array. Input 4 10 2 14 27 15 Output 138

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...
icon
Related questions
Question
100%

Please program according to the given guidelines in the question only

Code in C++ only
Given an array of size N and two integers K and S, the special sum of a subarray is defined as follows:
(Sum of all elements of the subarray) * (K - p * S)
Where p = number of distinct prime factors of "product of all elements of the subarray".
Find the maximum special sum by considering all non-empty subarrays of the given array.
First line contains 3 integers N, K and S.
Second line contains N integers, the elements of the array.
Output a single integer. The maximum special sum considering all non-empty subarrays of the array.
Input
4 10 2
14 27 15
Output
138
Transcribed Image Text:Code in C++ only Given an array of size N and two integers K and S, the special sum of a subarray is defined as follows: (Sum of all elements of the subarray) * (K - p * S) Where p = number of distinct prime factors of "product of all elements of the subarray". Find the maximum special sum by considering all non-empty subarrays of the given array. First line contains 3 integers N, K and S. Second line contains N integers, the elements of the array. Output a single integer. The maximum special sum considering all non-empty subarrays of the array. Input 4 10 2 14 27 15 Output 138
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 4 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY