« first day (2477 days earlier)      last day (2369 days later) » 
00:00 - 16:0016:00 - 00:00

12:11 AM
can someone please help me with java
or point me to a room that can help me with java
 
@HusnainRaza often, people can help better if you say your question first
I mean, I know a little bit of java, and I'm a fresh pair of eyes, and I think most of the people here know a little bit
 
i have a java class that makes a Picture
and i want to save an image
 
are you looking for a command to save the image to a file?
and the image is in a Picture?
 
ImageIO.write?
might need to convert the picture into a File first tho
 
1:04 AM
ImageIO.write(BufferedImage, "PNG", new File("whatever.png"));
It needs to be a BufferedImage, or I think it also can be a Byte[]
 
0
A: Is this number a prime?

H.PWizHexagony, 28 bytes This beats Etoplay's solution ?\.">"!*+{&'=<\%(><.*.'(@>'/ Try it online! Here it is unfolded: ? \ . " > " ! * + { & ' = < \ % ( > < . * . ' ( @ > ' / An explanation will come. I just need some help getting the images for it.

Just beat Etoplay's solution
 
I'm not going to lie and say I have any idea how it works, but that's impressive for sure.
 
It uses Wilson's theorem, like Martin's answer.
 
Wow, haven't heard that in awhile. I forget the proof now.
 
o/
 
1:13 AM
my cs homework has an arithmetic error in it
 
Assume it's correct, write it anyway.
 
19.38 * 0.13 is not 2.71 though
I mean it doesn't affect me going the assignment but still it bothers me ;-;
oh well just finish the assignment and forget about the existence of that thing
 
Call it out, extra credit lol.
 
(When you accidentally open Visual Studio instead of VSCode and have to wait half an hour for it to launch)
8
 
1:27 AM
VS > VSCode though
Though JetBrains > VS
 
I've just written a really simple sorting algorithm but it feels too simple, does anyone want to take a look, see if there are any obvious flaws I've missed?
 
That's called counting sort.
 
Damn it already exists
Actually, if this is counting sort, mine is even simpler
Unless ^ is some extension of counting sort
 
404 not found >_>
 
It's exactly the same.
@MagicOctopusUrn I can access the link.
 
@MDXF deleted since it was just an implementation of an already existing algo
 
So MDXF has just deleted it.
 
@user202729 what about that middle step, in which each element in the temporary array is initialized?
 
Now I get 404 too, how can I see it?
 
1:42 AM
I know that it's exactly the same, and often I see counting sort doesn't calculate accumulated array sum.
 
Oh, alright
Yeah this visualization implements it the same
 
Any idea how to answer alphabet staircase in Cubically?
That involves 2 looping variables (counter)...
and you can't "copy" variable from the notepad to the cube (or vice versa), only move.
 
@Calvin'sHobbies I once opened a 25 line bash script in Visual Studio. VS Code would have probably been a better tool.
 
I don't know if adding a stack to Cubically and only 2 commands Push and Pop would make it Turing-complete, though.
 
@user202729 Totally might, you don't need much for TC.
 
1:50 AM
Assuming numbers (notepad value) are 32-bit too.
 
@ATaco Uninstall Visual Studio. Feel better about life.
8
Because unless you're doing something with Windows Forms and want the form designer, you might as well use Rider.
 
2:07 AM
Oooo... I found a new sequence.
oeis.org/A030015 Nevermind.
 
@MagicOctopusUrn I'd do unique bytes instead of characters
 
@WheatWizard Ah, good diction catch.
@WheatWizard Was what I was intending.
 
2:23 AM
I'm rather interested in doing this in Brain-Flak
 
@WheatWizard HA... Oh lordy, didn't think of that one, it'll be an Enigma if you pick a good enough algorithm. Imagine picking "isPrime" and beating the current record for your entry lmao.
@WheatWizard Should I limit submissions to OEIS sequences only?
 
@MagicOctopusUrn Am I missing something? I thought I was supposed to of KC
 
@WheatWizard well I was considering KC, orrr... I was going to change it and allow them to pick an OEIS sequence.
 
I think I like the KC tbh
and I don't usually like things with KC in them
 
@WheatWizard Another thing I was thinking as potential is allowing cross languages.
 
2:27 AM
I don't think that's a good idea
makes it too hard for cops
 
Yeah, I suppose that's true, I can't tell if it's unbalanced still though.
Should I also make the output length part of the score?
 
Hard to tell balance ahead of time.
@MagicOctopusUrn Positive or negative?
 
c*b+o?
Negative errr... adds to the score, but lowest score wins.
 
The fact that I couldn't tell suggests you shouldn't :P
 
Hmmm... valid arguments on both sides... 44 byte program that outputs A, easy to crack... Wont make it to the end. 44 byte program that outputs a 4043923049 char string due to 20 nested loops? Well... Annoying.
 
2:30 AM
yeah, I do see your point
 
Maybe an upper bound on the output length?
 
Yeah
 
500 bytes?
 
I'd say 124 is all anyone should really need
but maybe you should poll more people
 
Math / numerical analysis question. Consider a number x very close to 1, but not 1, such as 56800235583 / 56800235584. I wish to approximate, to a few decimals of accuracy, say x^1e5. Doing the exact calculation with extended precision numbers isn't feasible. What kind of shortcut could I use to tackle this?
 
2:31 AM
@WheatWizard Could do a twitter limit lol?
 
Seems like a good limit
 
@Jonah You mean... like... by hand?
 
Then you could put tweet in the title and HNQ
 
@MagicOctopusUrn No computer is fine
 
@Jonah By hand I'd use base conversion.
 
2:33 AM
@MagicOctopusUrn how would you do it if i literally said, I need an answer accurate to 3 decimal places in 2 minutes?
use whatever you want
 
@MagicOctopusUrn I have my Brain-Flak solution ready :P
 
@Jonah I'd laugh, then cry a little. B/c you just gave me flashbacks to college.
 
Brain-Flak 62 bytes, 6 characters, outputs 10993592
 
@WheatWizard A number that is literally on no OEIS sequences >_>?
 
@WheatWizard Wait a minute, what's the maximum number of unique bytes I should allow? Machine language may not follow byte "code page logic". Same with bubble gum.
 
I'd say don't, let the people who program in those figure it out.
 
@WheatWizard I 'm thinking 255, the usual code-page; unless your language doesn't have a codepage.
 
Bytes are not defined by code pages though
they are just 8 bit sections of your source
 
2:39 AM
@WheatWizard I mean... truth, the average competing language is defined by that though.
 
I would just stay with what is objective, don't get sucked into the myre of codepages
Man now I'm excited for this challenge
 
0
Q: Reversed Engineered from Uniqueness (Cop's Thread)

Magic Octopus UrnGiven the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o. This is the cops thread post solutions that are to-be-cracked here. The ...

 
Oh cool!
 
@WheatWizard If you want I can pastebin you the robbers thread to post, you helped, I can give you the points for the robbers.
@WheatWizard Is 10 safe answers too many or too little?
 
for what?
 
2:48 AM
@WheatWizard Accepting an answer.
 
Oh I don't accept answers so don't ask me
 
"you're out of luck, you've got the BrainF***."
 
1
Q: Reversed Engineered from Uniqueness (Cop's Thread)

Magic Octopus UrnGiven the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o. This is the cops thread post solutions that are to-be-cracked here. The ...

0
Q: Reversed Engineered from Uniqueness (Robber's Thread)

Magic Octopus UrnGiven the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o. This is the robbers thread post solutions that you cracked here. The COP...

 
@WheatWizard what's the integer golfer for brainflak
 
From this:
23
Q: Golf a Brain-Flak Integer

NeilIntegers are tedious to represent in Brain-Flak. There are 8 operators: () Evaluates to 1, but does not push anything on any stack [] Evaluates to an indeterminate value for the purposes of this question {} Removes the top of the stack and evaluates to it <> Switches to or ba...

 
2:57 AM
@WheatWizard It's not the prime factorization then :P.
 
Not sure what you mean
so probably no
@MagicOctopusUrn Here's what wolfram has to say about it might be of help, I don't really see how though
 
@WheatWizard I mean... only thing I can think of is prime factorization or binary, I really don't know brainflak at all.
 
That's probably not the best frame of mind for Brain-Flak, Brain-Flak is really good at consecutive sums like ({({}[()])}{})
 
@WheatWizard I can't even get tio to print a 1 haha.
 
What have you tried?
 
3:08 AM
@WheatWizard Oh there we go, I think I had a space in the code by accident.
@WheatWizard Was like, jesus, I knew I'd be bad... but lawdy...
 
huh that shouldn't matter
 
@WheatWizard I copy and pasted code, I think it was a nbsp or null-byte, or my internet... no idea really.
 
huh, could I get a look at that?
it should be fixed if so
 
@WheatWizard Not sure at all what was happening, () was returning nothing. I think it was clientside though.
 
Ah I see the problem
You need to push the value (()) will work
 
3:10 AM
@WheatWizard It's weird, because () is returning 2 now.
 
Brain-Flak has implicit output
you are giving it a 2 as input, so since () doesn't really do much it will just output the 2
 
@WheatWizard My point was that for like ~4 minutes () was outputting nothing haha. Then magically POOF 2. think it was my internet connection, at a hotel.
 
Huh, I'll play around with null bytes later
who knows.
 
3:16 AM
is currently trying to implement 2**14
 
@MagicOctopusUrn In what?
 
@Pavel Brainflak, no spoilers haha,
 
You want to know a trick to doubling I didn't figure out for a couple months
I guess that answers that
 
@WheatWizard I mean, yeah, once I actually understand what the hello-kitty island adventure I'm even doing.
3
 
I get that. Can be fun to gather your own bearings
 
3:18 AM
@WheatWizard I love how as soon as you posted a cops-and-robbers BrainFlak answer DJ starts lurking.
 
If anyone would know the solution it would be DJ
 
@MagicOctopusUrn Truly better words for "what the even" have never been said.
 
@Pavel It's the most under-rated game of 2008 (no, I'm not serious).
 
Anonymous
@MagicOctopusUrn he watches
 
@Mego muahahahaha
 
3:26 AM
Oof, this is painfully different. I'd almost prefer SPARK assembly >_>.
@WheatWizard There's no way I'm getting your cops thread, I think I'll commit to learning why ({}(<>))<>{(({})){({}[()])<>}{}}{}<>([{}()]{}) works though.
 
What is that code?
 
@WheatWizard Modulus.
@WheatWizard I've always wanted to know.
 
Ah, yes, thats a fun one
 
@WheatWizard Like ACTUALLY know, not just go; oh, yeah, neat.
 
@MagicOctopusUrn If you're a total beginner, trying to understand multiplication would be a lot simpler
Or try to understand ({({})({}[()])}{}), but that'll hurt your head :P
 
3:29 AM
@DJMcMayhem Agreed, modulus will be my goal though. Not tonight cause I need to be up in 6 hours, but it seems fun.
 
3:50 AM
@MagicOctopusUrn thanks for making the perfect challenge for my crappy language I made
 
@user202729 Link to challenge?
I'm not sure it's possible
Does anyone know of a Rubik's Cube sequence of period 6?
 
4:14 AM
@Stephen Your language is most certainly not Turing complete
its a finite state machine
 
4:47 AM
@MDXF How is that related?
 
@user202729 I meant 26, whoops
 
@WheatWizard Yeah, but when I designed it it had more features, they just never got implemented because they weren't really practical, and I haven't touched it since that afternoon when my brain went haywire
 
There is none, because 13 is a prime factor of 26. And 13 cannot be period length.
You can get around with 25, and then print the last line "manually".
 
@user202729 True, do you know of one of period 25 then?
 
But still, how can that help?
I will think of one.
 
4:53 AM
Well, since I have integer 8 (used to loop while the cube is not solved), we can do ( ... )8 with an algo that will make it loop 25 times, eliminating the need for one of the variables (kind of)
 
But what you have to do inside that is not constant. And you cannot "copy" the cube content to the notepad without destroying the cube. (you may, with some special formula over face values, but I don't know)
Seems that 25 is not possible too.
Yes, 25 is impossible. So assume you have 24, what can you do next?
It is even impossible to print any letter unless the notepad has exactly that value, so the cube is the only variable.
 
5:15 AM
I bet there's a workaround.
Ok, so after looping 24 times we reset the cube and hardcode for y and z
I'm still not sure how the code in the loop would work and I don't want to start working on it too much until I've got an algo
 
Getting an algorithm is easy.
But golfing the algorithm is the hard part.
Alternatively get an algorithm loop for 28 times and then somehow ignore 2 first/last ones.
 
That would also work
What do you mean by "golfing" the algorithm?
 
By make it takes less bytes to write in Cubically notation.
 
Once we have an algorithm, we can write the loop, hardcode for the last parts, post it, and then work on golfing
Speaking of golfing algorithms, I had a challenge idea. It might be better posted as a series of challenges, though.
 
So... period 24?
 
5:23 AM
Period 24 seems like the best way to go.
 
What's the shortest way to repeat <notepad> times in Cubically?
 
It's been a while since I've done anything in Cubically, just a minute...
This, just put the code to set the notepad before the existing code
It naturally decrements it
(@ everyone else, the Cubically room got frozen, sorry)
@user202729 Example
 
What happened? (the algorithm has period 12, not 24, unfortunately) -> Try it online!
 
)6, not 6).
 
5:38 AM
Can you verify that this algorithm has period exactly 24, and not a factor?
 
How would you like me to verify it?
 
Shorter equivalent: D2 U2 F' D2 L2 F' U2 R2 F' D2 F D2 F' R2 U2
Is there a command "break on notepad = 0 or cube solved"?
Seems to be the easiest way to calculate algorithm period.
(given that the algorithm does not make face 1 becomes 0)
 
There's no break, but there's exit. Exiting on notepad being truthy would be &6, falsy would be !6& (if that works, the interpreter dislikes ! and ?).
@user202729 There's also a PPCG thread about calculating algorithm periods
 
@user202729 Another way: Cubically program :1/1 ( <algorithm here> +8 )8 %6 will calculate algorithm period.
 
This is why I wanted to add read-and-eval to cubically, so I could win the algorithm-period challenge, but it didn't work out very well.
 
5:46 AM
@MDXF Is there?
 
*sigh*
 
Ok, so that's the period-24 algorithm, what next?
 
41
Q: Cycling with Rubik's

GeobitsWhile idly twisting my Rubik's cube around, my son noticed that it kept going back to the solved state. I'm pretty sure he thought this was some sort of voodoo magic at first, but I explained that if you keep repeating the same sequence of moves, it will always return to its original state. Event...

@user202729 I'm not sure; I actually have to leave at the moment, it's late here.
 
 
1 hour later…
7:11 AM
I have an executable foo, and a folder dylib which contains all the .dylib files required for foo to run properly. How do I make it so that foo is stand-alone for Mac OS X?
 
8:08 AM
@Mr.Xcoder You use Mac OS X, right? Do you know how to do the above thing?
 
 
1 hour later…
9:35 AM
@MartinEnder That's a good idea!
 
0
Q: Review button shown when “There are no review queues available to you”

boboquackNote - this is completely different to "There are no review queues available to you" - Hey? I accessed Programming Puzzles & Code Golf Meta today while browsing the main site and clicking on one of the Hot Meta Posts. My attention started to drift, and wandered over to the top-bar, and on to...

 
@LuisMendo I actually expected this to be the challenge at first, but then I noticed that there are some cases where you can tile the infinite line, but can't form any contiguous finite blocks.
 
10:34 AM
@MartinEnder You are right, "tiling" usually implies infinite. I'll add "finite" in the text, and maybe in the title too
 
11:14 AM
@LuisMendo Either way, it's a great challenge. Could be one of Zgarb's, which is definitely meant as a compliment. ;)
 
11:32 AM
Seriously Luis, did you come up with all these by your self? Y??
Ok, it wasn't that many... :P I just happened to have a streak of unique ones.
 
11:57 AM
Public service announcement: I'm opening a Discord server dedicated to explaining ordinals and the fast growing hierarchy. The end goal will be to reach an understanding of the magnitude of TREE(3) and larger things using only recursion, and lots of it. — Simply Beautiful Art 16 secs ago
In case anyone is interested in attempting the Golf a number bigger than TREE(3) but doesn't understand graph theory or can't comprehend the magnitude of TREE(3).
 
12:53 PM
@Qwerp-Derp I do use MacOS, but I am not entirely sure I understand the question :-)
You basically want to use foo stabdalone on your machine without using dylib for it all the time?
standalone*
 
Anonymous
1:43 PM
Last call for feedback on this before I post it and hammer the old one closed
 
Anonymous
Oh, the old one is already closed, so scratch that second part
 
seems good to me
"Builtins are allowed, but you are encouraged to include a solution that does not use builtins." is good to me but doesnt that contradict the rule that answers should be competitive?
 
Anonymous
@Fatalize a) Choosing not to use a builtin is a perfectly fine reason for sub-optimality. b) The non-builtin versions would likely be included with the builtin solutions, rather than as standalone solutions, so it's a moot point anyway.
 
