Submission details
Task:Lukujono
Sender:Tmotomaster
Submission time:2025-11-09 20:13:23 +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 B (unpacked; currently 113)
INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B
INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B
INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B
INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B
INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B
INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B
INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B
INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B
INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B
INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B

INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B INCREASE B
INCREASE B INCREASE B INCREASE B

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
)

REPEAT X TIMES ( # Calculate half A and first oddness O
  INCREASE P
  REPEAT O TIMES (
    CLEAR O
    CLEAR P
    INCREASE A
  )
  REPEAT P TIMES (
    INCREASE O
  )
)

INCREASE R

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

    CLEAR Q
    INCREASE Q
    REPEAT O TIMES (
      CLEAR Q
    )

    REPEAT O TIMES (
      CLEAR O
      INCREASE Q
      REPEAT A TIMES (
        INCREASE A INCREASE A
      )
      INCREASE A INCREASE A

      CLEAR S
      REPEAT A TIMES (
        INCREASE S INCREASE S
      )
      PRINT S
    )

    REPEAT Q TIMES (
      CLEAR B
      CLEAR D
      CLEAR E
      REPEAT A TIMES (
        INCREASE E
        REPEAT D TIMES (
          CLEAR D
          CLEAR E
          INCREASE B
        )
        REPEAT E TIMES (
          INCREASE D
        )
      )
      CLEAR A
      CLEAR O
      REPEAT B TIMES (
        INCREASE A
      )
      REPEAT D TIMES (
        INCREASE O
      )

      CLEAR S
      REPEAT A TIMES (
        INCREASE S INCREASE S
      )
      REPEAT O TIMES (
        INCREASE S
      )
      PRINT S
    )

    # 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 B (unpacked; c...

Feedback: 1 tests processed (invalid output)