« first day (2949 days earlier)      last day (1898 days later) » 

12:08 AM
@ASCII-only did I already ask you about UO¹χXO¶OX?
 
Don't think so
 
also, can you think of a better way than ≔I9.e999η≧⁻ηη to create a value that won't compare less than or greater than any number
 
although it may be a bit nonstandard
 
 
2 hours later…
2:16 AM
My C++ class has some hidden tests for each project for which we don't get to see input or output. How might I get around this? I've already tried just sticking stuff in a file; anything I can modify gets reset each run. /bin contains no ssh or ftp, though there's a fair bit of other stuff there. Any other ideas?
 
Anonymous
@Khuldraesethna'Barya Do it right and don't try to cheat?
 
Not to cheat! I've had no trouble at all with the projects; this is just for fun.
 
2:33 AM
@Khuldraesethna'Barya If you have a wget or curl you could make either one do the job of ftp with a bit of work and or hunting down flags in man pages
 
I just found ftp in /usr/bin. Thanks, though!
 
 
2 hours later…
4:27 AM
RIP Alex, it has now been 1 year since he has visited PPCG. Last seen February 24th, 2018.
 
4:40 AM
1
Q: Most errors, least characters

CortexTry to get the most errors, with the least characters. Not really sure how to phrase it. Rules To find the score: \$\frac{errors}{bytes}\$

 
@Neil I'm only 12 bytes shy of your Retina answer now
 
5:07 AM
I've spent some time working on this unsolved challenge:
18
Q: Optimize Compiler for simple Reverse Polish Notation Programming Language

Андрей ЛомакинDescription Imaginary programming language (IPL) uses Polish Reverse Notation. It has the following commands: i -- input number and push it to the stack o -- non-destructive output top of the stack (number stays on the stack) d -- discard top of stack integer number -- push this number to the...

It's hard though.
Since it involves both addition and multiplication, the hardest part is figuring out which direction to apply distributive laws such that the token count is minimized.
But in the meantime, I have a partial solution that can simplify "4 i 5 + i o d 6 o" to "i i o 6 o"
 
5:24 AM
0
A: Sandbox for Proposed Challenges

MisterGeekyMisterGeeky's query to list challenges: It is up to you whether you interpret these challenges as following a pattern. Challenge 1:- Given an array of random numbers and a target number, sample pairs in the array whose sum is closest to the target. Minimize the error function. Challenge 1.5:- ...

 
5:36 AM
What happened to the PPCG podcast? Are there still plans to do another?
 
 
5 hours later…
10:25 AM
1
Q: Eww, those bytes are gross

Jo KingWrite a program or function that, when given a string, filters out as many distinct bytes as it can and returns the cleaned string. However, since your program hates them, none of these bytes can be present in your own code. Your score will be the number of distinct bytes your program filters ou...

 
@NewMetaPosts That's off-topic, but I made this for c++.
https://tio.run/#%23lVfrbhs3Fv7teQp6vHUka2RZ7ja7tURFm2QLpNguNnaAYiFNBWqGkgiPhlMOx5JjyehzdB@vD5L9DjlS5BhbbINoSB4enst3LqSXwi7kUliViE9W32Zqyb8OVF6qVPIPppLBUqxL9VHyy4uLwMq15Tf2PpOjMNHgCqPXOkvjT40zdivvV9qkJTtrBrerEmxG5fObIlN2GIpMzXNRMjfqGRN5Sr@J/JmJcsmE1UuVTBKRJzLbr/RyqexulWu5TmSBdWU1mypLIjBow6ZaZ2xqpLhliSglPjZZsGQhjPv8dWLd2H1ZT76@pEkmypJBR5HhmzvRGMv6K@9EVs/WhfEz2Oe3rcorqNETsRKKKBMjbWVymt0rmaUslUlm7wuJyUxUmcWYSYulxv9qmmF2nwvvM2TKDGbLvFoyaMtUAqGYaEODlRA8E8Qxy7SwbAaXZ0ZJ@D/XwELNmFo6ZpVnKpcYLMt0PmdLnVZQtaysIJVQKMtCJJjJFdsDmmv3o1jkVZYV1jBdSCMIWvefdgqj7gQcKIy2MrEyZQXcUAkzcpY5iIycK6BFExggTQFMvHdG/lwpI
 
@ThePlasmaRailgun ^ may be interesting
 
@PhiNotPi It'd be pretty simple to brute force. Just try every programs and check if it's the same as the original one.
(simple as in simple to figure out the solution. Implementing that would probably take longer than a non brute force solution)
 
11:16 AM
Hmm. There's a bounty up for Japt solutions, wonder what other languages have too few users
@Shaggy any suggested questions japt would do well on? :P
 
@ASCII-only I'd love to see more Brachylog
 
11:46 AM
Challenge idea: Workflow. While spacebar is depressed, hammer the processor.
 