@Mego I like it. It's simple and clear, you'll probably get a few dozen answers on that one :p
 
Anonymous
c) It's more like a catalog challenge, so the competitiveness requirement is a bit relaxed IMO.
 
1:59 PM
0
A: Sandbox for Proposed Challenges

Stewie GriffinWho's the best pancake flipper! Pancake flipping [description will be added] is NP-hard, so an optimal approach in terms of number of flips is hard to achieve. However, optimizing for speed should be doable. You'll be given 5(?) lists of 30(?) randomly ordered integers that you shall sort in...

 
6
Q: Determinant of an Integer Matrix

MegoGiven a square integer matrix as input, output the determinant of the matrix. Rules You may assume that all elements in the matrix, the determinant of the matrix, and the total number of elements in the matrix are within the representable range of integers for your language. Outputting a decim...

2
Q: The cyclic sequence of even digits, with odds in between

Mr. XcoderConsider the following sequence: 1, 0, 1, 2, 4, 1, 6, 8, 0, 1, 2, 4, 6, 8, 1, 0, 2, 4, 6, 8, 1, 0, 2, 4, 6, 8, 0, 1, ... The even digits start from 0 and are grouped into runs of increasing length. They are arranged cyclically, meaning that they are sorted in ascending order until 8 is reached...

 
Is there "remove n'th index" in Jelly?
 
