Hello can anyone help me with my game

Help
21

Life cycle works too!

It also has player knocked out.

1 Like
22

thanks guys this is really helping but I cant seem to get anything to happen with the code.

23

What code? The code for powers?

24

yes that one how does it work?

25

The fireball one?
you trying to code that?

oh nononononon…

1 Like
26

I am but the blocks are so basic

27

I don’t think you can code in fireballs.

28

theres some super advanced code for it

29

Ahh… Maybe I should try. You should make a guide about how to code in fireballs.

30

You might consider not doing it if you (No offense) aren’t so good at coding

31

What are you thinking, how do you want the fireball to be like?

32

Read my description.

33

the fireballs need to be red and orange.

34

there are, as said, 1228800 combinations.
that is JUST the barriers alone.
the barriers alone could cost you 2 times more memory than you have in game.
THATS JUST THE BARRIERS.

so ur good at block code?

ok, then.
I am currently having a problem, in which I need a script that can extract a substring from a body text without using recursions, (well, maybe a set amount of recursions could be fine) separated by comas.

if u could solve this, I’ll be impresed :grin:

35

Try this:

def getslice(k, s, t):
    def recur(xsize, s, t):
        if xsize == 0 or s >= xsize or t <= 0:
            return ""
        smaller = (xsize - 3) // 2
        return ( ("1" if s <= 0 else "")
               + recur(smaller, s-1, t-1)
               + ("2" if s <= smaller+1 < t else "")
               + recur(smaller, s-smaller-2, t-smaller-2)
               + ("3" if t >= xsize else "") )
    return recur(3 * (2**k - 1), s, t)
K is the string.
36

My brain hurts but i… nvr mind

37

Or this:

from functools import lru_cache
from typing import *


def f_len(k) -> int:
    return 3 * ((2 ** k) - 1)


@lru_cache(None)
def f(k) -> str:
    if k == 1:
        return "123"
    return "1" + f(k - 1) + "2" + f(k - 1) + "3"


def substring_(k, s, t, output) -> None:
    # Empty substring.
    if s >= t or k == 0:
        return

    # (An optimization):
    # If all the characters need to be included, just calculate the string and cache it.
    if s == 0 and t == f_len(k):
        output.append(f(k))
        return

    if s == 0:
        output.append("1")

    sub_len = f_len(k - 1)
    substring_(k - 1, max(0, s - 1), min(sub_len, t - 1), output)

    if s <= 1 + sub_len < t:
        output.append("2")

    substring_(k - 1, max(0, s - sub_len - 2), min(sub_len, t - sub_len - 2), output)

    if s <= 2 * (1 + sub_len) < t:
        output.append("3")


def substring(k, s, t) -> str:
    output: List[str] = []
    substring_(k, s, t, output)
    return "".j.o.i.n.(output)


def test(k, s, t) -> bool:
    actual = substring(k, s, t)
    expected = f(k)[s:t]
    return actual == expected


assert test(1, 0, 3)
assert test(2, 2, 6)
assert test(2, 1, 5)
assert test(2, 0, f_len(2))
assert test(3, 0, f_len(3))
assert test(8, 44, 89)
assert test(10, 1001, 2022)
assert test(14, 12345, 45678)
assert test(17, 12345, 112345)
# print(substring(30, 10000, 10100))
print("Tests passed")
38

It’s Python Code:).

39

I think they meant Gimkit Block Code lol

1 Like
40

I mostly do python code :snake:. I don’t really do gimkit code cause it’s a little to easy for me.