« first day (3171 days earlier)      last day (1658 days later) » 
00:00 - 15:0015:00 - 00:00

12:46 AM
0
A: Sandbox for Proposed Challenges

Dannyu NDosWhat's the currect zodiac? Display the emoji of the zodiac of given time, according to given country. Rules: The input must be given by stdin. The country must be given as ISO 3166-1 alpha-3 code. The list is here. The input format must be like this: <ISO code> HH:MM. Any input that doesn't f...

 
 
3 hours later…
3:32 AM
Brachylog, 8 bytes (though I suspect there might be some false positives somewhere)
 
 
2 hours later…
Anonymous
5:36 AM
I found a great piece of wtf contractor code today at work that I thought I should share:
 
Anonymous
return new Promise((resolve, reject) => doSomething().then(resolve).catch(reject))
 
7:03 AM
@Mego I suppose that makes sense if it's using one of those pre-ES6 promises.
 
 
2 hours later…
ngn
8:34 AM
for the record: upon more careful inspection, i must admit this wasn't accurate
 
It's very not accurate; more so than I thought on my initial reading.
 
I lost a point on my linear algebra test on a question where I wrote that "a set of vectors is linearly independent if any of the vectors can be formed as a linear combination of the others" and the only annotation was the word 'any' crossed out with the word 'one' written under it
And I'm a bit salty because I can't think of how those words can possibly convey different meaning in that context
 
@Pavel You should've written "each".
"any" is, from what I can tell, a synonym of "all".
You write for each, not for all.
 
There's a difference between 'any of the vectors' and 'any vector' and I think you're thinking of the latter
 
ngn
8:51 AM
@wizzwizz4 do you have superpowers to nuke old messages? :)
 
uhhh...
 
ngn
@Pavel my understanding is: "any of the vectors" means ∀x P(x) and "one of the vectors" means ∃x P(x)
"some vector" would also be ok for ∃x P(x)
 
"any one of the vectors" works also
just to be extra confusing
 
9:06 AM
@ngn Yes, I do.
What do you want nuked, and how nuked?
 
ngn
@wizzwizz4 just that message. i should have written something like:
she was asking questions about it and seeking alternative ways around it, for instance when the chosen pronoun is the grammatically awkward "they", she wanted to always refer to people by username. (monica has no issues with "he"/"she" not matching the biological sex.) she was never rude and didn't break any rules afaict, yet she was demodded right there and then.
 
@ngn I think you can delete it yourself.
And, minor nitpick: "biological sex" is ill-defined (and somewhat charged); I think you're referring to "birth sex", and it might be clearer to use that instead going forward.
 
ngn
agreed
 
