« first day (2092 days earlier)      last day (2737 days later) » 

Anonymous
12:02 AM
Has this been done before? Given R > 0, output the number of solutions to the Diophantine equation x^2 + y^2 = R
 
Anonymous
(R need not be an integer)
 
Can it be called a Diophantine equation if it has a non-integer?
 
Anonymous
Yep - Diophantine simply refers to the fact that only integer solutions are considered
 
I don't get it... how are you going to get x^2 + y^2 to not be an integer?
 
Anonymous
Oh, fair enough
 
Anonymous
I had a momentary lapse of mental facilities
 
halp, my compiler is borked
~/vsl-stl/src master
❯ gcc sys.cpp
Undefined symbols for architecture x86_64:
  "_main", referenced from:
     implicit entry/start for main executable
ld: symbol(s) not found for architecture x86_64
clang: error: linker command failed with exit code 1 (use -v to see invocation)
 
use g++ for C++
 
@feersum facepalm forgot about that
@orlp you seem to be influential in SE Politics
e.g. post on MSE in response to official posts
 
0
A: Sandbox for Proposed Challenges

MegoDiophantine Circle A Diophantine equation is an equation where only integer solutions are considered. For example, the equation x**2 + y**2 = 1 has infinitely many solutions, but only 4 integer solutions ((0, 1), (1, 0), (0, -1), (-1, 0)). Given R > 0, output the number of solutions to the Diop...

 
12:20 AM
@NewSandboxedPosts Now this sounds familiar...
I remember one with some super weird solution by Peter Taylor.
 
Anonymous
@feersum Can't imagine why :P
 
CMC: what's one meta post that you think shaped a Stack Exchange site?
Mine is
222
Q: Docs is broken: Writing Docs we actually need

noɥʇʎPʎzɐɹCThe current system rewards writing documentation that is already covered by the official docs. Meanwhile, popular libraries without good official docs are undercontributed. The system is broken, and it needs fixing. This result runs counter to how Docs was pitched: Q: What should be documente...

hey, if you look at the activity graph of new sandboxed posts you can see when posts are sandboxed
very different from New Main Posts activity graph
 
...CMC anyone?
 
I remembered the weird thing was called "Mobius inversion".
 
12:25 AM
Hi @Qwerp-Derp!
 
Anonymous
Of course it already exists
 
ABRACADABRA whisper chat room activity please
 
CMC: Find a mapping between 4-bit numbers and members of a partition set of 7-bit numbers such that one chosen element in the partition and any other element in the same partition has exactly one bit different. If 1111111 was a chosen element for a partition, then other members of that partition must be 0111111, 1011111, 1101111, 1110111, 1111011, 1111101, and 1111110
 
0111111, 1011111 have 2 bits different but they are in the same partition?
 
They're 1 bit different from the selected element 1111111
You choose what the selected elements are
 
12:34 AM
/me doesn't follow.
 
You choose 16 7-bit numbers. Flip each of the bits, one at a time. Each of the numbers you just got are members of the partition.
Say 1001011 was your selected element.
You flip the first bit: 0001011.
You flip the second bit: 1101011.
Third, fourth, fifth, sixth, seventh: 1011011, 1000011, 1001111, 1001001, 1001010
all of those together are now the partition
xRQ^L2U7 is a Pyth program that will return the partition for a specific 7-bit number.
 
@StevenH. Mapping?
 
is there a terminal util that unzips an archive, in any format?
 
@noɥʇʎPʎzɐɹC Probably not, but maybe some sort of 7zip commandline utility exists
 
A bijection, to be more precise.
 
12:48 AM
@ASCII-only then I'm making an open source one :D
 