2:20 PM
@Fatalize I've always understood the "competitive" rule to be "competitive using that method." For example, iterative vs recursive could easily be two separate answers. Or run-length-encoding versus another string compression method.
Maybe I'm alone in that regard.
 
I kind of have the same view but I remember an answer deemed not competitive because it used a stupid approach or something
 
Anonymous
@Fatalize There was the constant-color answer on the mona lisa challenge
 
Is there "copy" builtin in Jelly?
 
@user202729 none of those two
 
2:45 PM
almost 90% of the way to no longer being the highest rep user without a gold badge :D
 
Is Jelly Ŀ number 1 or 0 indexed?
 
It returns 0 up to and not including z
 
What z are you talking about?
(I am talking about overdot L, not underdot L)
I have a non-builtin Jelly solution to matrix det: Try it online!
 
oh wait
 
But somehow, remove the last line cause infinite loop.
 
2:47 PM
I thought that was low range
I believe that is 0-indexed from my experience using it
 
But change 3Ŀ to 2Ŀ cause it to return 0, weirdly.
(in my "non-builtin Jelly solution to matrix det" challenge above)
 
yeah that is odd
got it: here
 
At least it works in its current form.
 
you don't need the over-dot L
last-link wraps around :D
 
@Mego Just to confirm, the input matrix won't be empty, right?
 