12:06 PM
@Adám Maybe learn it then ( ͡o ͜ʖ ͡o)
 
@Fatalize What does ( ͡o ͜ʖ ͡o) do again? ;-)
 
ERROR: -g consult('/opt/brachylog2/src/brachylog.pl'),run_from_files_no_file('.code.tio','‌​.input.tio','.tmp.tio'): false
It crashes the transpiler (┛ಠ_ಠ)┛彡┻━┻
 
12:20 PM
@ASCII-only This looks like a good starter challenge.
@ASCII-only This one too
 
1:13 PM
@Deadcode oh wow, nice division by 4k+1 prime
although note that about 20% of my answer is unary conversion
 
 
1 hour later…
2:40 PM
@Shaggy How are you finding these? (I don't want to post for the ones you linked)
 
3:07 PM
@Quintec They happened to filter up to the top of the active challenge list as I was answering @ASCII-only
 
Ah, makes sense.
 
@Quintec I currently have a 6 byte solution for the first and a 9 byte one for the second if you want to try for them (or better).
 
@Shaggy Cool, thanks, I currently have 11 bytes for the first, working on it :)
 
3:42 PM
I like it when I do `dnf upgrade` and some random shit I never remembered installing gets listed
Like, oh, my dragon is getting updates. Neato.
 
 
1 hour later…
4:43 PM
@Shaggy Question: How to filter a string in Japt? All I can find is to split, filter, and join, which seems way too long...
 
@Quintec Sounds like you're looking for the o and k methods.
 
@Shaggy yes I was, I got the 6 bytes for the first one now :)
 
5:09 PM
11 bytes for the second, hopefully can golf it
 
@Quintec Unfortunately, Oliver beat you to that one in the meantime.
 
Well I wasn't planning on posting any of these, I'll keep thinking :)
 
@Quintec Why not post them?
 
@Shaggy I thought someone else already got it and just hadn't posted yet
@Shaggy Ah, I forgot that Japt has methods for addition/subtraction
 
@Quintec No, not to the first challenge.
 
5:16 PM
@Shaggy I’ll post it then unless you want to
 
@Quintec No, I'll be posting very few Japt solutions for the next while to give people enough opportunity to claim the open bounty.
 
@Shaggy Got it, posted :)
 
@Quintec The exact solution I was steering you towards :) +1
Incidentally, we have a dedicated chatroom for Japt if you have any questions in the future.
 
Awesome, I'll check it out :)
 
5:42 PM
0
A: Sandbox for Proposed Challenges

BeefsterArrays start at π (WIP) code-golf array interpolation < Meme goes here > Your task is to take an array of numbers and a real number and return the value at that point in the array. Arrays start at π and are counted in π intervals. Thing is, we're actually going to interpolate between elemen...

 
 
1 hour later…
 
2 hours later…
9:10 PM
"You cast 'Identify' on the staff, and get an unusual response: "You do not have the necessary permissions to perform this action. Please contact your Spellframe Administrator"" — Chronocidal 6 hours ago
 
"What the hell does PC Load Component mean?"
 
@AdmBorkBork gold. Pure gold.
 
9:31 PM
@AdmBorkBork Hopefully you ritual casted identify otherwise you just wasted a spell slot and got a 403
 
@Veskah Insert the paper cartridge.
 
@Poke ain't nobody got time for rituals
 
@J.Sallé only 10 minutes!!!
 
@Poke disclaimer: I usually play barbarian so I basically just roll all the d20s and kill stuff
 
9:47 PM
@J.Sallé time for the little wizard to meet the big <hammer, axe, sword>
 
I play hammers whenever I can
tbqf I'd probably have smashed all the loot in the process of killing stuff while enraged
 
10:13 PM
-2
Q: Programming Puzzle

Zero.{14}security.{15} [^s]{3}s [^s]{6}s[^s] s[^s]{12}s [^s]{8} def ^It'..[ywkni][klmop][zwta] ce.$ jus [^f]*fenc y, it's t ...t Give your answer. Also - we like to write secure and maintainable software. In that context, when might regular expressions be a good thing, and when might they be a bad t...

 
@NewMainPosts "when might they [regex] be a bad thing": When they look like that one.
 
10:33 PM
Security through Obscurity is the ideal way to do everything
 
@Veskah so friggin' secure not even the devs know what the heck is that
 
I don't even look at my monitor when I code. That way, bad guys won't be able to figure out what I was doing
 
Doesn't matter if they have a keylogger when your keystrokes are randomly selected taps head
 
Now you're getting it
 
10:58 PM
Just cat /dev/random > thing until it works.
 
@Shaggy any non-starter challenges? :P
Also hmmmmm... Wonder why Japt has no argument selection like Charcoal does (using different argument names for each nested function)
 

« first day (2949 days earlier)      last day (1898 days later) »