Activity for NikNakk
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #290328 | Initial revision | — | about 1 year ago |
| Answer | — |
A: Borromean coprimes [Jelly], 10 bytes ṭŒcg/€ċ1=1 Try it online! A monadic link taking a list of three positive integers and returning 1 if they are Borromean coprimes and 0 if not. TIO link checks all of the test cases. Explanation ``` ṭŒc | Tag original list onto list of combinations of l... (more) |
— | about 1 year ago |
| Edit | Post #290319 |
Post edited: |
— | about 1 year ago |
| Edit | Post #290319 |
Post edited: |
— | about 1 year ago |
| Edit | Post #290319 | Initial revision | — | about 1 year ago |
| Answer | — |
A: Shortest representation in generalised Roman numerals [Jelly], 45 bytes L‘ḃ5MḢ;‘$œṖƲḅ5aị¥⁸N1¦Sṭ “¢¦½2d‘Çȷ6¡iḃ5ị“IVXLC Try it online! A pair of links that takes an integer as its argument and returns a string with the shortest generalised Roman numeral. The TIO link is limited to finding the first 10,000 (rather than million) Roman ... (more) |
— | about 1 year ago |