Post History
Vyxal, 24 bytes 16ʀẋfÞ×'ẏ16$e*∑?=;hṘk6i∑ Try it Online! All this when just H, 16R, or even k6τ would have sufficed. Times out for every input > 100 Explained 16ʀẋfÞ×'ẏ16$e*∑?=;hṘk6i∑...
#2: Post edited
by
lyxal
·
2025-04-11T23:54:57Z (7 days ago)
# [Vyxal](https://github.com/Vyxal/Vyxal/tree/version-2), 3 bytes- ```
k6τ- ```
[Try it Online!](https://vyxal.pythonanywhere.com/?v=1&c=1#WyIiLCIiLCJrNs+EIiwiIiwiMTUzIl0=)Very simple- ## Explained
- ```
k6ττ # Convert to basek6 # "0123456789ABCDEF"```
- # [Vyxal](https://github.com/Vyxal/Vyxal/tree/version-2), 24 bytes
- ```
- 16ʀẋfÞ×'ẏ16$e*∑?=;hṘk6i∑
- ```
- [Try it Online!](https://vyxal.pythonanywhere.com/?v=2&c=1#WyIiLCIiLCIxNsqA4bqLZsOew5cn4bqPMTYkZSriiJE/PTto4bmYazZp4oiRIiwiIiwiMTgiXQ==)
- 
- All this when just `H`, `16R`, or even `k6τ` would have sufficed.
- Times out for every input > 100
- ## Explained
- ```
- 16ʀẋfÞ×'ẏ16$e*∑?=;hṘk6i∑
- 16ʀẋ # Repeat the range [0, 16) (input) times.
- f # And flatten into a single list.
- Þ× # Get every possible combination with repetition of all possible lengths.
- # (This is why it times out for large inputs)
- # (Because it needs to be long enough to have the correct output in theory)
- ' ; # Keep combinations where:
- ẏ16$e*∑ # (x_0 * 16 ^ 0) + (x_1 * 16 ^ 1) + (x_2 * 16 ^ 2) + ...
- = # equals
- ? # the input
- h # Get the first combination
- k6i # And get the corresponding characters in the string "0123456789ABCDEF"
- ∑ # Join into a single string
- 💎
- ```
- Created with the help of [Luminespire](https://vyxal.github.io/Luminespire).
#1: Initial revision
by
lyxal
·
2025-04-11T05:59:27Z (8 days ago)
# [Vyxal](https://github.com/Vyxal/Vyxal/tree/version-2), 3 bytes ``` k6τ ``` [Try it Online!](https://vyxal.pythonanywhere.com/?v=1&c=1#WyIiLCIiLCJrNs+EIiwiIiwiMTUzIl0=) Very simple ## Explained ``` k6τ τ # Convert to base k6 # "0123456789ABCDEF" ```