Activity for Shaggy
Type | On... | Excerpt | Status | Date |
---|---|---|---|---|
Answer | — |
A: Create a Sudoku Japt, 10 bytes Outputs a 2D-array. 9õ ñu3 £éX Try it 9õ ñu3\n£éX 9õ :Range [1,9] ñ :Sort by u3 : Mod 3 of each \n :Assign to variable U £ :Map each X éX : U rotated... (more) |
— | over 3 years ago |
Comment | Post #282427 |
Or, alternatively, `v`. (more) |
— | over 3 years ago |
Comment | Post #282430 |
You don't need to count the `f=`. (more) |
— | over 3 years ago |
Edit | Post #282370 |
Post edited: |
— | over 3 years ago |
Edit | Post #279287 |
Post edited: |
— | over 3 years ago |
Edit | Post #282370 | Initial revision | — | over 3 years ago |
Answer | — |
A: Partial Sums of Harmonic Series JavaScript, 29 bytes f=(n,x=0)=>n>0?f(n-1/++x,x):x Try it online! (more) |
— | over 3 years ago |
Comment | Post #279457 |
Shouldn't the footer be included as part of the solution, seeing as it's needed in order to output the `0`s? (more) |
— | over 3 years ago |
Comment | Post #279287 |
@Quintec, for the sake of simplifying the explanation, the `Ä` is now gone. (more) |
— | over 3 years ago |
Edit | Post #282312 | Initial revision | — | over 3 years ago |
Answer | — |
A: Golf a FRACTRAN interpreter JavaScript, 44 bytes a=>g=n=>a.every(([p,q])=>(x=np/q)%1)?n:g(x) Try it online! (more) |
— | over 3 years ago |
Edit | Post #282310 | Initial revision | — | over 3 years ago |
Answer | — |
A: Golf a FRACTRAN interpreter Japt v2.0a0, 18 bytes The `r÷` can be removed if we can take an array of floats instead. T=V£Xr÷Ãæv1)?ßT:U Try it T=V£Xr÷Ãæv1)?ßT:U :Implicit input of integer U and 2D-array V T= :Assign to variable T V£ : Map each X in V ... (more) |
— | over 3 years ago |
Comment | Post #281572 |
Can we take an array of floats instead of fractions? (more) |
— | over 3 years ago |
Edit | Post #282287 |
Post edited: |
— | over 3 years ago |
Edit | Post #279723 |
Post edited: |
— | over 3 years ago |
Edit | Post #282202 |
Post edited: |
— | over 3 years ago |
Edit | Post #282293 |
Post edited: |
— | over 3 years ago |
Edit | Post #279287 |
Post edited: |
— | over 3 years ago |
Edit | Post #282307 |
Post edited: |
— | over 3 years ago |
Edit | Post #282307 |
Post edited: |
— | over 3 years ago |
Edit | Post #282307 |
Post edited: |
— | over 3 years ago |
Edit | Post #282307 | Initial revision | — | over 3 years ago |
Answer | — |
A: Prime Difference Japt, 15 14 bytes @§XnÈj}aX+j}a2 Try it or run all test cases @§XnÈj}aX+j}a2 :Implicit input of integer U @ :Function taking an integer X as argument § : Is U <= ... Xn : Subtract X from È : ... (more) |
— | over 3 years ago |
Edit | Post #282305 | Initial revision | — | over 3 years ago |
Answer | — |
A: Diagonalized alphabet Japt `-R`, 16 bytes This feels far too long for the task at hand - what am I missing?! ;Bó v ¬£14îUiX q Test it ;Bó\nv ¬£14îUiX q ;B :Uppercase alphabet ó :Uninterleave \n :Assign to variable U ... (more) |
— | over 3 years ago |
Comment | Post #281960 |
[40 byes](https://tio.run/##y0osSyxOLsosKNHNy09J/Z9m@7/C1q5CLzexQCPV1i7VPlGvoLQ4QyNV0wrIyi/Q0NRJtI2O1VRTS/xfUJSZV2KbnJ9XnJ@TqpeTn84FFtFI04g20IFBUx3zWE1NhIyhjhFQ1BhNzBQIDcAyBjoWGOqNdUzAMpZYTIJCoMx/AA) (more) |
— | over 3 years ago |
Edit | Post #282303 | Initial revision | — | over 3 years ago |
Answer | — |
A: Backspace an array Japt, 9 bytes ô rÈÔÅÔcY Try it or run all test cases ô rÈÔÅÔcY :Implicit input of array ô :Split on falsey elements (i.e., 0) r :Reduce by È :Passing each Y through the following function, with the first element serving as the st... (more) |
— | over 3 years ago |
Edit | Post #282294 |
Post edited: |
— | over 3 years ago |
Comment | Post #282301 |
Well spotted, thanks, @Razetime - 'twas easily fixed. (more) |
— | over 3 years ago |
Edit | Post #282301 |
Post edited: |
— | over 3 years ago |
Edit | Post #282301 |
Post edited: |
— | over 3 years ago |
Edit | Post #282301 | Initial revision | — | over 3 years ago |
Answer | — |
A: Word Set Square Japt `-R`, 16 15 14 bytes pÔ¬Ëú°EDùEÃÆpÔ Try it pÔ¬Ëú°EDùEÃÆpÔ :Implicit input of string p :Append Ô : Reverse ¬ :Split Ë :Map each D at 0-based index E ú : Right pad ... (more) |
— | over 3 years ago |
Edit | Post #282300 | Initial revision | — | over 3 years ago |
Answer | — |
A: Obligatory Quine Challenge Japt, 9 bytes All credit to ETH on this one. 9îQi"9îQi Test it 9î :Repeat the following to length 9 Q : Quotation mark i"9îQi : Prepend "9îQi" And, for the sake of completeness, the original 10 byte Japt quine, again with all credit to ... (more) |
— | over 3 years ago |
Comment | Post #279374 |
@Quintec, done! (more) |
— | over 3 years ago |
Edit | Post #282299 | Initial revision | — | over 3 years ago |
Answer | — |
A: 1, 2, Fizz, 4, Buzz! Japt `-R`, 27 bytes Lõ@"FiBu"ò úz4 ËpXv°EÑÄìªX Test it Lõ@"FiBu"ò úz4 ËpXv°EÑÄìªX L :100 õ :Range [1,L] @ :Map each X "FiBu" : Literal string ... (more) |
— | over 3 years ago |
Edit | Post #282294 |
Post edited: |
— | over 3 years ago |
Edit | Post #282294 |
Post edited: |
— | over 3 years ago |
Edit | Post #282294 |
Post edited: |
— | over 3 years ago |
Edit | Post #282294 | Initial revision | — | over 3 years ago |
Answer | — |
A: Merge two strings Japt `-h`, 13 12 9 bytes à m+V kbU Try it à m+V kbU :Implicit input of strings U & V à :Combinations of U m :Map +V : Append V k :Filter elements that return falsey (i.e., 0) bU : First 0-based i... (more) |
— | over 3 years ago |
Edit | Post #282293 | Initial revision | — | over 3 years ago |
Answer | — |
A: Are they abundant, deficient or perfect? Japt, 11 bytes Could be 2 bytes shorter if not for a bug in Japt when trying to get the proper divisors of a number. õ üÈgXnXâ x Try it õ üÈgXnXâ x :Implicit input of integer U õ :Range [0,U] ü :Group & sort È :By passin... (more) |
— | over 3 years ago |
Edit | Post #282287 |
Post edited: |
— | over 3 years ago |
Edit | Post #282287 |
Post edited: |
— | over 3 years ago |
Edit | Post #282287 |
Post edited: |
— | over 3 years ago |