« first day (4313 days earlier)      last day (536 days later) » 

12:18 AM
@Steffan?
wakey wakey
 
AYYYYY FIRST SUCCESSFUL pyproject.toml CREATION WITH KLEIN
:D
 
@RadvylfPrograms \a and \z should be the versions of ^ and $ that don't change in multiline mode (and also \Z if your $ matches before a trailing newline)
@UndoneStudios that's not golfed you haven't even replaced NULL with 0 yet.
#include <time.h>
main(){time_t t=time(0);printf("%d",localtime(&t)->tm_year+1900);}
 
12:42 AM
@DialFrost what?
 
12:53 AM
@Steffan how'd you do inventory seq?
 
1:13 AM
follow the instructions
 
1:43 AM
like golf
cuz im last place XD
anyone have a recommendation for me to try to get a diamond in?
 
0
A: Sandbox for Proposed Challenges

Aiden Chow1 to N column and row sums Inspiration There is a problem on the most recent AMC 12B test, the one held on November 16, 2022, which goes like this: (AMC 12B 2022, Question 17) How many \$4\times4\$ arrays whose entries are \$0\$s and \$1\$s are there such that the row sums (the sum of the entrie...

 
2:06 AM
guys is there a way to add a chessboard to a post like they do in chess se, or is that only exclusive to that site?
 
looks like a chess only feature
 
rip, trying to make a chess related challenge, that makes a bit more difficult i suppose
should i just put a pic of the board state instead? how should i be doing this?
 
yeah just do that
also have a text version
 
is this fine?
also when im explaining which piece moves where, should i just assume that the reader is familiar with algebraic notation or do i have to provide an explanation of that somewhere in my post?
or maybe i just provide the wikipedia link for algebraic notation in my post?
 
make sure you explain how the horsey moves, because that's one of the hardest things about chess (looking at you Garry Chess for making it so hard to understand)
also where Knooks?
 
2:18 AM
self.props.parent.props.parent.editor.openProject(project) yes this is good and normal python code
 
ok wait i have to explain how every piece moves too?
 
(no - not knowing how the horsey moves is an r/anarchychess joke)
 
but how does the horsey move
 
good question
I don't know
 
you don't know???
 
2:25 AM
I'd have to ask Gavin from 3rd grade
 
well go get him then!
 
all I know is en passant is forced and double check is checkmate and pasta
 
...
what
 
I don't get it
am leaving now, bye
 
2:29 AM
@Ginger that is a good idea lmao
 
 
3 hours later…
5:15 AM
0
A: Sandbox for Proposed Challenges

Aiden Chowcode-golfdecision-problemchess Is it a valid atomic chess move? Background and Rules There is a variant of chess called atomic chess, which follows essentially the same rules as normal chess, except that pieces explodes other pieces around them when captured. In addition to checkmate, you can al...

 
don't forget that the king can't move to C2
and that en passant is forced
 
O_O
feedback btw, idk if i should put more general info about chess to make the challenge more accessible, or if its already long enough as it is
 
Lyxal, do you know anything about chess aside from the memes?
 
yes
I used to be good at it
 
@lyxal lol rip, do u not play it anymore or what
 
5:21 AM
that's right
 
lol me too, i feel like i havent really touched normal chess in a while
 
chess memes are the only thing about chess I get nowadays
 
im like way better at the atomic chess variant than normal chess lmfao
@lyxal lmaooooo
ok seriously tho could someone take a quick look over my sandbox post and see if theres any glaring problems
 
5:37 AM
@AidenChow exclusive to that site
@lyxal :(
@AidenChow lmao
 
6:09 AM
@Steffan how'd u get first for long percirinous
 
 
1 hour later…
7:19 AM
why doesnt this work for this challenge?
for i=0:10000
n=count_ones(i)
if 0∉n.%(2:n-1) println(i)end
end
???
 
7:50 AM
@user yes that was my point
 
@DialFrost do a new hole before anyone else does it
 
@JoKing but i want basically a permenant diamond (ok not permenant but ya)
@JoKing and ppl take over quick
 
8:23 AM
CMC Given an array of 0s and 1s, output the decimal number that corresponds to the array when it is considered as a binary number. E.g [1,1,1,0] ->14
 
this is the built-in in Jelly, B in Vyxal (and surely every other golfing language has it but i'm not gonna list a thousand things lol)
 
If you followed the language design SE site consider moving your votes down lower since the top few all have over 10
 
8:39 AM
@graffe Ḃ in flax
2/ in k
 
Well, I now have 20 (?) code.golf diamonds
I got very lucky finding a sufficiently obscure question
 
9:04 AM
@PyGamer0 what would it be for base 3?
 
9:44 AM
@graffe 3ḃ
and 3/ in k
 
9:56 AM
@graffe in Extended Dyalog APL.
 
10:34 AM
Wow
 
 
1 hour later…
12:04 PM
@emanresuA which one?
@emanresuA nice! i have none
 
12:46 PM
Puzzle: if the code for HIM is LLO, what does KUKO mean? The options are GRIM, MIME, GRIP, GRIN, OXEN
 
1:46 PM
0
Q: Number to letters

The ThonnuYour task Given a positive integer, convert it to letters using the below rules. Rules Loop through the digits: If the digit is 0 or 1, combine it with the next digit and output that letter of the alphabet (0-indexed). If the digit is 2, combine with the next digit ONLY IF the next digit is betw...

 
2:17 PM
@DialFrost *2nd. pysearched a primality formula
@emanresuA no it was just created a few hours ago lol
all your diamonds will be gone soon
 
2:37 PM
I just sniped most of them, you've got 4 left lol
@DialFrost bcs 0∉n.%(2:n-1) counts 1 as a prime
 
3:19 PM
@graffe GRIP
 
uh why tf is MSEdge asking if I'd recommend it
 
Well do you?
 
not really
although I recently learned it apparently has userscript support built-in, which is neat
 
That's... suprising. The last browser I would have expected to have that
 
exactly!
 
3:39 PM
@PyGamer0 why GRIP?
 
4:14 PM
I love the "2 hours later" feature on SE chat, I wish discord had that feature
 
 
2 hours later…
6:23 PM
@Steffan :/
Okay at least you haven't figured out how to metagolf fish
Or fortran
 
7:18 PM
Did anything ever come of this?
 
 
2 hours later…
9:33 PM
@graffe Desmos, 33 bytes: f(l)=total(2^{[l.length-1...0]}l)
 
 
2 hours later…
11:07 PM
@Steffan oh shit
@Steffan brehhhh
 
11:21 PM
where'd you find the 204 byte cobol solution for abundant numbers?
@Steffan then how?
 
11:47 PM
We've got only ten days until December and need 10+ more challenges for Code Golf Advent Calendar!
8
 
@Bubbler WW can cover for it :3
 
@DialFrost just add &&n>2 or smth like that
 
@Steffan but...but... that makes me have 60 bytes
:|
 
that's why you don't actually check for primality
ALSO, USE .|>
 
i did lol
hehe
 
11:50 PM
NO YOU DIDN'T
 
@Steffan 1:10^4 .|>i->0∉(n=count_ones(i)).%(2:n-1)&&n>1&&println(i)
 
oh
you didn't post that
 
lmao
 
that's better lol
 
@Steffan then how leh
@Bubbler really sorry but i cant contribute :(
 
11:51 PM
no problem
 
same here, i never have any ideas
 
@Steffan i too never have any ideas + too stupid to actl come up with a decent challenge
 
Does it save any to use sum(n.%(1:n).<1)==2?
I'm too lazy to check
 
no
it went from 60 bytes to 60 bytes
and 58 chars to 60 chars
 
ok lol
 
11:53 PM
so its actually longer
 
if you want to save chars then one sec
replace && with
comparison chaining
 
@Steffan thats 3 bytes so it adds 1 byte extra
unfortunately
 
I know but it saves chars
It adds bytes
 
:/
welp how'd u get 45 ... hint? :p
 
like i said, pysearching a formula lol
it's length 10
 
11:55 PM
@Steffan i canttttt
my comp cant get past length 8
@Steffan how long did you take to get that (runtime)
 
about 5 mins maybe, but i have a pretty fast computer
 
5mins?
oh
i've been waiting for around 1min b4 getting impatient :3
 
however even on my computer it likes to crash with [1] 200 killed ./a.out
i think it means it ran out of memory
 
what inputs/outputs did u use
 
i've pysearched stuff since so it's not in the file anymore
 
11:57 PM
@Steffan ?
 
let me try get some inputs/outputs again
the results from bit_count will be from 0 to 13, so that's your inputs
the outputs are just 1/0 for each if it's prime or not
 
gimme a sec
@Steffan 0 1 2... 13???
or any few numbers from that range
 
you can probably omit a few
but you'll need most or it'll find all kinds of junk
 

« first day (4313 days earlier)      last day (536 days later) »