« first day (2846 days earlier)   
00:00 - 05:0005:00 - 23:00

@ASCII-only got it working, thanks :D
this is disappointing :|
A: List all possible titles for the Anno games

GeoProlog 117 bytes b(X):-between(0,9,X). w(X):-write(X). y():-b(A),b(B),b(C),b(D),X is A+B+C+D,X=9,(A=0;B=0;C=0;D=0),w(A),w(B),w(C),w(D).

I'm selecting various fields from answer posts, and I wanted to get the tags, but apparently tags are only on question posts
eval+q[] is still shortest (44)...
which is why I had the question id already, but still needed the tags of that question
also, why does the OwnerDisplayName field not work :/
5:07 AM
anyone able to golf this prolog code?
@ETHproductions wait what. link to broken query?
it just doesn't seem to work in general, I'll make a new query to try it out
Which translates to 50 in APT (may be 49 with more efficient crc solver) 3 to go.
5:13 AM
@ASCII-only one obvious improvement: Try it online!
@ais523 you mean this?
oh, for some reason I forgot > would work
I was vaguely thinking about the things that A/B/C/D are as something other than an integer
no idea why, given that I knew I could compare it to zero
Fun fact: of the last 500 answers on PPCG, only one answer has a negative score, and even that answer is only at -1
@user202729 you don't need quotes around ejZYxs in Perl, saving one byte (although obviously, if you just remove the quotes and do nothing else, the CRC won't match
@ETHproductions which one?
we normally don't downvote answers unless they're wrong (and if they're wrong they typically get deleted), so I can see why we wouldn't have many downvotes
5:19 AM
A: The first, the last, and everything between

RosLuPAPL(NARS), 104 chars, 208 bytes i←{⍵>0:⍳⍵⋄0,⍨⌽-⍳∣⍵} R←{0>⍵-⍺:⍬⋄⍺>0:(i⍵)∼i⍺-1⋄1=×⍵×⍺:(i⍺)∼i⍵+1⋄(i⍺)∪i⍵} f←{⍺≤⍵:⍺⍵,¯1↓1↓⍺R⍵⋄⍺⍵,⌽¯1↓1↓⍵R⍺} This is a try using one alternative iota and range function for see if exercise would be easy as the range and iota function use Nars APL. Test for the iota l...

(questions are downvoted much more often)
user apparently had an existing 14-char solution in the exact same language
yes, apparently correct but really ungolfed
maybe being at -1 is correct then?
I wouldn't vote it either way though
by contrast, 4 of the last 500 answers have gotten a score greater than 11
5:22 AM
Nice, thanks :)
(how'd you find my main query, btw? just curious)
ah, didn't know about that page
@user202729 bc the variable contains nothing...
5:30 AM
@ASCII-only Variable? No, that's a bareword.
Variables need a sigil.
wait nvm
i mean... this works tho
12 mins ago, by ais523
@user202729 you don't need quotes around ejZYxs in Perl, saving one byte (although obviously, if you just remove the quotes and do nothing else, the CRC won't match
and so does the normal way
oh, in A Pear Tree it may become a variable though
due to the special bareword parser
(that'd be a problem only in that its value would be the null string…)
@ais523 No, only 1 occurence.
I can never remember the rules of how that thing works
even though I wrote it
@user202729 there we go
But... the bytes...
5:33 AM
ooh, I see, print is interpreting the bareword as a filehandle and printing $_ to it
you have to love Perl's ambiguous parsing sometimes
I guess it's easier to just use the quotes :-D
@ais523 Ok that's right...
Still at ~49 bytes with no improvement.
Even without the quotes it will take min 47 bytes.
I guess there's a limit to how much I should help with this (given that you're trying to break my cop submission and thus I already know the answer)
@ais523 Agree...
@Quintec What do you mean
5:46 AM
wait that's not updated query :/
I was gonna say
5:57 AM
@ETHproductions ok. kinda works but not really
getting there! I was just gonna download a large set of answers as a CSV and use JS or smth to try and pick apart the language
can you do regex features like \d and ? in SQL?
@ETHproductions Depends on the flavor
@ETHproductions certain flavors. not this one tho
@ETHproductions *use the userscript :P
You can use PATINDEX (or the LIKE filter) which is like regex-lite
6:01 AM
xd the second last one though: This started out cool and small
You can also just implement regex yourself in T-SQL
you could make the query better by removing -foo and (foo) too, to remove data about perl flags and different implementations of languages
what about my more recent title Brachylog v2? I used to write it as Brachylog (2) for consistency with tools like this, but it confused people
imo do Brachylog (v2) instead
like in JavaScript (ES6) the ES6 is more of a version name than a version number
I personally think v2 is alright, I could see (v2) being used too
6:27 AM
@Mego Seeing the words regex-lite makes me think back to how horrible POSIX BRE is
6:44 AM
Q: Alignment of a string

Vedant KandoiThis is similar to the alignment used in word. Task 3 inputs: A 1 line string, a positive integer k, and direction (left or middle or right) Your job is to insert new lines(\n) and spaces in the string such that every line has k characters in it and aligned to the direction given. Rules The ...

1 hour later…
7:45 AM
Q: Upward and onward to greater glory!

CharlieMay this challenge serve as (another) tribute to Stan Lee, who passed away aged 95. Stan Lee has left us an invaluable legacy and a peculiar catch word: Excelsior. So here's a small challenge based on what he said it was its meaning: Finally, what does “Excelsior” mean? “Upward and onward to...

2 hours later…
10:00 AM
Q: How to inverse this insertion sort?

JokerX Can someone help me with this?

hi all
5 hours later…
2:32 PM
8 messages moved to Trash
2 hours later…
4:38 PM
Further attempt at cracking ais's APT cop submission:
46 bytes (but print a newline)
Anyone here know Haskell and can help porting 11-year-old Haskell code?


For general discussion and feature requests regarding tryitonl...
Yes, a bit... oops, not this one.
1 hour later…
5:51 PM
ouflak assumes integers are 1 digit long, is that ok — ASCII-only 7 hours ago
When I saw this comment, I assumed that ouflak was a brain-flak derivative I'd never heard of, not a user
That was really confusing
(me too)
6:02 PM
@DJMcMayhem "ou" means "or" in Portuguese. Brain-flak with only OR logic gates allowed?
crazy people :P
With only or logic gates? how would that even work?
It wouldn't even be a flak-variant at that point
Oooooh wait I know
Everything in Bflak is implicitly added. Change the implicit operation to ORing instead.
Could you even.... Do... Anything?
Ignore that, I confused OR and XOR
@J.Sallé How is that pronounced? oo (rhymes with "do")? ow (rhymes with "cow")?
@DJMcMayhem the same as the ou in mould, so kinda in-between those
6:08 PM
So rhymes with "go"?
or "goal" depending on accents
At least with my dialect/accent, the o in Go, goal, and mold would all be the same. So I'm not entirely sure what you mean
@J.Sallé If I did make an ouflak with only OR gates, should it assume that all integers are 1 digit long? :P
@DJMcMayhem well that's the definition of it isn't it? hahahahah
6:17 PM
Unfortunate realization: For ouflak to work, you'd have to either remove negatives or have bounded integers. :(
I think the OR-gate constraint could be broadened to XOR gates as well
6:41 PM
Ouiflak. It's just like Brain-Flak, but everything is in French.
7:10 PM
@AdmBorkBork OurFlak. Brainflak, except the intrepreter downloads a few bytes of source code to each computer that runs it, interprets, and sends it back to the original computer.
7:59 PM
@AdmBorkBork well... sorry to break it to you, but English and French brackets are the same :P
Guillemets kinda sorta are brackets.
At the very least bracketesque.
just like << and >>? ;-)
> <<ah, nice brackets over here...>>
‹ › and « » are different from < > and << >> though.
well... not sure if DJ would approve :P
it's supposed to be a Turing tarpit anyway...
@Riker /r/farpeoplehate
8:14 PM
@EriktheOutgolfer thatsthejoke.jpg
8:54 PM
@EriktheOutgolfer I actually really like bflak derivatives
@quartata Jolf?
I think it's interesting to see which elements of bflak are more useful/necessary than others
hm, so, would you approve a Brain-Flak with 10 or 12 commands?
I don't consider it something that needs my approval
sure, didn't ask that in a very serious way
8:57 PM
I think that could be really interesting
One derivative I've had in the back of my brain for a while is adding dyads to the language. Like... For example (...|...) would evaluate to a * b, or [...|...] would run "code" on the top "n" elements of the stack or whatever
@DJMcMayhem Doesn't that sort of defeat the point of a set of brackets containing one piece of data?
ಠ_ಠ I can never spell when on the internets
A little bit, yeah. But that's why it's a derivative.
And it still has the... nesting nature? of brain-flak? Not sure what the best phrase for that is
telescopic? :P
Yeah XD
@DJMcMayhem tree-style structure? That's how I've always pictured Bflak programs
9:00 PM
Theoretically, that framework could support functions with variable arity too. Like (...|...|...) could be prod(*arguments)
and, miraculously, () would still be 1
@cairdcoinheringaahing I guess that's one way too look at it. I've always thought of it like each command has two different useful elements to it. It returns a value to it's parent and performs an action.
reduce(int.__mul__,map(sum,args))if args else 1
(Of course, there are exceptions. () performs no action, and <...> returns no value)
Ooh, you could make it that the separators must also be perfectly balanced
9:02 PM
@EriktheOutgolfer But that would be because it's the nilad, and not prod([])
As in (...|...|...) is fine, but ((...|...)|...) wouldn't be
the product of the empty array is 1
Yeah, but the nilad () isn't the dyad (...|...) with no arguments, it's an entirely different atom
yeah, that's the current Brain-Flak sense
@cairdcoinheringaahing So (...|...) would not be considered balanced?
I guess you could still do two argument atoms with (...|...|) and just leave extraneous empty arguments
9:05 PM
@DJMcMayhem Exactly. In order to do a * b, you'd do (a|b|())
Interesting. I'll have to give that more thought
heh, what a twist would that be
Even though I've never worked on implementing this derivative, I have a pretty good sense of what I want the 4 dyads to be, so I'd have to think about if that would mess with any of them
You could use <()> as an argument as 0, no?
Or just the empty string.
Theoretically, the empty string should evaluate to 0 in brain-flak
9:07 PM
what if we consider missing arguments to be places to be filled with the nilad of the enclosing brackets?
e.g. (x||y|z|)(x|()|y|z|())
That seems deliciously evil
Does that mean {...||...} would also pop an extra element?
depends on how we define variadic {}
but the middle will be filled with {} in that case
That reminds me of what I originally planned for {...|...}. I was thinking it would be Evaluate code "s", N times because that effectively implements repeat n times and multiplication in one dyad
like, {s|N}?
9:11 PM
So popping 6 elements would be {{}|()()()()()()}, and push(a*b) would be ({a|b})
@EriktheOutgolfer yeah
sounds nifty :P
although... how do we deal with the balanced | requirement now?
Oh, I don't know. I devised that dyad before caird's idea
I think I have another idea in this case (totally unrelated)
@DJMcMayhem What would be a n-adic version of that?
As in {{}|()|()|...|}?
I don't know. For a "do x n times" it doesn't really make sense to have additional args
So I'd either define everything to be dyadic (not variadic) or change that atom
9:14 PM
my idea: {c1|c2|...} would first execute {c1}, then c2, and then rinse and repeat ({c3}, c4, ...)
so, {c1}c2{c3}c4{c5}c6...
or a stricter variation: {c1|c2|...} first executes {c1}, then, if c1 was ran at least once, c2, rinse and repeat
(if c1 didn't run at all, exit the loop)
<(*.*<) a dancing Kirby is my contribution to this discussion. That matches, right? ;-)
jeez, unmatched <
@AdmBorkBork Beckoning Kirby?
@AdmBorkBork =0 :P
9:20 PM
@DJMcMayhem What about the ability to define and call custom functions?
i.e {()|()()|...} defines f1(x, y) = ... and <()|()()|()> calls f1(2, 1)
brb, making Kirby-Flak
doesn't look very variadic...
@cairdcoinheringaahing I've thought about that. I think... That kinda feels like a separate variant to me. Like a different idea for a derivative
@NMP Is it possible to create a python bot that makes one of these things? Yes.
Q: Python recaptcha /captcha solver