It's not entirely accurate, but it's pretty close.
Wanting to always refer to people by username was just one proposal (I think it was the current one as of the demodding, but I'm not sure), and the whole concept of "rules" was pretty messy by that point, but apart from that it seems accurate.
 
@Pavel Isn't that "linearly dependent" anyway. You should have used "none"
 
ngn
9:22 AM
@wizzwizz4 i can't see how. where do i click?
 
Hover, arrow to the left of the reply icon (if present), bottom-central text on popup.
 
I think there is a timeout
 
Ah well; I'll just delete it then.
 
ngn
@wizzwizz4 ok
thank you
 
9:47 AM
Does anyone here play Pokémon Showdown?
 
@H.PWiz dependent is what I meant to say. I was just typing it from memory, we didn't get to keep the results because it's somehow an "exam security" concern?
 
10:30 AM
0
Q: What's the current zodiac?

Dannyu NDosDisplay the emoji of the eastern zodiac of given time, according to given country. The eastern zodiac is a classification scheme that assigns an animal and its reputed attributes to each year in a repeating 12-year cycle. It is also assigned to hours. Rules: The country must be given as ISO 3...

 
Hi there
 
@TwilightSparkle Hello!
 
Well
How to encode the decoder in the 1+ quine project?
 
10:50 AM
Which?
 
11:02 AM
Which I'm currently doing a quine.
One main approach would be
push a huge number encoding the decoder and
the decoder part:
Divide top of stack by 256, Output remainder, push quotient, then do it over again until the number becomes zero.
However dividing is very tricky in 1+...
 
Can't you just count the number of times you have to add 256 in order to get the value?
This implements divmod.
(Of course, you have to add 256 by repeated addition of 1.)
 
Hmmmm...
That would be still hard.
 
You'd need #s up to the largest number you support, I think.
 
Do try to make the quine run reasonably quick. The brain-flak quine is (or used to be) very slow.
 
This would not be a small program.
 
11:09 AM
@wizzwizz4 Obviously, it would not be a small program.
 
Well, there are alternate strategies that might be shorter, I think.
 
It probably won't even fit in the observable universe like the Bflak quine used to be.
@wizzwizz4 I'm just trying to do it the easy way.
@user202729 Making it is already very hard.
 
Your easy way seems to require 256^n # characters to represent n characters.
 
@wizzwizz4 Why using #s?
 
Unless you can cheat with a number-to-bits converter.
@TwilightSparkle I can't find a comparison operator.
 
11:12 AM
<
is the only comparison
 
Oh, that makes things so much easier.
 
The doc is a bit misleading though
 
I think I'm going to make 1+-, which doesn't have <.
 
@wizzwizz4 I don't think it's possible to program in 1+-
Because then we won't have any conditionals
 
@TwilightSparkle Yeah you will!
 
11:13 AM
How
 
A dynamic dispatch table is a conditional.
 
@wizzwizz4 not regularly, except on my side server
 
It's a switch case statement.
 
I'm not good at these things
As I can't even program in Underload
 
11:14 AM
Neither am I.
I'm just good at declaring things possible, not actually doing them.
 
Some have called me a mathematician; I don't know whether to take that as an insult or a compliment.
 
Obviously the latter
As you are a mathematician LOL
Getting back to the topic...
 
I'd focus first on writing a program to translate numbers to the symbols used in 1+.
That will cut down on the size massively.
 
Well...
 
11:18 AM
By that, I mean translate small numbers to the symbols used in 1+.
 
> I'm just trying to do it the easy way.
Oh oh oh
Brute forcer, anyone?
(Ofc not.)
 
Small size makes quines easier.
 
```
1
11+
111++
```
 
There's no way to pop a number without doing anything?...
 
@wizzwizz4 in fact, I'm best known on the main Showdown server as the guy who's always idle.
 
11:19 AM
@user202729 No direct way.
But there are a lot of ways.
 
I like INTERCAL's comment style, that only works because "note that" starts with "not" and disabled instructions don't get parsed.
 
There are three commands, +*< which decreases the number of elements in the stack by 1.
 
A _
Idea: recycle the top of the stack: 1<
 
@A_ Recycle?
 
A _
I mean evaluating to the second-top-to stack using some kind of expression.
So an operation (a,b) evaluates to a. (I don't know how to make one fron +, *, and < though.)
 
11:26 AM
oh...
 
A _
So can the top of the stack be multiplied by 0? (a+b*0 will reduce to a)
 
Yes
11+1<*+
Oh yes!!!
How did I forgot +??
How dumb I am! I'm thinking about ways to get rid of 0...
 
How can you end up with zero?
Oh, yeah, sorry.
 
cwl
1+ constants:
1
11+
111++
11+"*
11+"*1+
 
I think the encoded code can simply be 1 11+1+1+1+...1+ 11+1+1+...1+ and the decoder can be
 
11:31 AM
@user202729 I think the encoded code can simply be 11111111111++++++++...
 
while top() != 1:
	print('1')
	for _ in range(top()-1):
		print('1+')
	rotate_top_to_bottom()

rotate_top_to_bottom()
while top() != 1:
	print(chr(top))
	rotate_top_to_bottom()
3
@TwilightSparkle That would be harder to decode because you'd need two loop, while this way you only need one, outputting 1+ each iteration.
Looks easy enough.
 
@user202729 Ooh yes.
 
Shortest pop: (3 bytes) "<+ Any shorter solution?
 
!!
Uhh..
 
What's wrong with starring cool stuff?
 
11:35 AM
Seriously I think we need a seperate chat room for 1+
 
This room hasn't been about CGCC for the past few days.
In general, maybe, but right now? This is exactly what it needs.
 
(That's just an opinion, though; feel free to make one.)
 
oh.
If you disagree, I won't then.
@user202729 Yeah yeah how did I forgot about "<+? I always forgot these sort of things...
It's not possible to have shorter solutions...
O wait
< actually is <=...
 
Then "<*.
2
 
11:40 AM
Because if you look at the spec, it says "0 if the top is smaller than second top..."
> unstar as interesting
@user202729 Well...
Yeah, how did I forgot about that?? AGAIN??
Sorry, I'm yelling AGAIN.
 
A _
The second-to-top is gone.
 
No, it remains.
"< actually pushes a 1
I mean, pop and pushes a 1
Because < is <=
 
A _
@TwilightSparkle I shouldn't rely on my instinct... I see the message now.
 
Haha
P. S. I'm going to put the sorely incomplete constant table on the wiki page
(I'm too lazy to complete the Turing-Completeness proof)
 
A _
(I am lazier than you. I am only willing to complete half of your remaining work.)
Wait, is this funny?
 
11:50 AM
Oh wait you are wrong
As the tape should be theoritically infinite
< and > are not / and \
 
A _
So now I did 0% of your work.
 
You have to detect whether you have reached a 2 (The current edge of the tape)
or not
@A_ So now I did 20% of the work, as the ,. instructions are not relevant .
 
A _
Or a circular tape. Just make sure that the user does not try to access a cell on the edge of the tape.
 
Well...
Is BoolF TC within a circular tape?
(I think I need to learn what actually is TC, but I'm too lazy to learn)
Back to the... very original topic.
 
A _
The quine program? I am leaving.
 
11:56 AM
Yes, the quine program...
You left and came back a few minutes ago.
 
I think I've figured out a way of implementing BoolF's <>[] in 1+.
 
@wizzwizz4 Hmmmm.
 
Store a 2 as tape boundary, and have a dispatch for inserting a new 0 into the tape every time < or > is used.
This dispatch is on a new line, so # is easier.
 
oh.
So push 2 0 2 first
 
[]… my idea only works for non-nested, but it can be modified to work for the general case via extra addition.
Actually, extra addition is needed anyway.
 
11:59 AM
obviously.
 
Ooh, ooh! < and > can be in functions.
 
I failed to [push original topic]#.
 
But, anyway, [ and ] are both ""1<#, modulo the addition required to get the right #s.
@TwilightSparkle Okay, okay, you can talk about quines. :-p
 
Ah, sorry.
 
No problem. I'm done with that train of thought. Quines it is.
 
12:01 PM
Quines it is.
 
I'm thinking you can just have a number repr and a number-as-code translator, and then just have [number]"[repr][code].
 
Push a really big number.
 
The number represents the code.
 
Yes...
Seriously there is something wrong with my computer...
 
All numbers in 1+ can be written in binary, most significant bit first, with 1 as 1 and 11+1< as zero, with digits separated by 11+* – not the most efficient method, but easy to program.
 
12:06 PM
Yes...
 
So the [repr] section is easy, and you just need to implement the [code] section.
 
Ofc that will save a ton of bytes.
 
Which is why you wanted base 256?
It'd probably be easier to use base 8, and reduce the number of symbols you're allowed.
 
Hmmmmmm...
 
Then set up a dispatch from base 8 to "print the right symbol".
 
12:08 PM
I want to do the unary version first, then do the one-loop version, then do the binary version, then do the small-base version.
So we can "save" a lot of bytes.
 
Sounds like a plan.
How would unary work?
 
Push number like:
 
It's impossible to make a quine in 1+ without looping constructs, by the way.
 
1111111111111++++++++++
 
Just don't do unary, that's terrible... (in length)
 
12:09 PM
@user202729 11+1+1+1+1+...
 
@wizzwizz4 Obviously.
 
@wizzwizz4 Obviously.
 
So what's the one-loop version?
 
No, one-loop does not mean one loop over all
It means one-loop to print the pushed number
It means
 
I guess it's possible to do it with only one loop, but it probably isn't as easy as my method...
 
12:11 PM
To push the data instead of a lot of 1 plus a lot of +
You can 1 followed by a lot of 1+
and then because this is a quine you have to output that part of code
 
(that's what I said originally...)
 
Yes...
By one-loop version I mean that...
 
Also: I think that the dispatch table idea will definitely result in shorter code.
There's no TIO for 1+?
 
No TIO
As it isn't very famous
There aren't even people discussing or using it(except A _ which just left this room)
until I discovered it on Esolangs
 
A _
I wasn't using it until you used it.
 
12:22 PM
Oh...
You are back... at least for a second.
 
A _
I am looking at the transcripts, in case there is an interesting discussion.
 
I knew it!
 
A _
Knew what? Is it the looping part of the quine?
 
Knew what? Is it the looping part of the quine?
 
A _
12:27 PM
Feel free to share us your source code.
 
Feel free to share us your source code.
 
Sock puppet confirmed.
Reporting to moderators as we speak.
:-)
 
!!
I'm bored, so: If I create a 1+ chat room, it's name?
 
A _
One Plus
 
Don't you think it's too ordinary?
 
12:34 PM
How about Two?
 
Because it's one plus (one)?
Yeah, Two would be a find candidate, but...
 
Increment?
Because 1+ increments the top of the stack?
Chau?
Or Dhat.
 
A _
It can potentially error on an empty stack.
 
Oh.
But that's not important
As ++ alone will error out in C++.
 
A _
The incrementation function is a succeeding function.
 
ngn
12:38 PM
"the succ-ers room, 1+"? (years of age)
 
A _
Checking out for some synonyms...
 
@A_ Checking? How?
 
A _
@ngn Bad name, it sounds like "The Suckers' room"
 
Sucker LOL
 
A _
accession
accretion
accrual
addition
advancement
augmentation
enlargement
increase
profit
raise
rise
supplement
accrument
 
12:42 PM
well...
Any ideas?
 
ngn
"the one place one plays with 1+"?
2
 
Hmmmmm...
 
A _
Good tongue-twister/poem...
 
Good tongue-twister/poem...
 
A _
"The First Advancement"?
 
12:47 PM
Well, that sounds better than "The one place one plays with 1+"...
 
@TwilightSparkle Are you sure you're not just an incredibly sophisticated chat bot?
 
ngn
@TwilightSparkle oh no please
 
@wizzwizz4 cwl I'm not a chatbot.
In my country(not Equestria), repeating sentences are fun.
 
A _
Objects that react differently are not bots.
 
@TwilightSparkle Oh, okay. That explains everything.
 
A _
12:49 PM
Please don't play in this chatroom...
 
Okay...
 
ngn
@wizzwizz4 i suspected them of escaping from the kindergarten
 
Oh noes...
 
A _
Oh yesses!
 
(jk)
I'd like to have a chatbot which can golf (poorly) in a variety of programming languages and knows how to make a 1+ quine (Though I don't know...)
 
A _
12:52 PM
print ( "1+ quine" )
 
Standard Loophole Warning!
 
import requests
print(requests.get("https://duckduckgo.com/?q=1%2B+quine"))
 
A _
We don't have the right and technology to do so. We need to get used to TwilightSparkle's brain and see what quine the user is thinking of.
 
@A_ !!
 
A _
The first result I get in this request is TNB.
 
12:59 PM
[push 1+ quine]#
What is TNB?
 
ngn
the nineteenth byte
 
A _
(T)he (N)ineteenth (B)yte
 
Ohhh.
@A_ Why use parenthesises? The Nineteenth Byte
 
A _
I would be rude if I used bold.
 
Using bold is unforgivable.
 
A _
1:03 PM
If you emphasize something, you are getting too emotional.
 
@A_ I'd have to disagree there.
There's no such thing as "too emotional", and formatting is there for a reason.
:51985389 ---three hyphens---.
 
A _
---T---he ---N---ineteenth ---B---yte
 
Aw… ZWSP?
 
T he N ineteenth B yte
 
ngn

Sandbox

Where you can play with chat features (except flagging) and ch...
2
 
1:05 PM
In my country, search engines are terrible.
 
@TwilightSparkle Why?
 
For example, if you search "1+ quine", you will see a lot of "Why is 1+1=2" popping out.
 
Which search engine do you use?
 
A _
Including Google?
 
1:06 PM
Ah. There's your problem.
Ecosia's superior.
 
A _
Chinese search engines are terrible. There are a lot of advertisements in them.
 
DuckDuckGo is also pretty good, and it's got bangs.
 
And it's got bans.
qwq
 
A _
bang: to hit sth in a way that makes a loud noise
 
A _
1:08 PM
"DuckDuckGo is really noisy, I can't withstand it!"
 
A _

 Trash

A place for trash messages from other chatrooms. If you're a r...
 
For Got to GTG
(A reference for esolangs.org/wiki/BRB)
Bye
 
A _
Got to Go. = Bye
 
A _
1:24 PM
The Nineteenth Byte may be a user’s first experience with PPCG, so be a good ambassador.
 
1:44 PM
Well, we've cleared the sad stuff off the transcript – might want to increase the signal-to-noise ratio a tad.
 
0
Q: How to find Fibonacci series of a1z,b2y,c3z,...,...,...,nnn as output in C using while loop?

user12153611The series is mixed with multicharacters as well as integer, so What will be the code to print the output? #include<stdio.h> int main(){ int fi='a1z'; while(fi<=26) { if(fi>=97||fi<=122||fi>=1) { printf("%c","%d",fi); } fi++; } return 0; } I tried t...

 
2:23 PM
@wizzwizz4 I'd special-case code(0)..code(2), then recursively define higher code(n) as code(n-1)+"1+" if n is odd and code(n/2)+"11+*" if n is even.
 
@Neil I don't think you can do that in 1+.
Oh, wait – you're abstracting, and not actually talking about the subroutine syntax.
 
A _
2:34 PM

­Trash

Where the trash goes.
A trash site that does not require approval of the room owner.
 
Anonymous
2:50 PM
@wizzwizz4 It's not. Even if it is, it still follows the .then/.catch API, so it can be used like an ES6 promise.
 
@Mego Well, they can't say I didn't try.
Maybe they just wanted slow, hard-to-understand code?
 
Anonymous
But I can say they didn't try :P
 
Anonymous
@wizzwizz4 Based on my experiences with the rest of their code, I'm inclined to believe this one
 
Anonymous
My favorite one so far is still:
 
Anonymous
const mappedData = data.reduce((acc, x) => ({...acc, [x.id]: x}), {})

// several lines later

const id = 'something'
const datum = Object.values(mappedData).find(x => x.id === id)
 
2:53 PM
What.
Do they really need a job all that much?
 
Anonymous
No, we fired the contractors not long after I discovered these gems and many others
 
I bet they were going to try to sell you speed improvements afterwards.
 
Anonymous
Instead I wiped their crappy code off of our git history and rewrote most of it myself
 
00:00 - 15:0015:00 - 00:00

« first day (3171 days earlier)      last day (1658 days later) »