2:50 PM
@HyperNeutrino Nice Jelly golfing tip!
But why is my solution wrong?
 
it's not?
 
Either change 3Ŀ to 2Ŀ or remove the last Ç cause different behavior.
 
Anonymous
@AdmBorkBork Correct
 
I really have no idea. That is weird
@user202729 I posted by Jelly solution; would you care to explain how yours works? I'm interested in what your general approach is (no need to write out a full step-by-step, just approximately what the program does
 
3:12 PM
@HyperNeutrino Ok done. Basically apply the Laplace expansion formula over the first column.
 
Ah okay. Cool!
 
Seems that you use the same approach, but much shorter than my solution.
 
yep. managed to get -1 byte thanks to a thing in your solution :)
 
@user202729 1 indexed
 
also you don't need to specify that you've been outgolfed in your post ;P
that will make people twice as likely to stumble upon my post and that might skew voting D: :P
 
3:15 PM
@cairdcoinheringaahing So why does this loop forever?
Better solution deserves more upvote.
 
@user202729 It goes from the bottom to the middle then to the top, then back down to the bottom thanks to 3Ŀ
 
That's what I am expecting it to do.
Just add ¶Ç to the end makes it return 38 correctly.
 
The Ç in the main link calls the ç in the middle link, which calls the 3Ŀ in the top, which calls the Ç in the main link which calls the ç and so on
 
