20Ý25ª3Lδ*˜¨ãOZÝsK
@Grimyのおかげで-3バイト。
デカルト積が組み込まれているため、入力が大きくなると、すぐにタイムアウトしã
ます。
オンラインそれを試してみたり、さらにいくつかのテストケースを検証します。
説明:
20Ý # Push a list in the range [0, 20]
25ª # Append 25 to this list
3L # Push a list [1,2,3]
δ* # Multiply the top two lists double-vectorized:
# [[0,0,0],[1,2,3],[2,4,6],[3,6,9],...,[20,40,60],[25,50,75]]
˜ # Flatten this list: [0,0,0,1,2,...,40,60,25,50,75]
¨ # Remove the last value (the 75)
ã # Create all possible combinations of the (implicit) input size,
# by using the cartesian power
O # Sum each inner list of input amount of values together
Z # Get the maximum (without popping the list), which is 60*input
Ý # Create a list in the range [0, 60*input]
s # Swap so the initially created list is at the top of the stack again
K # And remove them all from the [0, 60*input] ranged list
# (then output the result implicitly)