TommasoIs it possible to create a python bot that makes one of these things?: • Analyze recaptcha audio to recognize the answer • Resolve a solvemedia captcha • Resolve a recaptcha

10:23 PM
the whole point of captchas... can we get around that?
good question
thinking about it for a couple minutes and i don’t think thanksgiving has a signature drink. let’s see if we can get this trending #getthanksgivingasignaturedrink
@Poke (The answer is yes)
this tweet actually took me off-guard, i hadn’t really realized
apple cider or eggnog are kind of generally seasonal (fall or winter)
@Quintec the answer is sure in theory but the point of them existing is that it makes it more difficult and you shouldn't
not thanksgiving per se
10:25 PM
@quartata and then you had to go set the rest of us at unease >.<
now i'm anxious
i'm gonna go home and eat my feelings now
it's your fault i'm getting fatter!
see ya later
I'm shook. Now I won't be able to finish my assignments tonight -.- at least I have a valid exucse
@quartata I want to say cranberry juice but that might just be my family
@Pavel that could work
I don't like cranberry juice
IKEA juice for the win
I think it's Lingonberry or something
10:40 PM
i like cranberry juice but you should mix a little bit of another juice with it
cranberry and apple is good
It's not that I don't like it at all, the flavor is just too strong normally
IKEA juice is still the best juice though
@quartata I was shocked when I found out our local convenience store sells small bottles of eggnog year-round
00:00 - 05:0005:00 - 23:00

« first day (2846 days earlier)