I need help to solve this programming question

Question

1.00/5 (2 votes)

See more:

Large Sub-Arrays | Practice Problems[^]

I can not solve this problem. Anyone helps me to solve this problem with an explanation?

What I have tried:

I solve this problem like this --

def solve(arr,n,m,k):
    A = []
    for _ in range(m):
        A.extend(arr)
    c = 0
    for i in range(len(A)):
        summation = 0


        for j in range(i,len(A)):
            summation+=A[j]
            if summation<=k:
                c+=1
    return c
 
t = int(input())
for _ in range(t):
    N,M,K = map(int,input().split())
    array = list(map(int,input().split()))
    out_ = solve(array,N,M,K)
    print(out_)

But I need more optimized solution with explanation. please help.

Posted 16-Jul-21 6:14am

Ankit-Lodh

Updated 16-Jul-21 12:14pm

v2

Add a Solution

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

OriginalGriff · Answer 1 · 2021-07-16T06:21:00

While we are more than willing to help those that are stuck, that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did.

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]

Patrice T · Answer 2 · 2021-07-16T12:14:00

Quote:
I need help to solve this programming question

The problem comes from a challenge site, this means that you need to be smart, and a brute force program is never the solution. You need to find ways to avoid unnecessary work, and/or find ways to reduce work.

Quote:
But I need more optimized solution with explanation. please help.

The problem is that your code is so brute force that it need a complete rewrite.
First of all, you need to understand the logic of the solution:

Try this by hand:
2
3 2 2
3 1 5
3 3 2
3 1 5
Then
2
3 1000 2
3 1 5
3 10000 2
3 1 5

Do you need to copy 1000 times the sequence and check every single possible sequence ?
Or you can find a better way?
'Better ways' is your optimization.

Every single sequence is a triangular number, it means that for a sequence of 3000, number of subsequences is 3000*3001/2= 4501500 subsequences.
Triangular number - Wikipedia[^]

I need help to solve this programming question

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0