« first day (4191 days earlier)      last day (645 days later) » 

12:09 AM
0
Q: Next Special String

cheemsSpecial String We call a binary string \$S\$ of length \$N\$ special if : substring \$S[0:i+1]\$ is lexicographically strictly smaller than substring \$S[i+1:N]\$ for \$ 0\leq i\leq N-2\$, \$Note : S[a:b] \$ is substring \$S[a]S[a+1]...S[b-1]\$ Given a binary string \$T\$ of length \$N\$ we a...

 
 
1 hour later…
1:11 AM
just found the SWGamekeys MT font
w. h. y.
 
is that the font you mean?
 
gorgeous
 
@lyxal yeah
why
who invented it
who tortures themselves with it
also
TokenType.END_FUNCTION -> isEnding = i-- > -1 // setting it to true. don't try this at home
when ure too lazy to write 3 lines instead of 1 :P
code golf can be useful sometimes
 
1:42 AM
that's very cursed
i--; TokenType.END_FUNCTION -> isEnding = true is almost as golfy
for minor extra cursedness use !0 instead of true
 
1:55 AM
I actually use !0 and !1 in my code sometimes since it reduces the e count
I used to get kind of stressed out about how stupid some of the decisions I make to avoid es are, then I realized: it absolutely doesn't matter how nice my code looks to other people 90% of the time, and when it does, it's usually someone else's code not mine so I don't care if it's yellow and inconsistently colored
 
undrstandabl
I'd probably use !!0 for false and !!1 for true to avoid a bit of mental gymnastics though
 
Hey mods can we get the lyxtures room unfrozen?
@JoKing @hyper-neutrino ^
Because turns out there is a zoom I can share with everyone
 
2:31 AM
@lyxal which is?
 
@AidenChow intro to discrete mathematics
Two lectures a week
 
@lyxal ooh sounds interesting, what are the prerequisites for that kind of course tho
is single variable calc enough
 
I reckon
It's things like logical proof, graphs and algorithms
 
graphs as in the graphs with nodes?
 
Yes
You ninja'd my explanation I was typing lol
Thems the topics
One happens on Wednesday three hours after utc midnight and the other happens on Friday one hour after utc midnight
 
2:48 AM
wait so this is kinda like computer science stuff? cuz graphs are used in coding too
 
@AidenChow discrete mathematics is the foundation of computer science lol
Or at least of algorithms
 
yo nice, ive always wanted to learn about this stuff, now its for free lmao
@lyxal dang i think i can make both those times, thats like afternoon for me
how long are the lectures?
 
2 hours each
No Dan though
Dan don't teach math
 
so will this teacher be as chill as daniel??
like just let anyone in?
 
I don't know
But so long as y'all act natural, you'll blend in
They aren't checking against a roll because it's also a physical lecture too
 
2:53 AM
oh cool
huh it started already?
 
Yes
Yesterday was the first one, but I only got the link today
Helpful, I know
 
awesome
 
When the lecture chat room gets unfrozen I'll figure out a way to get y'all a recording of last year's first lecture
The recording yesterday didn't have audio, so they just linked to last year's which is same slides but with different admin stuff
 
ah ok
 
3:15 AM
@Seggan similarly: who invented JS? :P
 
@lyxal do you have a link
 
in We love us some Daniel, May 10 at 6:54, by lyxal
I should invite y'all to more lectures lol (that's a joke)
not anymore ... lol
 
lolol
 
@graffe 2**5000-1 is known not to be prime because it’s a mersenne prime with a composite root (either that or miller-Rabin is just fast )
 
3:31 AM
da hell is miller-rabin
 
it's a probable prime test (as in it tests for primes but it isn't perfectly accurate)
it's mostly since it's fast that it's good - i forget if it reports no false positives or no false negatives, or if it has a chance to be wrong either way
 
@PyGamer0 well if imma adding another thousand to my existing student debt, I might as well invite my friends to come with me lol
 
lol
 
4:07 AM
@hyper-neutrino if n fails then it is certainly composite; every time it succeeds the chance of n being composite is cut down by half
 
4:20 AM
huh interesting
 
 
4 hours later…
8:19 AM
CMC: Stern-Brocot sequence
(Google it)
 
8:30 AM
 
CMC: Print the OEIS sequence given by the last five digits of the id of the message you send your solution in. (no edits)
I may offer a small bounty if someone actually achieves this
 
So randomly guess a sequence and hope your message matches?
In that case `lambda i: 0`
There must be a sequence that consists of all 0s right?
 
9:21 AM
there are 602 sequences that contain 42 consecutive 0s
and the server won't allow any longer search
 
This one seems to be the closest match oeis.org/A000007
 
there does exist the zero sequence: oeis.org/A000004
a000004_list = repeat 0
so elegant
 
Ok so I guess I the only way to win is to spam messages till I get a ID that ends in 0004
And probably get banned in the process
 
lol
 
@emanresuA Can the message be in another chat room?
Create a bot that spams 10,000 messages in a private chat might work
 
9:26 AM
actually 100,000
 
Oh right
We might be a while
Message IDs appear to be sequential, but shared between different rooms
So you may be able to wait till you get close then spam a lot
 
 
3 hours later…
12:31 PM
in Sandbox, 23 secs ago, by lyxal
Module[{nn=30, c}, c=PadRight[{}, nn, {1, 1, 0}]; Table[FromDigits[Take[c, n], 3], {n, nn}]]
language is mathematica
it's easy enough to predict what your next message id is going to be if you send a few messages before you send your attempt
find the sequence 10/30/100 after what you first send, golf it, test what id you're up to, rinse and repeat until it gets closer and then send the attempt
 
