Python

01 November 2024 14:22

ah i see thanksss bro😁

Python

01 November 2024 14:17

Do you use linux or windows

Python

01 November 2024 14:15

But that formula got the right answer for n = 1 - 4😭

Python

01 November 2024 14:14

then I have no idea 😂

Python

01 November 2024 14:13

Can you find the syntax to increase allowed execution time and apply it

Python

01 November 2024 14:08

this is known as tabulation btw. (alternative to memorization with recursion)

Python

01 November 2024 14:05

can you give some samples for me to validate the output I generated.

Python

01 November 2024 14:04

if n so small i can find the answer

Python

01 November 2024 14:03

output = 'Execution Timed Out (12000ms)'

Python

01 November 2024 14:00

still the same get 'Execution Timed Out (12000ms)'

Python

01 November 2024 13:36

how about you use for loop to replace recursion instead

Python

01 November 2024 13:34

yes, u right. im sorry for misinterpreted. but what i get is this one 'Execution Timed Out (12000 ms)'

Python

01 November 2024 13:32

Oh i see. sorry, maybe I misinterpreted. What I mean by wrong output is that it does not provide a correct and appropriate solution to what the case provider requested😁

Python

01 November 2024 13:26

but with all due respect, I appreciate what I just learned from your response

Python

01 November 2024 13:23

the code that i gave its right but i need to make that code is effective. I mean like its more faster ya with memo or using loop its get the right answer and there's nothing wrong with that. But i want to ask in this group especially ask to u can u gave me more effective than memo or using loops? That's my point bro

Python

01 November 2024 14:20

timeout /t 3600 your_script.py

In terminal

Python

01 November 2024 14:16

how? idk how to apply increase of execution time

Python

01 November 2024 14:15

i try with mathematics way with this formula 3(n² - 1) + 3n

Python

01 November 2024 14:14

so sorry the output still same😔

Python

01 November 2024 14:08

ok i will try this code thanks

Python

01 November 2024 14:07

def find_x(n):
    if n == 0: return 0

    table = [0] * (n + 1)

    for i in range(1, n + 1):
        table[i] = table[i - 1] + 3 * i
        for j in range(1, i):
            table[i] += table[j - 1] + 3 * j

    return table[n]

Python

01 November 2024 14:04

but if n > 10³ idk why can't find the answer

Python

01 November 2024 14:04

do you know the answer?

Python

01 November 2024 14:01

can you give some input and output for testing?

Python

01 November 2024 13:59

yup. are you mange to do it?

Python

01 November 2024 13:35

if i use memoization too i get that output

Python

01 November 2024 13:32

Sounds like does not produce the correct output, which means the code is wrong.

Python

01 November 2024 13:30

You need to be careful with what you say. When the code produces the correct output but isn't fast enough, it isn't wrong. It just not satisfies the requirements. If it produces the wrong output, it's wrong.

Python

01 November 2024 13:24

There's nothing wrong with asking whether it's possible here to know how to get the mathematical formula wisely or what? who knows?

Python

01 November 2024 13:20

I give you another example:

Here is wrong code. I need a formula from it to make it faster. Oh, and it's wrong code. It produces the wrong result. How could you possibly answer that?