« first day (3574 days earlier)      last day (1200 days later) » 

12:21 AM
Wait, disallowing builtins isn't in the Things to avoid when writing challenges list?
 
it is; called do-x-without-y
 
12:36 AM
1
Q: Align a list of numbers

Ray ButterworthPerhaps something like this is here already, but I couldn't find it. It is not the same as Aligning Lines!. Example: Input: "98.6" "$2,750.17" "-$23" "-86" "3,120,487.19" Output: " 98.6" " $2,750.17" " -$23" " -86" "3,120,487.19" Note that ".6" isn't right-padded to .60 or .6 ....

 
 
2 hours later…
2:30 AM
0
A: Sandbox for Proposed Challenges

SisyphusWrite a Unicode Unpacker We all know scoring by characters is ripe for abuse. Let's prove this. The Challenge Output the following: "m8V}G=D@7G1lAI,v08` #(hNb0A8T!g;==SVaG5~ g"jUF!bmRY(3I@na?2S{ fJVzo/GQYU%ybpfUq3aG Yza[jc,WJ$bP^7r};Da} V-!Z+Nk:`/poc}d/X:G\ sWX{dbAUv6,i]%RG$hRp ),bd+?/{U1tU[;<;u....

 
 
3 hours later…
5:04 AM
@Anush bit early lol
 
5:54 AM
I've recently swtiched to windows and holy heck is command prompt crap for rendering unicode
smh
And no powershell doesnt do any better
smh even more
and it really doesn't help that I'm working with an esolang which sometimes requires unicode chars to be rendered on the command line
 
@Lyxal have you tried bash under Windows?
 
6:12 AM
@Adám I'll see: I'm in the middle of actually installing it
 
6:36 AM
@Adám still doesn't render correctly
 
Odd. I have APL rendering correctly both in cmd.exe and in bash.
 
Even after enabling the ubuntu font, ⟨⟩ doesn't render correctly
 
I've set both to DejaVu Sans Mono.
 
@Adám That's the part that fixed it
using DejaVu Sans Mono
I didn't even need ubuntu
 
 
2 hours later…
8:40 AM
@Razetime when is peak-o'clock?
hello all
 
which time zone is that in?
oh actually, it has a helpful vertical line :)
seems we are in the peak quietness zone now
I saw cs.stackexchange.com/questions/132144/… and thought of code-golf
 
lol ok
 
any algo people here know the answer?
 
hmm looks difficult
coincidentally, I just posted this: codegolf.stackexchange.com/a/215047/80214
 
9:51 AM
posted on November 11, 2020 by origamistudios

front end development company Frontend developers are the key players in determining the success of any app. A lot rides on the intuitiveness and capacity of the developer to produce a consistent and responsive app. Along with this, ensuring all features are in sync is also an art. At Origami Studios, front-end developers remain updated with the latest technology trends through reg

 
10:07 AM
@Razetime that's cool.
there is a fastest-algorithm tag here too but I don't know how many current users there are
 
 
1 hour later…
11:11 AM
there's defo a few people
but idk if they come up on chat
 
what is the cross posting policy?
obviously you add a link
 
11:40 AM
cross posts are fine so long as you rephrase them properly and make it a challenge
 
 
2 hours later…
1:38 PM
Can I steal someone who knows Husk/Haskell to do a couple of test cases for a Sandbox post I'm working on? It involves infinite lists, so I'm not too happy using Jelly
 
1:49 PM
helo mr card
whats the post
@cairdcoinheringaahing ?
 
0
A: Sandbox for Proposed Challenges

caird coinheringaahing(Almost) Solve Fermat's Last Theorem It's a well-known fact that Fermat's Last Theorem is true. More specifically, that for any integer \$n \ge 2\$, there are no three integers \$a, b, c\$ such that $$a^n + b^n = c^n$$ However, there are a number of near misses. For example, $$6^3 + 8^3 = 9^3 - 1...

 
My latest Sandbox post :P
I'll give you special permission to solve it early so I can add in some test cases :P
 
@cairdcoinheringaahing Try it online!
does this work alright
 
@Razetime Doesn't look right. It should return a list of triples [a,b,c] such that a^n+b^n = c^n ± 1
E.g. for n = 3, [6,8,9] would be included
 
oh power n
 
2:02 PM
Yeah. I think the approach of 3-way cartesian product then filter should work, but I don't know how to do that in Husk
 
this stuff is times out very easily
 
Yeah, I'm giving it a go in Python cause I just remembered about itertools, and TIO does not like it
 
ok hows this look
change the ↑100 part to whatever number you like
 
Yeah, that looks great, thanks!
 
2:40 PM
Wait, the number of integers below a number 2**n which are the square of an integer is 2**(n/2)?
Oh wait, I'm stupid. Of course that's how it works, since 2**(n/2) is the square root of 2**n
 
Throwback to the fancy fibonacci number generator
 
@Razetime Is there a builtin for [0,1,2,3,...] in Husk? Natural numbers with 0?
 
3:09 PM
No, but ΘN should work
@cairdcoinheringaahing ↑
 
@Razetime Thanks. Any idea why this (your program but with [0,1,2...]) doesn't output [0,0,1]?
 
0
Q: Fastest square root of an arbitrary size

Redwolf ProgramsWe do seem to have a fastest square root challenge, but it's very restrictive. In this challenge, your program (or function) will be given an arbitrarily sized nonnegative integer, which is the square of an integer. Input: You may take input in any normally allowed way, including (but not limited...

 
Wow, NMP was fast that time...
 
3:28 PM
@cairdcoinheringaahing because all elements are not unique
 
@Razetime How would I remove that check from the filter?
 
@Razetime Perfect, thanks!
 
alright
 
This challenge has such clear requirements..."Your program can draw graph in any size, any shape and any alignment but the nodes and connections must be recognizable."
 
3:34 PM
I wanted to try doing that but the pyth answer blew me outta my chair
 
@RedwolfPrograms TBF it's very difficult to come up with 100% objective requirements for visual challenges
That's perfectly clear IMO
 
speaking of which, I do need some verification on my sandboxed "catch the fruit" challenge
 
Actually I guess it's not as unclear as I first thought.
 
3:50 PM
@RedwolfPrograms this one's even clearer
honestly that's a serious offender
 
 
4 hours later…
7:54 PM
hello!
 
 
4 hours later…
11:35 PM
It's a dark day when CJam beats Jelly :(
Either that, or I'm not very good at golfing Jelly :P
 
11:54 PM
0
A: Sandbox for Proposed Challenges

userEnglish English code-golfstring You have been hired by the American embassy in the UK to act as a translator. Being a lazy programmer, you decide to write a program to do a bit of the work for you. You've found out that often just doing the following things can satisfy Word's spellcheck (which ha...

 

« first day (3574 days earlier)      last day (1200 days later) »