12:51 PM
not sure if this matters, but would it make sense for me to write up yes/no sample answers for this meta i wrote? just to get opinions since so far no one has given their "ruling" so to speak :P
though i feel like a binary option wouldnt be enough
since theres like "no these arent allowed" which is fine, but "yes these are allowed" needs extra nuance / detail
like, in what ways are you allowed to use them if they're allowed? what does the infinite behavior have to be? i'd assume everyone agrees on "as long as it stops outputting anything after doing what it needs to do" but like, what if you cant stop it from doing some infinite thing? is "infinitely outputting the answer" acceptable? a simple "allowed" isnt a full response, so i can see why this is a difficult question to answer :furrowed brow indicating deep thought:
im just on the edge of my seat because itd be fun to use langs like this and also im really curious what everyone thinks XD
 
1:22 PM
@thejonymyster If you provide an answer, it should be the one you agree with the most
 
understood :-)
 
2:09 PM
@DLosc hmm right
might be a good transition to exponentiation
 
2:25 PM
silly challenge idea: "Self Scoring" challenge where your program has to give a mapping of all previous answers (and itself) such that the answer itself is in "first place"
i guess itd be code golf too then so that you have to come up with this ordering based on something that makes your program unique from the others or whatever :P
theres probably room to shuffle this idea around so that its less contrived and more interesting
 
That sounds very interesting
Score should probably be the difference between your bytes and the previous? To make later answers still competetive
Though then a really bad score could give a big advantage to the next one
 
yeah this is really hard to score :P
 
Make it a KOTH challenge so answers compete against future competitors too maybe
 
wow, a multi lang koth :P
see but now that makes me want the program to not have to sort itself on top, but want to sort itself on top lol
treachery of ideas... very cool ideas
 
in MATL CHATL, 49 secs ago, by PyGamer0
🐜 🧊
 
2:39 PM
A program would need to anticipate future entries
 
^^ best antifreeze lol
 
ah i was like trying to figure it out, nice
@mousetail right, which i love
but how do you stop the program from just being a narcisist and then alphabetically sorting everything else?
(or whatever)
 
I imagine the challenge would mostly be about getting other bots to sort you nicely
 
oh wow
 
Each bot would mostly sort itself of top but mostly try to write it source so that other bots try to sort it good
 
2:41 PM
that blows my mind a bit yeah
 
@thejonymyster makes no sense
 
well, it doesnt make no sense
but its certainly an abstract idea that i just threw at the wall
 
@PyGamer0 How do you pronounce the "i" in "antifreeze"?
 
for me it varies between "ee" and like, "ih"
 
So err I'm not good with
 
2:43 PM
actually i think im schwaing it irl
 
@Bubbler its in a switch, i cant add a semicolon in the middle
 
but would "Implement the binomial probability formula with the number of successes >= k" be a good challenge?
 
@Adám uhhhh, don't pronounce it :P
 
m90
@Seggan How about replacing the semicolon with the comma operator?
 
this is kotlin
 
2:49 PM
@thejonymyster +1
 
@m90 Huh, I didn't know C had an equivalent of APL's
 
imagine if C had trains though
 
CTrain (previously branded C-Train) is a light rail rapid transit system in Calgary, Alberta, Canada. Most of the network functions as a light metro, though in the free-fare zone that runs through the downtown core the Red and Blue lines operate like a urban tramway (this transition occurs due to the density of stations in the free-fare zone, and is possible due to the design of the rail vehicles and their ability to operate on both segregated and road-integrated tracks). The CTrain began operation on May 25, 1981 and has expanded as the city has increased in population. The system is operated...
 
Are there any languages which advertise themselves as being slow?
 
Prolog?
 
3:08 PM
@thejonymyster I wouldn't imagine so, at least for praclangs, but an esolang that takes an interesting (i.e., not just stupidly inefficiently implementing built-ins) approach to make programs deliberately slow would be cool
 
write a fast interpreter,
or would it be
 
lol
 
"code golf, but your code must be as slow as it is short"
 
3:24 PM
A003602 is a cute sequence
it's the positive integers interleaved with itself
 
3:37 PM
ooh, and it has the hear tag
wish i could listen
 
ask lyxal to get you some ears :P
 
 
1 hour later…
4:47 PM
CMC write code to compute the Dickman function en.m.wikipedia.org/wiki/Dickman_function
 
da what
 
@mathcat :)
It is in sage
So that is cheating :)
 
trying my best not to piggyback with a joke about the... hedgehog theorem
(failing, of course)
is editing to add an explanation ok? i saw this answer recently, and i wanted to save anyone else a dig through the command list, since the explanation is pretty straightforward e_e
 
5:33 PM
just found out you could follow an answer, wtf ive never noticed it till now and wanted it the whole time lol
 
6:03 PM
@thejonymyster I didn't know that!
 
 
4 hours later…
9:52 PM
whats up with this i dont speak that language
 
on the rep or on my illiteracy?
:P ty lol i just kept posting things and eventually i got upvotes
 
the russian says "learn more about this in the certificate"
i had to look справка up so not sure if there's some other meaning that makes it make more sense as a translation for "help center" :P
 
10:54 PM
why the actual fuck does unicode not have small capital x
what
i guess i can get away with just using lowercase x here but just why
how
 
Like superscripts, small caps are really inconsistent in Unicode since they shouldn't exist at all
Since Unicode isn't really supposed to encode the formatting of text, which super/subscript and small caps falls into, but it also tries to include every pre-existing charset, some of which do have that sort of thing
 
the small caps in the ipa definitely should exist in unicode but yeah as a general thing they probably shouldn't
 
It's a wonderful middle ground where Unicode is both breaking its principles by including them but not actually allowing anything useful since they aren't all there :|
 
11:35 PM
it should have been a combining character
 

« first day (4191 days earlier)      last day (645 days later) »