xVRQ.[L0 7jR2^L2U7 is a Pyth program that will return the partition in bits, and take input as a bitwise array
if you want it \shrug
 
Halp how do I find a mapping
 
carefully
 
@noɥʇʎPʎzɐɹC huh?
 
There are 8 of one partition and 16 4-bit numbers, probably just being stupid but I don't get this (or do you mean mapping of 4 bit to one of 16 partitions with 8 numbers each)
 
12:53 AM
The latter
 
So basically we just need to find 16 partitions that cover every 7 bit number right?
 
^
Might have been an easier way to put it
 
huh
what is this
about partitions
 
So we have a set S with 128 members, and 128 size-8 subsets of S, and want to know if there is a choice of 16 of those subsets such that their union equals S?
 
@feersum Yes
 
12:58 AM
The set cover problem is a classical question in combinatorics, computer science and complexity theory. It is one of Karp's 21 NP-complete problems shown to be NP-complete in 1972. It is a problem "whose study has led to the development of fundamental techniques for the entire field" of approximation algorithms. Given a set of elements { 1 , 2 , . . . , n } {\displaystyle \{1,2,...,n\}} (called the universe) and a collection S {\d...
 
Well maybe not, either one would have the same answer here.
 
1:33 AM
0
A: Sandbox for Proposed Challenges

Wheat WizardNumerical Lookalikes The task here is simple for a given number find how many other numbers share the same digits. For example there is no other number that can be made out of the digits of 11 so 11 scores one. However the digits of 12 can also make 21 so 12 scores a two. Lookalikes cannot ...

 
Question: do you think algebra solver or short-iteration syntax is better for code-golfing number sequence
 
1:50 AM
0
A: Sandbox for Proposed Challenges

Wheat WizardResort your Dictionary A lot of things are sorted in alphabetical order. And this is fine for most people. But I don't trust the system so I want my things sorted in QWERTY order. The task is to take a list of strings that are already sorted in alphabetical order and resort them into QWERTY o...

 
New homework excuse: imgur.com/AMuMVeA
 
<3
that's a dwarf hamster
I used to have those
they're cute but not really attached
 
You discovered the auto-linking feature of SE root urls, huh?
 
For a second I thought maybe we had gotten our new design and that's why he was so shocked
 
2:02 AM
[ppcg.se]
:(
@El'endiaStarman I guess :|
 
@quartata That was my first thought too. :P
This is fascinating and disturbing:
...looking at the related videos sidebar, I sure hope that this one doesn't show up in any of theirs.
 
2:24 AM
@noɥʇʎPʎzɐɹC yes
don't remember what its called tho
 
@feersum :(
 
0
Q: Optimized way to search an object array based on multiple key-value pairs

Saurabh PalatkarI wrote a generic extension method which will return an item which matches all the given search criterions (lookUpArray). Here is the Demo. /***************************Extension Method****************************/ var utils = {}; // Could create a utility function to do this ...

 
I am not sure why people ask HW question on SE when JAR decompiler exists... :P
 
Anonymous
I really don't understand how someone can read "Programming Puzzles & Code Golf" and think "Clearly this is the correct site to ask general programming questions."
 
Anonymous
Especially when that same person has rep on SO
 
2:41 AM
@Mego What are you talking about? We have a tag called and his question title has the word "optimized" in in it. This is clearly the right place to ask his question. /s
 
@Downgoat I have no idea how a JAR decompiler would help
 
HW: Fill in source code so it behaves like provided jar file
(essentially)
 
also, now IntelliJ comes with a built-in decompiler
its so easy to view the source
 
:O
 
the only problem is when you want to view the docblocks
maybe one day, IntelliJ will deduce whatever was written in the docblocks based on the code
but by then, we won't be programming
 
2:58 AM
1
Q: Tiling arbitrary rectangles

Alex L.Can these rectangles be tiled? Given a bunch of rectangles, you are asked whether or not they can be tiled to fill a rectangle. Specs Given a bunch of arbitrary m x n rectangles; 0 <= m, n <= 1000, determine whether or not it is possible to tile them so that they cover exactly a rectangular ar...

 
3:34 AM
I just beat my Atomas highscore! This game took me 2-3 hours.
Not all in one shot either.
 
@mbomb007 did you just replace the white with dark in your avatar
and recolor some bits
 
@mbomb007 wwhat is this?
 
^
 
@mbomb007 ;_; my best is barely 20K, how u do dis
 
4:00 AM
CMC: Golf: num % 10 >= 5 ? num + (10 - num % 10) : num - (num % 10)
 
4:10 AM
Round to nearest ten?
Can you just divide by ten, round as usual, then multiply back?
 
plus some langs let you round to negative decimal places
 
Or even just add five, divide/mult
(assuming int div)
 
@mbomb007 trying atomas on arc-welder rn
@mbomb007 367 oxygen
 
4:29 AM
 
4:52 AM
Since Its a little slow right now would someone mind checking out this esolang I wrote yesterday?
 
I saw that
I didn't read the description super carefully though
 
5:27 AM
yo!
any actual feedback instead of just downvotes for this?
-2
A: Sandbox for Proposed Challenges

Destructible WatermelonQuine tree Inspired by that really weird quine challenge For this challenge, you must choose three languages. (Sandbox: not sure if different versions of same language (Python 2 and 3) should be allowed) These languages will be referred to as X, Y, Z. For this challenge, you must write a progra...

 
@DestructibleWatermelon I wasn't one of the people that downvoted but I have absolutely no idea what the challenge is asking. I read the spec several times and it is quite confusing.
I think I understand It now
But it could still use some clarification
I also think it might be too hard
 
5:44 AM
@DestructibleWatermelon Didn't downvote either, but very unclear, please provide an example, no source reading is a standard loophole IIRC, just link to loopholes
 
6:26 AM
0
Q: How to fixed the sized of the sub region(table) in the oracle appliction

Nirmolendu SinghaHow to fixed the sized of the sub region(table) to 100% in the oracle application. What I am facing is that when any of the column in my sub reason(table) having many contents, then it occupy 100% width and if it having less content then sub region get shrinks, which I don't want. Can any on...

 
@ASCII-only ok thanks
@WheatWizard thanks
is there a word for infinite tree?
Btw this challenge is going to be incredibly difficult, but people on this site are like sorcerors
 
7:00 AM
rewriting most stuff now
 
7:10 AM
Can I use polyglot to describe a program that performs different functions in different languages?
note the wikipedia page
In computing, a polyglot is a computer program or script written in a valid form of multiple programming languages, which performs the same operations or output independent of the programming language used to compile or interpret it. Generally polyglots are written in a combination of C (which allows redefinition of tokens with a preprocessor) and a scripting language such as Lisp, Perl or sh. Polyglot markup is similar, but about markup language context. Polyglot persistence is similar, but about databases. == Methods == The two most commonly used techniques for constructing a polyglot program...
(I know wikipedia can be wrong)
 
@DestructibleWatermelon <- check this if it works
 
ok definitely can
 
@BetaDecay I have a solution to you indefinite bounty. What constitutes shortest?
 
Hello
 
7:27 AM
hello
 
7:46 AM
trying to interpret repetition
 
@Qwerp-Derp ???
 
10
Q: Interpret Repetition!

Qwerp-DerpThis challenge is the first in a two-challenge series about Repetition. The second will be up soon. In a language called Repetition (something I just made up), there consists an infinite string of 12345678901234567890..., with 1234567890 repeating forever. The following syntax is available to o...

I have no idea how though
 
@anyone have any ideas for the esolang contest?
 
@ASCII-only Repetition, but expanded
 
@TimmyD You should also check out videos from super STOL competitions.
(and this guy)
 
8:02 AM
@ASCII-only I may submit Jellyfish.
 
I think I'll submit Charcoal, but I'd also like to submit something more esoteric
I wonder if it's possible to program in noit o'main worb with low leakage
 
0
A: Sandbox for Proposed Challenges

Peter Taylor Note: this is an attempt to fix up a currently closed question by someone else so that they can rescue it, not an attempt to steal their question. When implementing an algorithm for correcting aliased measurement data, I hit the need to implement following function. The function takes input ...

 
Do you know about brownian logic? It's a bit similar.
 
I think I should submit Logicode
 
0
Q: how random is rand(); ? not that random :D

Huinia Huiniso i wrote a code that guesses random numbers between 1 and 100; so int j= random number; the actual number that should be guessed is an average number of 2 random numbers; int g= (random1+random2)/2; and guess what? I'll show you what happened.I do not believe that such ...

 
8:16 AM
edits
-2
A: Sandbox for Proposed Challenges

Destructible WatermelonQuine tree Inspired by that really weird quine challenge For this challenge, you must construct a quine tree, which is a thing I made up, specifically an infinite binary tree. How a quine tree works: A quine tree has infinite nodes. Each node is associated with a program Let X, Y, Z, be ...

actually rewrote
 
@Mego > if you do not understand just leave it cuz it is obviously to tough for your head. have a nice day
Get rekt… kinda
 
I definitely think esosub, the 2d lang with substitution I'm making, should be entered
 
I sent Logicode over just then
 
wait how do I enter...
so confuse where is the enter thing
 
8:20 AM
@ASCII-only Jellyfish isn't really intended for golf, it just has 1-byte instructions because that makes sense for a 2D language.
 
halp meeeee
 
What's CALESYTA?
 
@DestructibleWatermelon It's in the "rules" section.
 
@DestructibleWatermelon calesyta.xyz/en/rules.html
 
8:23 AM
@ASCII-only Hexagony should definitely be there imo.
 
wait a second
I think my language has a trivial translation to bitfuck (brainfuck with smaller cells)!! AHHHH!
oh noes
 
Anonymous
@Fatalize Yep, I flagged it :P
 
> A Copyleft license is recommended.
;_; whyyy
 
I think it just should be at least that non-restrictive
you can pick more free license probably
 
8:27 AM
@Mego TIL you have a 99 bottles of beer builtin
 
darnit, how did I not see this equivalence...
 
Anonymous
@ASCII-only Yep. Seriously/Actually are HQ9 supersets. Mostly because I think those 3 challenges have been played out in code golf. The quine builtin is useful for recursion, though.
 
Well Brachylog is the only esolang I know that is a declarative logic language
So I guess it fulfills the "original" requirement
 
I guess I still have output non-equivalence
Still, this is most certainly not the fashion I wished to learn of the turing completeness of my languages ;_;
 
> 2015
I didn't know so many esolangs were that old
 
8:32 AM
Creativity in the delivery of the material: consistent look-and-feel, appeal to humor and satire, reference to cultural milestones.
^ pretty stupid criterion imo
 
> submissions that have some Argentinian features will be rewarded
 
even worse
But I guess there's not much to win besides some advertisement
Has anyone submitted something yet?
 
I don't think so, there's still quite a lot of time
> Can you print "Hello Susana\n"? 99 bottles of beer? Can you list the prime numbers? Can you write a quine in your language?
^ What esoteric language can't do those
 
> The first version of the quine (it is the first quine in Malbolge ever) has been released at December 3rd, 2012. This are about 14 years after the release of Malbolge.
Might be that you haven't found a way to do it before submitting
 
Anonymous
@ASCII-only "Hello Susana, N, r♂P (input is # of prime numbers desired), Q
 
Anonymous
8:37 AM
Super easy :P
 
Maybe, but the only reason Malbolge took so long is because it's one of the hardest languages to program in
 
They don't seem to value golfing in the rules
 
Anonymous
I wonder if every TC language is capable of having a quine program (for some definition of output). Quines aren't necessarily related to TC-ness, though I would think there would be a way to frame the idea of a quine as a decision problem.
 
Yeah, it's an esolang contest, not a golflang contest, plus code golf is pretty specific
 
I might submit Brachylog… it's declarative logic based, and it uses constraint programming for all arithmetic which is unique for an esolang afaik (using cp for arithmetic by default is also unique to Prolog-langs)
You forgot a c in Brachylog, whoever is writing :p
Are the languages in "Definitely" because the authors confirmed that they would submit it?
 
Anonymous
8:44 AM
Hmm... If you look instead at the problem of a problem recognizing its own source code (outputting a truthy value if the input equals the source code and a falsey value otherwise), that's a decision problem that TC languages can decide, and is very related to quining. That might be enough to say that every TC language can have a quine written in it (though it may require infinite time/memory to produce the output).
 
@Fatalize No, just unique enough to be considered a serious entry
 
I would definitely put Funciton in there then
(how the hell did you find about that challenge anyway? Did they advertise it here?)
 
Anonymous
I have plans for an esolang I want to implement and submit
 
Anonymous
@Fatalize Martin linked it a few days ago
 
Now the question is how did Martin find it :p
(typo on the "languages that should be submitted: he creator of tha language)
 
8:57 AM
@Fatalize I'd say he almost certainly found it here
 
I see
 
@ASCII-only TBH I don't really think it's an esolang anymore
You can actually do stuff in it
Except that the code is obscenely long
 
I wonder if Brain-Flak would be a good submission
 
Ummm
Can anyone help with Repetition?
I'm wondering about submitting it (if it's good enough)
 
9:09 AM
link?
 
@Fatalize No link yet
I just have an idea
 
idea?
 
Uhhh
 
@Fatalize It's from one of his challenges
 
^ (Which isn't really revised)
@ASCII-only Is it a good idea for an esolang submission though?
 
9:12 AM
@Qwerp-Derp Repetition? Sure, it seems like a unique concept
 
But pulling it off is fairly hard, I'm guessing
 
Depends on what you mean by fairly hard, in PPCG language design standards this is average difficulty
 
True
Maybe it's because I'm pretty bad...
 
9:40 AM
I just want to say, brainflak is a really cool language.
 
Ummm I finished the docs for Repetition
 
++- (Everything is eval'd left-to-right in Repetition, so this evaluates to "(1 + 2) - 3")
Shouldn't it be ((1 +2) + 3) - 4?
 
Fixed!
 
*** (Evals to "(1 * 2) * 3")
1 * 2 * 3 * 4
 
Also fixed
@DestructibleWatermelon Ditto
@Fatalize Any more issues?
 
9:55 AM
This feels like a dupe
 
Wait wot
 
Not sure
 
what are you talking about @betseg?
I think I'm about to begin implementing esosub
 
@DestructibleWatermelon What's esosub?
 
2d substitution lang
 
9:59 AM
Ooh it's a lang
 
Whoa kule
 
Though it was something like the calculator thing question
 
@Qwerp-Derp wait someone thinks I have a good idea
:) hooray
 
Both of these take precedence over arithmetic operators - if there are s's and c's to the right of any +-*/, the s's and c's get eval'd first.
Why not make everything purely left to right?
 
@Qwerp-Derp wait actually are you referring to esosub?
 
10:06 AM
@DestructibleWatermelon For the "Whoa kule"?
If it's for that then yes
 
@Fatalize I kinda like keeping it this way, 'cause it's possible to do something like 12 + 34
 
I keep forgetting how to open files in python
 
should be open() in all langs :p
 
So I have the idea, but I don't know how to implement it
 
10:13 AM
@betseg Should be?
 
Repetition update: Added nested input thingos
Now also added | separator
 
10:31 AM
hi all
 
Good afternoon
 
I'm bored
 
@DestructibleWatermelon Is there a link to GH for Esosub?
 
hi
 
@Qwerp-Derp not made yet
I'll link you when I've got something
 
10:34 AM
hi @Emigna Do you think you would be able to implement Ryser's algorithm en.wikipedia.org/wiki/Computing_the_permanent#Ryser_formula easily
 
definitely not as golfy as the naive algorithm
but it doesn't seem hard to understand
seems interesting to try and golf it
 
this is going to be my first time making a proper 2d lang
 
I've wanted to make a 2d lang, but it feels hard to make one that is meaningfully different to existing langs
but language ideas in general are hard imo
 
Is Repetition original in any way?
 
@Emigna That's why I'm so happy I got a good idea
unless my brain tricked me again
 
10:44 AM
@DestructibleWatermelon Hint: You brain tricked you
 
I'm interested in seeing how it turns out. 2d langs are the coolest ones :)
 
I should make a 2d lang, but Turing tarpits are so much easier .-.
 
@StevenH. Easier = less fun to make IMO
 
@StevenH. make both
in one
protip
 
10:48 AM
@StevenH. [citation-needed], because for some TTs, making an interpreter is hard :P
 
I want to see an example
Because I'm honestly curious
@ASCII-only, but having it be easier means it's faster -> you get to code in it faster -> more fun overall
@DestructibleWatermelon, true
 
best way to code / and \ mirrors?
 
@DestructibleWatermelon / => [dx, dy] => [-dy, -dx]
 
@StevenH. Nope, Turing Tarpit -> pain to code in, plus interpreter is done faster -> get bored quickly and no fun
 
@DestructibleWatermelon \` => [dx, dy] => [dy, dx]`
Or you can make a 1D programming language with a 2D memory model
Even cooler
 
10:57 AM
@ASCII-only you and I have very different opinions of TTs then
 
@StevenH. I mean seriously I don't really find writing a prime checker in BF fun
 
Some challenges are just frustrating and not fun, but there are a bunch of things that can be fun with TTs
 
I wrote a prime checker in Turtlèd. That was fun
 

« first day (2092 days earlier)      last day (2737 days later) »