Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »

Activity for Shaggy‭

Type On... Excerpt Status Date
Comment Post #296063 `true` or `false` (or truthy or falsey) is sufficient here to answer the challenge. Requiring that we output the equation if `true` or "Impossible" if `false` is just cumbersome. See https://codegolf.meta.stackexchange.com/a/8077/58974
(more)
4 months ago
Comment Post #296063 I'd recommend changing the cumbersome output format before anyone posts a solution. The core of this challenge is a decision problem, requiring such a specific ouput, in my opinion, adds nothing to it other than unnecessary overhead for all solutions.
(more)
5 months ago
Edit Post #295976 Post edited:
5 months ago
Edit Post #295977 Post edited:
5 months ago
Edit Post #295976 Post edited:
5 months ago
Edit Post #295977 Post edited:
5 months ago
Edit Post #292279 Post edited:
5 months ago
Edit Post #295982 Initial revision 5 months ago
Answer A: Is it stuck in a counting loop?
Japt `-x¡`, 14 bytes £NÎeU=£¯YÄ è¶X Try it
(more)
5 months ago
Edit Post #295976 Post edited:
5 months ago
Edit Post #295976 Post edited:
5 months ago
Edit Post #295978 Initial revision 5 months ago
Answer A: Single digit Roman numeral
Japt v2.0a0, 22 bytes n"IXCMVLD" gFì ï4ÆApX Try it (includes all test cases) n"..." gFì ï4ÆApX :Implicit input of character string n"..." :Convert from custom base to decimal g :Index into F : 15 ...
(more)
5 months ago
Comment Post #293713 https://tio.run/##FcdBCoAgEAXQq7icyQK1XVB3mTAryJ9YLTq95e699N7bib6UMB4SZy8KAyYj8MrpQOgsa9dUuIrriRQlUWizYF0IzFxS3nFTIGv@fA
(more)
5 months ago
Edit Post #295977 Initial revision 5 months ago
Answer A: Give the fool's fibonacci sequence
JavaScript, 40 bytes f=x=>x>3?f(x-3)4+f(x-6)-f(x-9)2:x>0&&2 Try it online! 53 52 bytes Outputs the complete sequence, from my original misinterpretation, backed up by the existing solutions, that every 3rd value in our sequence must match the corresponding value in the original se...
(more)
5 months ago
Edit Post #295976 Post edited:
5 months ago
Edit Post #295976 Initial revision 5 months ago
Answer A: Give the fool's fibonacci sequence
Japt, 23 bytes >0©3ò4ÈßUµ3ÃxÒUÆßX}3 x Try it 23 22 20 bytes Outputs the complete sequence, from my original misinterpretation, backed up by the existing solutions, that every 3rd value in our sequence must match the corresponding value in the original sequence. ©2õÈßTwXnUÃx...
(more)
5 months ago
Edit Post #295975 Initial revision 5 months ago
Answer A: Reverse the bits in a Byte
Japt, 7 bytes I/O as an integer ¤ùT8 ÔÍ Try it
(more)
5 months ago
Edit Post #295974 Initial revision 5 months ago
Answer A: Expected value of highest dice rolled
Japt v2.0a0, 10 bytes 6-5õ÷6 xpU Try it
(more)
5 months ago
Comment Post #295346 I think you need to clarify that _something_ needs to be output and that that something must be empty. As it stands this could be interpreted that not outputting _anything_ at all would be acceptable. My own rule of thumb, and I think it's our consensus on PPCG, is that if the output can be co...
(more)
5 months ago
Edit Post #295973 Initial revision 5 months ago
Answer A: Golf golf challenge
Japt, 66 bytes É?`P‡ Bogey DŒ½e ¾gey Tp¤ ¾gey AlßNoss Eag¤ Bir¹e`·gVnU:`Ho¤ ˆ e Try it
(more)
5 months ago
Edit Post #295972 Initial revision 5 months ago
Answer A: Run-length encode a byte sequence
Japt `-P`, 28 bytes Input as an array of hex strings, output as a single hex string. òÀ cÈòIÉ Ë¤¬?DÎiDc#Ào)ÊsG:D¬ Try it or run all test cases (headers & footers reformat I/O)
(more)
5 months ago
Edit Post #295970 Initial revision 5 months ago
Answer A: Reverse your quine
Japt, 12 bytes "iQ ²Ô"iQ ²Ô Test it
(more)
5 months ago
Edit Post #295969 Initial revision 5 months ago
Answer A: Abbreviate everything
Japt v2.0a0 `-S`, 26 bytes q/[.!?] / ˸Ëu Î+Df/:|;/ì Try it or run all test cases
(more)
5 months ago
Edit Post #295967 Post edited:
5 months ago
Edit Post #295967 Initial revision 5 months ago
Answer A: When The Ternary Is Balance
Japt, 24 bytes Returns an empty string for input `0`. If that's not allowed then replace `:P` with `P:V`. Not at all happy with the recalculation of `U` for the recursive call, but I can't figure out a better way. ?Ug-i+i0¹ißU/3+U%3/2|0:P Try it or run all test cases
(more)
5 months ago
Edit Post #295966 Initial revision 5 months ago
Answer A: Roll n fair dice
JavaScript, 36 bytes n=>g=m=>n--&&g(m)-(Math.random()m) Try it online!
(more)
5 months ago
Edit Post #295949 Post edited:
5 months ago
Edit Post #283357 Post edited:
5 months ago
Edit Post #295949 Initial revision 5 months ago
Answer A: Really Cool Numbers
Japt v1.4.5, 13 bytes â Ëâ¬ÃeÈx vXÊ Try it â Ëâ¬ÃeÈx vXÊ :Implicit input of integer â :Divisors Ë :Map ⬠: Proper divisors à :End map e :Do all return truthy when ...
(more)
5 months ago
Edit Post #295948 Initial revision 5 months ago
Answer A: Ratio limits of fibonacci-like series
Japt, 10 bytes ²+4 ¬+U /2 Try it
(more)
5 months ago
Edit Post #295947 Initial revision 5 months ago
Answer A: Is it a near-anagram?
Japt, 9 bytes Takes input as 2 character arrays, with the longest one first. ʶUfV2 ÊÄ Try it
(more)
5 months ago
Edit Post #295932 Post edited:
5 months ago
Edit Post #282258 Post edited:
5 months ago
Edit Post #282258 Post edited:
5 months ago
Edit Post #295932 Initial revision 5 months ago
Answer A: Calculate the Z-array
Japt, 11 bytes £ígUsY)ô²ÎÊ Try it £ígUsY)ô²ÎÊ :Implicit input of array U £ :Map each element at 0-based index Y í : Interleave U with UsY : U sliced to index Y g : Reducing each pair by the sign ...
(more)
5 months ago