@HyperNeutrino Can you explain to @cairdcoinheringaahing what is going on?
 
@user202729 For the same reason that this does
 
3:20 PM
Hrm. Got my algorithm to work for 1x1 and 2x2 matrices, but fails on 3x3 and higher. :-/
 
@AdmBorkBork What is your algorithm?
 
Trying to recursively calculate each diagonal with the appropriate sign and then sum them together at the end
Stupid lack of built-ins, lol
 
"Diagonal"? I think Laplace expansion only work for column or row.
 
Of course, you could just use the builtin RIP AdmBorkBork
 
I may be wrong though.
 
3:22 PM
@cairdcoinheringaahing the thing is user202729's code includes a bit that doesn't always make it recurse. Your example always recurses but that one breaks after a while
break being exits the loop
 
Ah, yeah the Ṗ?
 
Ugh, spaced out Jelly just looks weird
 
@user202729 No, I'm not doing Laplace. I'm trying to actually calculate the diagaonals by doing Ai,j and the like.
 
@AdmBorkBork So what formula/definition of determinant are you using?
 
3:25 PM
So doing A(1,2)*A(2,3)*A(3,1) for a 3x3, for example
 
I think spaced out Jelly is more natural because you can see which command is "tied" to which. Nesting cannot be shown, unfortunately.
@AdmBorkBork So you are doing A11*A22*A33*A44+A12*A23*A34*A41+A13*A24*A31*A42+A14*A21*A32*A43 for 4x4?
 
