Activity for southâ€
Type | On... | Excerpt | Status | Date |
---|---|---|---|---|
Edit | Post #286053 |
Post edited: |
— | almost 2 years ago |
Edit | Post #286053 |
Post edited: |
— | almost 2 years ago |
Edit | Post #286053 |
Post edited: |
— | almost 2 years ago |
Edit | Post #286053 |
Post edited: |
— | almost 2 years ago |
Edit | Post #287085 |
Post edited: |
— | about 2 years ago |
Edit | Post #287251 |
Post edited: |
— | about 2 years ago |
Edit | Post #287251 | Initial revision | — | about 2 years ago |
Answer | — |
A: "Hello, {name}!" [Factor], 30 29 bytes [ readln "Hello, %s!"printf ] Try it online! Uses `io` and `formatting`. (more) |
— | about 2 years ago |
Comment | Post #287236 |
Fair enough, ATO uses J903, so I'll pull it up when I want to use a new feature since I'm too lazy to download latest. As for the output, I guess you could always add it. To each their own, tho. (more) |
— | about 2 years ago |
Comment | Post #287239 |
I use `]` because it is a function submission, so it needs to be there for the fork. Also, that use of `&.` is really elegant, nice. (more) |
— | about 2 years ago |
Comment | Post #287236 |
If you want, you can run and share J code online using [ATO](https://ato.pxeger.com/run?1=m70wa8FOJT31NAVbKwV1BR0FAwUrINbVU3AO8nFbWlqSpmuxWj05PyVVISO1KFUdIrJCkys1OSNfIQ3CXbAAQgMA). It even has an option to paste as a code golf post, which is what I use. The header provided is a super specific way to ... (more) |
— | about 2 years ago |
Edit | Post #287239 | Initial revision | — | about 2 years ago |
Answer | — |
A: Lowercase, but not just the letters J, 15 bytes ``` 7 u:32 OR 3 u:] ``` Port of Shaggy's answers. Evaluates as 3 forks `7 u: (32 OR (3 u:]))` Attempt This Online! ``` 7 u:32 OR 3 u:] ] : right argument 3 u: : 3&u: converts a string to a list of char codes 32 OR : bitwise OR the result... (more) |
— | about 2 years ago |
Edit | Post #287217 | Initial revision | — | about 2 years ago |
Answer | — |
A: Just the vowels please Fig, 3 bytes Actual score is: \$3\log{256}(96)\approx\$ 2.469 bytes. Filters consonants from the input string using implicit input. ``` Fcb ``` Try it online! ``` Fcb F : Filter with two string args filters a from b cb : constant for upper/lowercase consonants ``` (more) |
— | about 2 years ago |
Edit | Post #287214 | Initial revision | — | about 2 years ago |
Answer | — |
A: Just the vowels please [Raku], 18 bytes {m:g:i//} Implicitly matches the topic variable with the regex Try it online! ``` {m:g:i//} { } : anonymous code block m : match operator :g:i : regex adverbs, global and ignorecase // : the regex usi... (more) |
— | about 2 years ago |
Edit | Post #287113 |
Post edited: |
— | about 2 years ago |
Edit | Post #287084 |
Post edited: |
— | about 2 years ago |
Comment | Post #287084 |
Yeah...I tried a ton to get it to parse correctly my edit history is fucked. Might as well just round. (more) |
— | about 2 years ago |
Edit | Post #287113 | Initial revision | — | about 2 years ago |
Answer | — |
A: 8 coexisting queens J, 20 bytes ``` '01'{#:2^2842 A.i.8 ``` Attempt This Online! Non-tacit program that outputs implicitly in a REPL. Shoutout to Raul (Miller)#5220 in the APL farm discord for thinking of this cool idea. ``` 2842 A.i.8 : Anagram 2842 of 0..8 -> 0 4 7 5 2 6 1 3 2^ ... (more) |
— | about 2 years ago |
Edit | Post #287084 |
Post edited: |
— | about 2 years ago |
Edit | Post #287084 |
Post edited: |
— | about 2 years ago |
Edit | Post #287084 |
Post edited: |
— | about 2 years ago |
Edit | Post #287084 |
Post edited: |
— | about 2 years ago |
Edit | Post #287085 | Initial revision | — | about 2 years ago |
Answer | — |
A: Can you give me half? Fig, 2 unique, 2 total ``` H! ``` Try it online! Halves the negation of the empty string when no input is given. (more) |
— | about 2 years ago |
Edit | Post #287084 |
Post edited: |
— | about 2 years ago |
Edit | Post #287084 | Initial revision | — | about 2 years ago |
Answer | — |
A: Looping counter Fig, 5 bytes The actual score is \$5\log{256}(96)\approx\$ 4.116 bytes. The leaderboard only likes ints in the header. ``` (J,Q0 ``` -1 char thanks to Seggan Try it online! Fractional byte lang created by Seggan. Is this even allowed here? ``` (J,Q0 ,Q : Print and return last ret... (more) |
— | about 2 years ago |
Edit | Post #286949 | Initial revision | — | over 2 years ago |
Answer | — |
A: Multiply complex numbers. Sidef, 25 bytes ``` {eval .split.join(" ")} ``` ``` {eval .split.join(" ")} { } # Create anonymous code block .split.join(" ") # splits on whitespace and joins with " " . # equivalent to .split.join, where is the topic ... (more) |
— | over 2 years ago |
Edit | Post #286928 | Initial revision | — | over 2 years ago |
Answer | — |
A: Find n Niven Numbers Ruby, 56 bytes p (1..).lazy.filter{1%1.digits.sum<1}.take(gets.toi) Attempt This Online! (more) |
— | over 2 years ago |
Edit | Post #286882 |
Post edited: |
— | over 2 years ago |
Edit | Post #286897 | Initial revision | — | over 2 years ago |
Answer | — |
A: Partial Sums of Harmonic Series Goruby, 38 bytes ``` ->n{dw{$.+=1;$..mp{1.0/-1}.su<n};$.} ``` This was not as much fun as I thought it would be, but it was fun enough to use once. (more) |
— | over 2 years ago |
Edit | Post #286894 | Initial revision | — | over 2 years ago |
Answer | — |
A: Make a frequency table (histogram) Ruby, 12 bytes ``` ->{1.tally} ``` Attempt it online! (more) |
— | over 2 years ago |
Edit | Post #286882 | Initial revision | — | over 2 years ago |
Answer | — |
A: Determine whether an integer is square-free Myby, 12 5 bytes ``` primf=primfd ``` ``` primf : prime factors = : equals primfd : unique prime factors ``` Evaluated as a monadic fork in J `(f y) g (h y)`. The test cases (retested) can be viewed here and were generated using this ruby script. (more) |
— | over 2 years ago |
Edit | Post #285643 |
Post edited: |
— | over 2 years ago |
Edit | Post #286845 | Initial revision | — | over 2 years ago |
Answer | — |
A: Evens or Odds - you know this one Myby, 2 bytes ``` %2 ``` Input is taken from the command line implicitly. `0` for even, `1` for odd. Since Myby is still in its early stages, there is no online sandbox. Some test cases can be seen here. (more) |
— | over 2 years ago |
Edit | Post #286748 | Initial revision | — | over 2 years ago |
Answer | — |
A: Cumulative Counts J, 9 bytes ```J 1#.]=&><\ ``` This is the 7 byte APL solve but makes use of `#.` in place of `+/"1`. I came up with `1#.]=\` first, but [bubbler pointed out it breaks when non zeros are present. Attempt it online! (more) |
— | over 2 years ago |
Edit | Post #286637 |
Post edited: |
— | over 2 years ago |
Comment | Post #286637 |
Ah yes, good point about the dict comp. I had totally forgotten about that behavior. The set-of-pairs is also a great way to think about it. Very impressive! (more) |
— | over 2 years ago |
Edit | Post #286637 |
Post edited: |
— | over 2 years ago |