Lukujono

# Longest Collatz conjecture: 113 (@871)

# 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

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

    REPEAT L TIMES ( # If swapping variables requested...
      REPEAT J TIMES (
        INCREASE T
      )
      REPEAT I TIMES (
        INCREASE J
        CLEAR I
      )
      REPEAT T TIMES (
        INCREASE I
        CLEAR J
        CLEAR T
      )
      CLEAR L
    )

    REPEAT I TIMES (
      CLEAR Y

      CLEAR O
      CLEAR P
      CLEAR Q
      CLEAR A
      REPEAT X TIMES (
        INCREASE P
        REPEAT O TIMES (
          CLEAR O
          CLEAR P
          INCREASE Q
          INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
          INCREASE Y INCREASE Y INCREASE Y
        )
        REPEAT P TIMES (
          INCREASE O
          CLEAR Q
        )
      )

      REPEAT O TIMES ( # If odd
        INCREASE A INCREASE A INCREASE A INCREASE A
        INCREASE Y INCREASE Y
        PRINT A
        PRINT Y
      )

      REPEAT Q TIMES ( # If even
        CLEAR Y
        REPEAT X TIMES (
          INCREASE E
          REPEAT D TIMES (
            INCREASE Y
            CLEAR D
            CLEAR E
          )
          REPEAT E TIMES (
            INCREASE D
          )
        )
        PRINT Y
      )

      # Stop if 1 (Clear C)
      INCREASE V
      REPEAT Y 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
          )
        )
      )

      INCREASE L
    )

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

    REPEAT J TIMES (
      CLEAR X

      CLEAR O
      CLEAR P
      CLEAR Q
      CLEAR A
      REPEAT Y TIMES (
        INCREASE P
        REPEAT O TIMES (
          CLEAR O
          CLEAR P
          INCREASE Q
          INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A
          INCREASE X INCREASE X INCREASE X
        )
        REPEAT P TIMES (
          INCREASE O
          CLEAR Q
        )
      )

      REPEAT O TIMES ( # If odd
        INCREASE A INCREASE A INCREASE A INCREASE A
        INCREASE X INCREASE X
        PRINT A
        PRINT X
      )

      REPEAT Q TIMES ( # If even
        CLEAR X
        REPEAT Y TIMES (
          INCREASE E
          REPEAT D TIMES (
            INCREASE X
            CLEAR D
            CLEAR E
          )
          REPEAT E TIMES (
            INCREASE D
          )
        )
        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
          )
        )
      )

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

Test 1 (public)

Verdict: ACCEPTED