« first day (4312 days earlier)      last day (525 days later) » 

12:00 AM
@Steffan can send ?
 
12:11 AM
@Steffan nope
ERROR: LoadError: MethodError: no method matching Int64(::SubString{String})
 
12:34 AM
@DialFrost oh stupid mistake lmao. parse.(Int,split(s))
 
1:09 AM
@hyper-neutrino hey wait you forgor to edit the move message to something mildly amusing
shame on you
 
1:32 AM
@Steffan smart!
 
we need just one more follower for the proposal to reach follow threshold!
 
i havent followed :3
 
DO IT
JUST DO IT
 
wheres the link
i lost it :p
 
1:47 AM
i followed but its still at 59 :/
 
uhh
you sure?
 
ah there we go
 
we did it!
now do some voting
 
12 hours ago, by lyxal
y'know what would be funny - if the site proposal got more followers than Cyrptocurrency in less than 24 hours
 
Unable to log in:

No user found
wtf
 
1:49 AM
we broke the threshold in less than 20 hours
@DialFrost its bork
 
@Seggan the CGCC people are super active in spreading word and following stuf
:3
 
@DialFrost use the hamburger icon on the topbar and search for area51
 
2:06 AM
@Steffan im way ahead of u now :3
@Steffan btw whats the shortest way to check if prime in julia?
 
one sec
0∉i.%(2:i-1) is shortest I know of
@DialFrost wdym way ahead?
the julia leaderboard?
 
2:26 AM
@Steffan ye
 
i'm solving a bunch so i'll be ahead soon
you owe me a hint for intersection :p
 
@Steffan i do?
 
bye yall
 
you owe me a solution for cubes :)
@Ginger o/
 
before I go here's a screenshot of the new project dialog from Klein:
I'll read feedback tmrw
 
2:29 AM
looks like tkinter
or rpi programs
 
well I made it on an rpi soooooo
bye fr now
 
