#05AB1E , (削除) 14 (削除ここまで) 13 bytes
05AB1E , (削除) 14 (削除ここまで) 13 bytes
Well, the code is very unlikely to terminate for the numbers bigger than 100000, but if you're patient enough, there will be an output :). Code:
'#¡rJ1sF¤rS\J
Explanation:
'#¡ # Split the input on '#'
r # Reverse the stack
J # Join the stack
1 # Take the first input
s # Swap with the number
F # For N in range(0, number), do...
¤ # Obtain the last character
r # Reverse the stack
S # Split everything to individual characters
\ # Delete the last character
J # Join the stack
Uses CP-1252 encoding
#05AB1E , (削除) 14 (削除ここまで) 13 bytes
Well, the code is very unlikely to terminate for the numbers bigger than 100000, but if you're patient enough, there will be an output :). Code:
'#¡rJ1sF¤rS\J
Explanation:
'#¡ # Split the input on '#'
r # Reverse the stack
J # Join the stack
1 # Take the first input
s # Swap with the number
F # For N in range(0, number), do...
¤ # Obtain the last character
r # Reverse the stack
S # Split everything to individual characters
\ # Delete the last character
J # Join the stack
Uses CP-1252 encoding
05AB1E , (削除) 14 (削除ここまで) 13 bytes
Well, the code is very unlikely to terminate for the numbers bigger than 100000, but if you're patient enough, there will be an output :). Code:
'#¡rJ1sF¤rS\J
Explanation:
'#¡ # Split the input on '#'
r # Reverse the stack
J # Join the stack
1 # Take the first input
s # Swap with the number
F # For N in range(0, number), do...
¤ # Obtain the last character
r # Reverse the stack
S # Split everything to individual characters
\ # Delete the last character
J # Join the stack
Uses CP-1252 encoding
#05AB1E, 14(削除) 14 (削除ここまで) 13 bytes
Well, the code is very unlikely to terminate for the numbers bigger than 100000, but if you're patient enough, there will be an output :). Code:
'#¡rJ1sFSUrXrJ'#¡rJ1sF¤rS\J
Explanation:
'#¡ # Split the input on '#'
r # Reverse the stack
J # Join the stack
1 # Take the first input
s # Swap with the number
F # For N in range(0, number), do...
S # Split into seperate characters
¤ U # TakeObtain the last one and save it to Xcharacter
r # Reverse the stack
S X # PushSplit theeverything lastto characterindividual characters
\ r # ReverseDelete the stacklast againcharacter
J # Join the stack
Uses CP-1252 encoding
#05AB1E, 14 bytes
Well, the code is very unlikely to terminate for the numbers bigger than 100000, but if you're patient enough, there will be an output :). Code:
'#¡rJ1sFSUrXrJ
Explanation:
'#¡ # Split the input on '#'
r # Reverse the stack
J # Join the stack
1 # Take the first input
s # Swap with the number
F # For N in range(0, number), do...
S # Split into seperate characters
U # Take the last one and save it to X
r # Reverse the stack
X # Push the last character
r # Reverse the stack again
J # Join the stack
Uses CP-1252 encoding
#05AB1E, (削除) 14 (削除ここまで) 13 bytes
Well, the code is very unlikely to terminate for the numbers bigger than 100000, but if you're patient enough, there will be an output :). Code:
'#¡rJ1sF¤rS\J
Explanation:
'#¡ # Split the input on '#'
r # Reverse the stack
J # Join the stack
1 # Take the first input
s # Swap with the number
F # For N in range(0, number), do...
¤ # Obtain the last character
r # Reverse the stack
S # Split everything to individual characters
\ # Delete the last character
J # Join the stack
Uses CP-1252 encoding
#05AB1E, 14 bytes
Well, the code is very unlikely to terminate for the numbers bigger than 100000, but if you're patient enough, there will be an output :). Code:
'#¡rJ1sFSUrXrJ
Explanation:
'#¡ # Split the input on '#'
r # Reverse the stack
J # Join the stack
1 # Take the first input
s # Swap with the number
F # For N in range(0, number), do...
S # Split into seperate characters
U # Take the last one and save it to X
r # Reverse the stack
X # Push the last character
r # Reverse the stack again
J # Join the stack
Uses CP-1252 encoding
#05AB1E, 14 bytes
Well, the code is very unlikely to terminate for the numbers bigger than 100000, but if you're patient enough, there will be an output :). Code:
'#¡rJ1sFSUrXrJ
Uses CP-1252 encoding
#05AB1E, 14 bytes
Well, the code is very unlikely to terminate for the numbers bigger than 100000, but if you're patient enough, there will be an output :). Code:
'#¡rJ1sFSUrXrJ
Explanation:
'#¡ # Split the input on '#'
r # Reverse the stack
J # Join the stack
1 # Take the first input
s # Swap with the number
F # For N in range(0, number), do...
S # Split into seperate characters
U # Take the last one and save it to X
r # Reverse the stack
X # Push the last character
r # Reverse the stack again
J # Join the stack
Uses CP-1252 encoding