@user202729 I don't get that. If I need to see the "ties" (for lack of a better word) for each command, I use parenthesis
 
I'm afraid that the "sum of diagonal product cyclic" only work with case 2 and 3.
@cairdcoinheringaahing You can insert () anywhere into Jelly code and it is treated as no-op?
 
added explanation for my soln
 
@user202729 No, it acts as a link creator for some reason (all undefined commands do)
 
3:28 PM
@user202729 What do you mean "case 2 and 3"? Isn't the sum of the diagonals minus the sum of the anti-diagonals the definition of determinant?
 
What is link creator? Like ?
 
@user202729 No, new chain. Hold on, I'll make an example
 
@AdmBorkBork No, that only applies for case n = 2 and n = 3.
Where did you get that "definition" from...
 
@cairdcoinheringaahing if () does something then spacing is still better because it doesn't modify functionality so you can just remove spaces when you're done, whereas with () after you're done you now have code that probably depends on the ()
 
Apparently my memory of linear algebra from 16 years ago is a bit rusty
 
3:30 PM
@user202729 Like this. Rather than execute +, it executes _
 
Let me go look up some formulae
 
@HyperNeutrino Yeah, I just use it as a visualiser, not actually in my code
 
@cairdcoinheringaahing so yeah that's like isn't it?
 