@Steffan howd u beat me by 1 byte for prime number :(
 
what, that's a super long solution for pangram grep, it just takes a few bytes to check for pangram
 
@Steffan ???
 
@DialFrost idk, it's the first thing i got to work
 
2:33 AM
@Steffan hint?
2:100 .|>n->0∉n.%(2:n-1)&&println(n) me
 
you can check for pangram in 20 bytes
 
@Steffan WAT
 
change 100 to 99
as far as pangram, use set operators
 
:facepalm:
@Steffan I did!
how bout long prime? 2:100^2 .|>n->0∉n.%(2:n-1)&&println(n)
 
past you on the leaderboard now
100^2 => 9999
 
2:40 AM
@Steffan noooo
 
or 10^4
 
@Steffan lmao jo king beat me to it
@Steffan how bout we both get top 10
@Steffan teach me :3
also why doesnt this work for percirnous numbers 3:50 .|>i->0∉(n=count_ones(i)).%(2:n-1)&&println(i)
how...how did @Steffan get 790 bytes css colours ...
 
3:00 AM
python?
 
@Steffan yup
 
compression
 
eh
 
as you can see it's much shorter in chars scoring
basically you're compressing a string with 0-9a-f
so then I'm taking every run of 5 characters, converting from hex to int, then taking charcodes
 
im confused (ive never worked with compression b4 except vyxal so im very dumb in this area :3)
 
3:01 AM
@DialFrost read the hints page, you don't need a real primality check
just use x%3!=1 instead of isprime(x)
because you're just checking for 2, 3, or 5
nothing higher will ever be given to you from count_ones
 
@Steffan also 7 no?
oh wait nvm
@Steffan gotcha
also congrats on nearing 3rd in dart leaderboard, ure so close to jayxon
 
@Steffan and of course there's something shorter than that
 
@JoKing did u use pysearch?
 
i don't think i did, but you could probably adapt pysearch to work for that
 
@DialFrost done, i'm #10
@JoKing yeah of course
i've tried pysearching it a zillion times, nothin happens
 
3:15 AM
@Steffan already... :'(
@JoKing i cant :p
 
i probably shouldn't need pysearch though, considering primo figured it out in the car (supposedly)
 
c'mon
primo is primo
 
i figured out the reasoning post-brute force, but it's short enough that there's not that many possibilities
 
considering the length of the prolog solution, i have reason to believe it uses xor
but i guess it could be tons of modulos
 
@JoKing im at a huge disadv for small golfs cuz i cant use it :(
 
3:20 AM
considering that it ends in something like <1 though, i'll try modifying pysearch
because it's length 8 without <1/>0
it's not finding anything length 8
 
3:55 AM
0
A: Sandbox for Proposed Challenges

joyoforigamiGetting over it with the space Cabbage, Wolf, Goat The Cabbage, Wolf, Goat riddle with a twist! Backstory: There’s an intergalactic river than needs to be crossed! Being a space-ferryman you’ve offered some aliens on your small space ferry that can only carry two entities: you and a passenger. Ho...

 
@Steffan help for pangram? :3 [Set(map(Char,65:90))<Set(uppercase(x))&&println(x) for x in ARGS]
 
 
3 hours later…
7:04 AM
0
Q: Just for better understanding OOP and this keyword

Jawaadclass BankAccount { balance = 0; add(balance) { if (typeof balance !== "number") return; this.balance += balance; } withdraw(balance) { this.balance -= balance; } } const account1 = new BankAccount(); const account2 = new BankAccount(); console.log(account1.add() === account2.withdraw());//====> ...

 
7:33 AM
@Steffan darn ru asleep again
@JoKing whats the shortest way to remove the last char of a integer?
 
x/10 or x//10?
 
remove?
julia btw
 
Yes remove
aka floor div by 10
 
er its a decimal tho lol
sorry i meant decimal not integer mb
 
x//10+x%1?
 
7:48 AM
er no
not sure if its helpful but this is for a 1000 decimal place challenge, the solution i have gives 1001, so shaving off the last digit in the big float will give the answer
 
Oh okay
 
unfortunately julia cant do something like str(x)[-1] like python can
 
x-x%1e-1000 maybe? Although at this point you probably want to fix your code
 
@emanresuA wdym fix code
oh wait
maybe you can like minus the last digit off hmm, is that pluasible/
actually no in julia i think that messes up the float
 
 
1 hour later…
9:18 AM
@DialFrost chop probably
 
 
1 hour later…
10:45 AM
0
Q: Transform a lattice polygon to minimum diameter by shearing

Hugo PfoertnerGiven is a grid polygon by the list of its integer vertex coordinates arranged along the perimeter, in the form \$(x_1,y_1), (x_2,y_2), \cdots , (x_n,y_n)\$ with \$n \ge 3\$. The polygon is completed by connecting point \$n\$ to point \$1\$. For simplicity, it may be assumed that the polygon is s...

 
11:22 AM
Hi I exist
And I'm no longer "null" now
 
 
2 hours later…
1:44 PM
@JoKing er no?
i tried using it, didnt get a high place at all lol
either 1. theres a shorter way than chop, or 2. theres a shorter method using chop
like this
@TwilightSparkle aww i liked null better
 
@DialFrost But my real username is TwilightSparkle and that's what it should be
 
@TwilightSparkle :/
 
Actually, it's not important
Because I don't actually do any interesting stuff in this site
Nor do I do in any other site
 
2:10 PM
0
Q: Intermediate Boolean Algebra Calculator

Jeremy CollpravDifficult Boolean Algebra Calculator Background With the success of Simple Boolean Algebra Calculator, I present a more difficult problem. Boolean Algebra concerns representing values with letters and simplifying expressions. The following is a chart for the standard notation used: Above is what...

 
 
3 hours later…
5:29 PM
@DialFrost I keep telling you to use .|>
ARGS.|>x->Set(map(Char,65:90))<Set(uppercase(x))&&println(x) is an easy start
map(Char,65:90) can be Char.(65:90) (when will you learn to use vectorization operators?) can be 'A':'Z'
But you can replace < with a (Unicode) subset of or equal to operator, and then you don't need any Set() as it will automatically work
Bruh now you're asleep
 
6:25 PM
@WheatWizard alternative proof: ato.pxeger.com/…
 
6:42 PM
0
Q: Decide whether a given field of the board game 'Qwirkle' is valid (according to game rules)

SquareootThe famous game of Qwirkle has simple but intricate rules (See part 2 of this question for a summary of the rules!) The Challenge You are somehow (text input, function parameter, whatever) given a board of a Qwirkle game, like a snapshot from any current timeframe within a game. This board can b...

 
7:16 PM
@pxeger Doesn't halt.
Challenge is to try and translate that proof to Agda.
 
7:45 PM
Not sure Haskell is a good language to write proofs in though
 
It's better than nothing.
 
8:29 PM
i don't know why i find it so funny to use print () instead of pure () as the dummy main
 
9:29 PM
CMC Find a number of digits n >2 for which there is no prime in base 2 with n digits (bits) with only one zero in it
Actually n>1 would work too
 
@pxeger Couldn't that be used to prove literally anything?
@pxeger Other than being TC, it's way more math-y than, say, Java. Much easier to write proofs
 
9:46 PM
I am intrigued to see how easy this is to find
n=7 seems to be the answer
 
10:06 PM
@WheatWizard halts for me, it just takes a couple seconds
 
@Steffan It definitely does not halt.
 
that's strange
ATO breaks sometimes, but it works fine on TIO in less than a second
 
10:29 PM
That's because the main is practically empty
If you try using the actual proof (f), it won't halt
 
alright, here's the completed new project dialog from Klein:
LMK what I screwed up
(and ignore the buttons being disabled, that's an artifact of my screenshot tool)
actually one second
ok, there we go
 
Looks really nice! Reminds me vaguely of KDE
 
Did someone say math?
 
You just did
@graffe If you're looking for math, here's some @ Goku
(sorry for the ping graffe)
@Ginger Will all languages support adding dependencies using that interface?
Also, I don't know much about Python, but there are different formats/tools in/with which you can create a project, right? You might want to let users choose which of those formats they want
 
@user they will! it's handled by the language plugin code
@user the default Klein Python language plugin uses Poetry, but you can of course write plugins for other systems
 
10:38 PM
You might not want to have the dependencies thing be in the New Project wizard itself
 
and all of it except the dependencies is standardized, so it'd only be a small change
 
It could be its own menu
 
@user I considered that, but there isn't really any satisfactory way to do it easily
the current system is the simplest
 
Sorry, to clarify, I meant you could simply completely remove the Dependencies part from the New Project thing
 
so like it defaults to none and you add them later?
 
10:40 PM
And people would just configure their dependencies after making the project
Yeah
 
I could do that, but I don't really want to
 
That's how I always do it, at least
 
I mean you don't have to add any right away
you can fill in the rest of the fields and click "create"
 
True, it's not hurting anyone and it's a bonus for those who know what dependencies they want going into the project
 
and the advantage of having them be pre-selected is that it allows them to be installed during the rest of the setup process
 
10:41 PM
An option to create a git repo would be nice too
 
@user this will be a feature, but it'll get its own button in the main editor
however I might add a checkbox to make an empty one
 
Why not allow making the repo while making the project?
 
yeah good idea, I'll add it
 
:)
Now I can sue you for stealing my ideas when Klein becomes famous
 
:/
 
10:44 PM
Anyway, o/, have to get back to procrastinating on my homework instead of procrastinating on procrastinating on my homework
7
 
lol
@user before you go, here's a GIF of the dialog in action:
 
it's not even funny
it's just true
 
11:01 PM
@Steffan ye lol
Congrats @Neil for 150k! (Well round up)
 
11:24 PM
@Steffan lol
The abundant numbers (long) on code.golf is now live guys GO TRY IT
 
11:54 PM
@Steffan ru hacking my comp how do you have the exact same btyes as me :p
 

« first day (4312 days earlier)      last day (525 days later) »