« first day (3125 days earlier)      last day (33 days later) » 

12:34 AM
@KrzysztofSzewczyk I attempted to program in Malbolge and Seed but they are just too unbelievably hard for a novice programmer like me
BrainF*** is way easier though
 
1:27 AM
I'm showing an expired cert for tio.run, is there anywhere I can report that?
 

 talk.tryitonline.net

For general discussion and feature requests regarding tryitonl...
 
okay, looks like they know. Thanks!
 
 
7 hours later…
8:45 AM
cmc: given a list of words, rotate all the words at even (1-indexed, or odd if 0-indexed) indices by 1, a b c d e f => a f c b e d
cows quack really this and fact is do => cows do really quack and this is fact
 
pretty much what I had as well
 
9:06 AM
@Cowsquack What did you have?
 
placed the jot differently, ¯1∘⌽@(2|⍳∘≢)
 
9:27 AM
here's 75 in bash+utils tio.run/…
 
 
1 hour later…
10:27 AM
@primo @JoKing Is the behaviour of [\R+] 1…10 in perl6 to be expected. I would've thought that it would be the same as [\+] 1…10 since + and R+ are the same?
 
Thinking about posting this later today, any last feedback?
 
@cairdcoinheringaahing Isn't the case handling an unnecessary complication detracting from the core challenge?
 
It seems that [\R,] doesn't reverse the list in the same way. Although I don't understand , well
 
@Adám I was thinking about that, especially given that the program I was using took lowercase input
 
@cairdcoinheringaahing So yes, just let input and output be in a single (answerer-selectable) case.
 
10:34 AM
@Adám Yeah, that seems like the best idea
 
 
1 hour later…
11:42 AM
@H.PWiz it's certainly not what I would expect
scanl(+) and scanl(flip (+)) are identical in Haskell
 
 
1 hour later…
1:03 PM
0
Q: caN it be acrOnymised?

caird coinheringaahingThe Typical Way to Make an Acronym Out of a Phrase Is to Take the First Letter of Each Word: TTWMAOPITFLEW. howeveR, sometimEs, you can make an acronym of random leTters In a seNtence such As like this: RETINA. The only condition is that the letters have to be in the correct order. For instance: ...

 
0
A: Sandbox for Proposed Challenges

MarcinKonowalczykGet the number of upvotes of your own answer Write a piece of code which makes a request to codegolf.stackexchange.com and prints the, up to date, number of upvotes to the specific answer in which you've posted that piece of code. As a test case I'll post a (poor!) answer below (obviously only ...

 
2:04 PM
0
A: Sandbox for Proposed Challenges

A__Is it an Acronym? This challenge is trivially simplified (not copied verbatim, that will be disrespectful to the original question-maker) from @caird coinheringaahing's deleted sandbox post (I can't remember the title, is it "Is it an acronym"?) I don't remember the whole post. I think the post...

 
2:30 PM
@H.PWiz That's weird... Some testing, it seems the junction operators &,| and ^ work as we expected, alongside the unlikely =. Even custom functions reverse the list rather than the order of arguments
 
Right. It does seem like it could be occasionally useful like sum [\Rdiv] 99…1,10**100. Since it's easier to put the 10**100 on the right. (At least I don't know how the to put it at the start of the list)
I tried to use this on golf.shinh.org, but their perl6 is old, and it doesn't reverse the list
 
i think it might be worth creating a bug report, since it seems rather inconsistent
right now it seems like it's acting more like [\+] [R,]
 
3:04 PM
CMC: Remove only the first instance of each element in a list
[1, 2, 3]           --> []
[1, 2, 3, 1, 2, 3]  --> [1, 2, 3]
[1, 1, 2, 1]        --> [1, 1]
 
@JoKing It seems that it's because R reverses the associativity. And then, that [\f] a,b,c,d appears to just keep track of intermediate computations of a f b f c f d
 
@DJMcMayhem dzaima/APL, 5 bytes
 
The Boyer–Moore majority vote algorithm is an algorithm for finding the majority of a sequence of elements using linear time and constant space. It is named after Robert S. Boyer and J Strother Moore, who published it in 1981, and is a prototypical example of a streaming algorithm. In its simplest form, the algorithm finds a majority element, if there is one: that is, an element that occurs repeatedly for more than half of the elements of the input. However, if there is no majority, the algorithm will not detect that fact, and will still output one of the elements. A version of the algorithm that...
no context. just interesting
enjoy
 
