« first day (4709 days earlier)      last day (140 days later) » 

12:13 AM
@NewPosts a possible : given a bunch of rules, find the shortest string in bytes that works
@Simd well, most people are here to golf, not to solve algorithm tasks
btw I think I have O(n^2) algorithm for the pentagon thingy, which is optimal given that you need to check all n^2 values in the matrix at least
 
 
1 hour later…
2:18 AM
@NewPosts Been done in 53, 47 is proven impossible
 
 
3 hours later…
5:34 AM
0
Q: Format Datetime in 30-Hour Clock Time

tshInput a datetime, format the datetime in YYYY-MM-DD HH:mm:ss format using 30-hour clock time. The 30-hour clock time works as: After 6 a.m., it is same as 24-hour clock time Before 6 a.m., it use date for previous day, and plus Hours by 24. For more examples, you may checkout the testcases. Rul...

 
@Bubbler your answer looks great! I can’t wait to test it out
 
 
1 hour later…
6:55 AM
How many bytes do Only work in GMT+6 count? XD
 
 
2 hours later…
9:19 AM
0
A: Sandbox for Proposed Challenges

TbwConvert to Spoken Binary code-golf Introduction In the video the best way to count, binary is proposed as the best system of counting numbers. Along with this argument is a proposal on how to say numbers in this system. First, we give names to each 2 to the power of a power of 2 (or "double power...

 
hello!
 
9:59 AM
CMQ: what is your most egregious answer on this site?
 
 
2 hours later…
11:43 AM
/requestQuestion but its translate is given. This seems area where machine learning would work
 
0
A: Sandbox for Proposed Challenges

l4m2Output [Some-Text]. You're given its translate in [Some-Language]. code-golf kolmogorov-complexity Sandbox Notes: This seems area where machine learning would work Stealing question Allowed

 
@TheEmptyStringPhotographer What do you mean by egregious?
 
 
3 hours later…
2:20 PM
CMQ: What is your most very answer?
 
2:38 PM
What does that mean?
 
I'm just parodying the previous CMQ :p
 
Oh
 
2:55 PM
I'm writing a golfing language. How should it take input? Should it take a file name in the command line arguments? Should it take the program directly in command line arguments?
 
Jelly lets you do either
Personally I'd do it like Python and have it take a file name, or a -c [code] flag
 
Does it need to use a specific one to get onto TIO?
 
It's not getting onto TIO, the maintainer's been inactive for years
 
^
 
I'm guessing either would be fine tho given the wide variety of languages TIO/ATO support
 
2:58 PM
ATO's probably not going to happen either, since I haven't seen pxeger in ages
 
I just need to finally find the right language that sparks joy in me to write RTO :p
 
Are there any other online places I can get the language, or would you have to download it to use it?
 
@RydwolfPrograms wait ten years for me to finish Rabbit
@Flummox sure, what language are you using
 
@Ginger Are you writing a language too?
@Ginger I'm writing it in Python
 
an acceptable choice
 
3:01 PM
An easy* choice
 
you can use one of the five thousand "Python It Online!" services, or use PyOdide to run it in a browser
@Flummox in a sense
it's a praclang, not a golflang, and I'll probably never finish it
 
Ah
 
@Ginger They're probably still reachable
On GitHub
 
What is ATO?
 
maintained TIO alternative
 
3:04 PM
Ah
I love the finances spreadsheet advertising his $10 loss
Anything major I should make sure to add to my language?
 
No
 
an interpreter :p
(or compiler, I don't discriminate)
 
Wow, really?
 
yes, very important
 
I just meant, is there anything big that you think golfing languages are missing right now?
 
3:14 PM
this is the great wisdom I have accumulated from two years of CGCC
 
Get on the fracbyte hypetrain if you want
 
@user It's a 6 bit character set
 
3:32 PM
I'm almost out of characters
 
3:48 PM
Really weird question. Am I allowed to submit answers in my language if I haven't published the language yet?
For example, I have a 5.25 byte answer to codegolf.stackexchange.com/questions/262647/…
 
no
 
Ok
Another question. If I have a compressed program that fits in a fractional number of bytes, how do I submit the answer? Do I submit an uncompressed version? Do I submit a string of 1s and 0s?
 
4:12 PM
Encode it however you like, score the number of bits
Or number of trits or whatever you use if it's not binary
 
When I'm showing an answer, though. Do I just show a string of 1s and 0s and use that for my explanation?
 
You can say "a" represents 0001 or something like that to make it more readable
Or even use full names of the operators
Then score the text with the words replaced with the binary encoding
Make sure you state clearly how the encoding works though
 
@mousetail The encoding is simple. Each character maps to 6 bits.
 
Great, just explain that
 
Ok
Easy enough, I guess
Do I have to explain it in every answer or can I just put it in the docs for the language?
 
4:22 PM
Most languages have a page on github or similar then link to in in every answer
But it's not strictly neccecairy to list it in every single one
After a few answers people will know
 
That's what I meant
I'll just link it in my answers
 
Often answers have the [bytes] in the answer header be a link that explains how the scoring works
 
That's probably what I'll do, then
Thanks for the help
 
5:20 PM
0
Q: Does it land on a unary number?

noodle manA positive integer \$N\$ expressed in base-1 (unary) is a string of \$N\$ of the same digit. For example, 5 expressed in unary (using the digit 1) is 11111. Consider an infinite string of all positive integers expressed in unary, separated by zeroes: 10110111011110111110111111011111110111111110… ...

 
CMC: My local ATM likes to hand out near-equal numbers of 10s and 20s e.g. 100=4*10+3*20. Given an input amount from 10 to 200 (in multiples of 10), output how many 10s and 20s it dispenses
 
@NewPosts anyone have a better title for this?
 
@NewPosts Isn't this just the triangle numbers +n
 
@mousetail it might be, what’s that?
 
Actually I think it's literally just the triangle numbers
 
5:25 PM
so this is just “is it a triangular number”
are you sure?
 
Yea, every unary sequence is one longer
So it forms a triangle
Except zero in your case
 
so what is the challenge then?
 
Probably a dupe
 
the OEIS link has diff numbers than my test cases of i’m reading it right
 
Which ones?
 
5:28 PM
like f(10)
actually wait yeah you’re right
ok
well maybe that pattern could make a good TS types answer to triangular numbers then
 
Now I can close as duplicate without others' confirm?
 
Yep if you have a gold tag badge
 
i was going to VTC but you were faster lol
 
Most work searching the dup
 
Was just about to say I couldn't find a dupe but I guess I'm just terrible at searching
 
5:34 PM
i just typed “triangular number” and it showed up
 
I search triangle number so it comes late
 
6:33 PM
Is the rep bonus only 100 now?
 
0
A: Is this number triangular?

noodle manTypeScript’s type system, 91 bytes //@ts-ignore type F<N,A=[],I=N["length"]>=N extends[...infer R,0]?F<R,[1,...R,...A],I>:A[I] Try it at the TS playground This is a generic type F taking a unary number N as a tuple of N zeroes. I never would have expected a challenge like this to be under 100 by...

i was right
 
6:50 PM
@TheEmptyStringPhotographer This answer specifically flouts the rules of the challenge (because the OP said I could). I reckon that's pretty egregious.
 
 
1 hour later…
8:01 PM
Ok I may actually like tokio, it's not as bad as it first seems
The channel API seems very nice actually
 
 
2 hours later…
9:46 PM
0
Q: Convert to Spoken Binary

TbwIntroduction In the video the best way to count, binary is proposed as the best system of counting numbers. Along with this argument is a proposal on how to say numbers in this system. First, we give names to each "double power of two", \$2^{2^n}\$ for each \$n\$. number = symbol = spoken =======...

 

« first day (4709 days earlier)      last day (140 days later) »