Or you had never learned to calculate det by hand of mat size >= 3, just use a calculator.
 
@cairdcoinheringaahing ah ok makes more sense
 
3:31 PM
No, we weren't allowed a calculator on tests in my linear algebra class. Quizzes and homework, sure, but the actual tests had to be done by hand.
 
@HyperNeutrino I mean, it does work like that, but don't use any of ()kquƁƇƊƑƘⱮƝƬƲȤɗƒɦɱɲƥʠɼʂʋȥẈẒŻẹḥḳṇụṿẉỵẓḋėġṅẏ
 
I'm just apparently not remembering right.
 
@HyperNeutrino You forgot to remove the explanation coming soon
 
@cairdcoinheringaahing ah ok. whoa that's a lot of unused characters
 
@HyperNeutrino Yep :P Think of how powerful Jelly could be
 
3:32 PM
@user202729 uh what you saw nothing I definitely removed it what are you talking about
;P
@cairdcoinheringaahing I mean given how powerful it already is, adding some more atoms/quicks could make it win like 99% challenges
add string stuff; jelly is not great with string ops :P
I think jelly could use a few more quicks
 
@HyperNeutrino There was a regex PR a while ago, but Dennis updated Jelly so it was outdated
 
oh rip
but regex in Jelly feels kind of... wrong almost.. hm
 
@HyperNeutrino This pull
@HyperNeutrino It doesn't to me, for some reason. It's very helpful on string challenges
 
String = array of character.
 
CMC: Given a string s, determine whether it is a valid float (i.e. matches the regex ^\d+\.\d+$)
 
3:38 PM
do we have a question where you get a grid with lasers and receptors and a certain number of mirrors or other modifiers to place and try to solve a laser puzzle (or a similar challenge)
@cairdcoinheringaahing so is 2 invalid by this standard (still a valid float)
 
+ is >1 and \d is [0-9]?
 
@user202729 + is >=1 but otherwise yes
 
@HyperNeutrino Yes. 2 is considered an integer, not a float :P
 
ok fine :P
/^\d+\.\d+$/.match in Proton because I'm boring
match object for truthy, None for falsy
 
3:41 PM
nope
/.../.? is just re.?(..., etc)
 
/<regex>/.test is simply bool(re.search(regex))
 
¯\_(ツ)_/¯ I could probably implement it if I weren't too lazy to do so
idea: what if I made a koth that's modeled after a minecraft minigame except a million times simplified
 
@HyperNeutrino Or, run the KoTH in minecraft, and keep the complicated nature :P
 
sure yk just buy a thousand alts and run the bots on a bunch of computers :P
 
CMC: Check whether all integers in a list of integers are even or equal to 1
 
3:49 PM
anyway gtg o/
 
1,2,4,5,8->False and 1,4,6->True
 
@Mr.Xcoder PowerShell, 41 bytes
Actually 39 bytes -- the -or can be replaced with +
 
@Mr.Xcoder Jelly, 9 bytes: _Ḃ$,=1$S⁼
 
@cairdcoinheringaahing 14 bytes (regex challenge): Try it online!
 
AdmBorkBork's PowerShell-to-Jelly Hypothesis states that it should be doable in four or five bytes in Jelly
 
3:56 PM
@user202729 That's weird. Why doesn't this work?
 
String != character.
“.” is ['.'], ”. is '.'.
@Mr.Xcoder Jelly 7 byte Try it online!
 
Ooof, even Laplace's formula is hefty work. This is going to be well over 300 bytes in PowerShell. :-/ Not sure if it's worth the effort.
 
Powershell has table?
 
00:00 - 16:0016:00 - 00:00

« first day (2477 days earlier)      last day (2369 days later) »