It's smart as heck
 
Wouldn't that fail for something like 1, 0, 2, 0, 1, 0? Nevermind, it finds majority, not mode
 
3:26 PM
`∊⊢∩¨¯1↓¨,` in dyalog apl for 10 bytes
 
@Cowsquack Oh, BTW since you're in here, I've got a pretty big overhaul for V coming soon. It should fix that one bug you reported (about xterm), and hopefully make it work on OS X
 
also interestingly, trying "*yi) in vim on (∊⊢∩¨¯1↓¨,\) borks, and it appears to be because of the \ "escaping" (?) the )
 
ngn
@Cowsquack 7: ∊⊢~¨~⍨\
 
@MilkyWay90 well, Malbolge aint that hard.
And I've got a couple of self made generators for Seed
 
3:37 PM
by the way
is there possibility of going into the chat from codegolf main page?
 
@ngn just understood it now, nice ~⍨\ trick
 
@DJMcMayhem PowerShell, 35 bytes
 
3:58 PM
@KrzysztofSzewczyk Wait, seriously?
 
@ngn scans!
3
 
@KrzysztofSzewczyk A Seed generator
No way!
 
@KrzysztofSzewczyk right top bar menu → "chat" to the right of Code Golf
 
Well, I was in this menu, but didnt see it
obligatory derp
 
4:16 PM
@KrzysztofSzewczyk Do you have a tutorial on Malbolge?
You know what?
I'm going to try Malbolge again!
@ngn I never knew cows could quack
I feel enlightened now
 
@MilkyWay90 I didnt bother writing one myself
so I'm really sorry, as I cant recommend anything
maybe you should try esolang wiki page on malbolge?
 
4:44 PM
It's okay
@KrzysztofSzewczyk Yeah, I've tried to do that and got a little bit far
 
4:56 PM
Oh yay I printed something
j*<v
And I printed an H!
('&%$#"!~}|{zyxwuR?
 
ngn
@MilkyWay90 yeah, do that by rubbing their tentacles against their tusks and gills
 
@ngn maximum intelligence capacity
 
ngn
typical of cows and other predatory molluscs
5
 
lol
 
ngn
@Cowsquack is there some story behind your mysterious username?
 
5:07 PM
Nobody knows
not even cowsquack
 
5:18 PM
@ngn I coined it randomly years ago and the phrase became popular in the class, so it's like my signature phrase
 
@Cowsquack The quacking cows!
It's sort of like naming myself "no u says ben gunn"
What is the command for running C on the Mac
 
@MilkyWay90 I think clang comes standard
 
oh
I already found that Homebrew supports Malbolge, so I may as well do that
 
@ngn Quibble: "predatory molluscs" are an actual thing.
 
Are there any normalized malbolge interpreters?
not an online one
 
6:03 PM
0
A: Sandbox for Proposed Challenges

AdmBorkBorkNumbers Decrease while Letters Increase code-golf string number Randomly inspired by Numbers Increase While Letters Decrease Given a list of mixed letters and integers (e.g., ['a', 2, 3, 'b']) increase the letters by one position in the alphabet (wrapping at z to a) and decrease the numbers by...

 
Guys I am so happy right now
I got to print "HI" in Malbolge!
('&%#^"!~}{XE
 
@MilkyWay90 Next step is Hello, World!
 
@J.Sallé You mean next century
The way I'm doing this is very, very, slow
 
Let me guess: the way you're doing this is to feed every possible sequence into a Malbolge interpeter to see if it does the right thing.
 
Sort of
It's [run of "j"s]*<[run of "j"s]*<v
Like jjjjjjjjjjjjjjjjjjjjjjj*<jjjjjjjjjjjjjjjjjjjjjjjj*<v
then converting that to actual Malbolge from normalized Malbolge
I try with a lot of js
but I found a better way
much more efficient now
Now it's freezing for some reason
 
 
5 hours later…
A__
11:15 PM
@MilkyWay90 Wow, that is only 2 bytes longer than an equivalent Python program! How did you golf it?
 

« first day (3125 days earlier)      last day (33 days later) »