Submission details
Task:Lukujono
Sender:Tmotomaster
Submission time:2025-11-08 20:08:29 +0200
Language:text
Status:READY
Result:0
Feedback
groupverdictscore
#1ACCEPTED0
Test results
testverdicttimescore
#1ACCEPTED0.00 s0details

Code

# Longest odd jump: 65 (@871)
# Longest even leap: 10

# Max amount to A (unpacked; currently 113)
INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A

INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
INCREASE A INCREASE A INCREASE A

PRINT X # Start the conjecture

INCREASE C # Will be nuked when reaches 1 (and if already 1)
INCREASE K
REPEAT X TIMES (
  REPEAT K TIMES (
    REPEAT M TIMES (
      INCREASE N
    )
    INCREASE M
    REPEAT N TIMES (
      CLEAR K # Loop will break
    )
  )
)
REPEAT K TIMES ( # If loop went through (stopped at 1)
  CLEAR C
)

INCREASE I

REPEAT A TIMES (
  REPEAT C TIMES ( # Continue if hasn't reached 1

    CLEAR Y

    CLEAR O
    CLEAR P
    CLEAR Q
    CLEAR A
    CLEAR B
    CLEAR D
    CLEAR E
    CLEAR F
    CLEAR G
    CLEAR H
    CLEAR K
    CLEAR L
    REPEAT X TIMES (
      INCREASE P
      REPEAT O TIMES (
        CLEAR O
        CLEAR P
        INCREASE Q
        INCREASE A # Coefficient of 2

        INCREASE E # Check for division by neljä in addition to division by kaksi
        REPEAT D TIMES (
          CLEAR D
          CLEAR E
          INCREASE F
          INCREASE B # Coefficient of 4

          INCREASE H # Tiny optimization (maybe), but why not kahdeksan too (prob. a bad idea)
          REPEAT G TIMES (
            CLEAR G
            CLEAR H
            INCREASE L
            INCREASE K
          )
          REPEAT H TIMES (
            INCREASE G
            CLEAR K
          )
        )
        REPEAT E TIMES (
          INCREASE D
          CLEAR F
        )
      )
      REPEAT P TIMES (
        INCREASE O
        CLEAR Q
      )
    )

    REPEAT O TIMES (
      CLEAR X
      CLEAR T
      REPEAT F TIMES (
        CLEAR S
        REPEAT B TIMES (
          INCREASE S INCREASE S INCREASE S INCREASE S INCREASE S INCREASE S
          INCREASE S INCREASE S INCREASE S INCREASE S INCREASE S INCREASE S
          INCREASE T INCREASE T INCREASE T INCREASE T INCREASE T INCREASE T
          INCREASE X INCREASE X INCREASE X
        )
        INCREASE S INCREASE S INCREASE S INCREASE S
        INCREASE T INCREASE T
        INCREASE X
        PRINT S
        PRINT T
        PRINT X
      )
      REPEAT E TIMES (
        REPEAT A TIMES (
          INCREASE T INCREASE T INCREASE T INCREASE T INCREASE T INCREASE T
          INCREASE X INCREASE X INCREASE X
        )
        INCREASE T INCREASE T INCREASE T INCREASE T
        INCREASE X INCREASE X
        PRINT T
        PRINT X
      )
    )

    REPEAT Q TIMES (
      CLEAR X
      REPEAT K TIMES (
        CLEAR F
        REPEAT L TIMES (
          INCREASE X
        )
        PRINT A
        PRINT B
      )
      REPEAT F TIMES (
        REPEAT B TIMES (
          INCREASE X
        )
        PRINT A
      )
      REPEAT E TIMES (
        REPEAT A TIMES (
          INCREASE X
        )
      )
      PRINT X
    )

    # Stop if 1 (Clear C)
    INCREASE V
    REPEAT X TIMES (
      REPEAT V TIMES (
        REPEAT Z TIMES (
          INCREASE W
        )
        INCREASE Z
        REPEAT W TIMES (
          CLEAR V # Loop will break
          CLEAR W # Clear everything else if continuing
          CLEAR Z
        )
      )
    )

    # THE SAME PROGRAM UNDERNEATH BUT WITH X AND Y SWAPPED!!! BE CAUTIOUS AND STUFF!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

    

    REPEAT V TIMES ( # If loop went through (stopped at 1)
      CLEAR C
    )
  )
)

Test details

Test 1 (public)

Verdict: ACCEPTED

input
(empty)

correct output
(empty)

user output
# Longest odd jump: 65 (@871)
# Longest even leap: 10

# Max amount to A (unpacked; c...

Feedback: 6 tests processed (invalid output)