« first day (2398 days earlier)      last day (2447 days later) » 

1:01 PM
@Adám wait a minute
before you post
 
@LeakyNun Why?
 
@Adám because it's a dupe
 
@LeakyNun Really?
 
Well, I have it in 10 bytes of Jelly
 
1:04 PM
20
Q: Alphabet triangle strikes again

Leaky NunTask Your task is to print this exact text: A BCD EFGHI JKLMNOP QRSTUVWXY ZABCDEFGHIJ KLMNOPQRSTUVW XYZABCDEFGHIJKL MNOPQRSTUVWXYZABC DEFGHIJKLMNOPQRSTUV WXYZABCDEFGHIJKLMNOPQ RSTUVWXYZABCDEFGHIJKLMN OPQRSTUVWXYZABCDEFGHIJKLM NOPQRSTUVWXYZABCDEFGHIJKLMN OPQRSTUVWXYZABCDEFGHIJKLMNOPQ RSTUVWXYZAB...

@Adám ok it isn't an exact dupe
go ahead and post it then
 
@LeakyNun Here, this one is more interesting:
 
@Sherlock9 ugh, you can put a comment under this answer
5
A: "Hello, World!"

Sp3000Parenthetic, 766 698 630 bytes ((()()())(()())((()())((()()())(()()()()))((()(())(())())((()(()))((()()(()))(()()())((())()()()()()()()()()()()()()))((()()(()))((())()()()()()())((())()()()()()))(()()()())))))((()(()))((()())((())()()())((())()()()))((()())((())()()()()())((())()()()()()()))((()...

 
for 1 return:1
for 2 return:1 3 4
for 3 return:1 4 5 7 8 9
for 4 return:1 5 6 9 10 11 13 14 15 16
for 5 return:1 6 7 11 12 13 16 17 18 19 21 22 23 24 25
for 6 return:1 7 8 13 14 15 19 20 21 22 25 26 27 28 29 31 32 33 34 35 36
for 7 return:1 8 9 15 16 17 22 23 24 25 29 30 31 32 33 36 37 38 39 40 41 43 44 45 46 47 48 49
for 8 return:1 9 10 17 18 19 25 26 27 28 33 34 35 36 37 41 42 43 44 45 46 49 50 51 52 53 54 55 57 58 59 60 61 62 63 64
for 9 return:1 10 11 19 20 21 28 29 30 31 37 38 39 40 41 46 47 48 49 50 51 55 56 57 58 59 60 61 64 65 66 67 68 69 70 71 73 74 75 76 77 78 79 80 81
 
I don't get it
 
13 mins ago, by Business Cat
So if I understand correctly, it's an n x n rectangle of the alphabet, with the top right triangle cut away
 
1:13 PM
I get that, I don't get the number one
 
1

1 2
3 4

1 2 3
4 5 6
7 8 9
 
@DJMcMayhem it's the same
 
@Adám can be achieved by starting at 1, then alternating incrementing by n-1 and 1, until you reach n^2
sorry starting at one, then adding n, then alternating between n-1 and 1
oh wait no it can't
 
@Adám SOGL, 12 bytes: ²Δ.n{ē.-I{KP
 
Jelly, 7 bytes: ²sµḣ"JF
 
1:18 PM
@Adám Eh good enough, 22 bytes :/
 
SOGL, 11 bytes after fixing a bug. If I had a proper counter variable then it'd be 9 or 8 bytes
 
24 bytes (for older CMC) why D:
 
10 bytes with taking input from the stack
alphabet CMC, SOGL, 11 bytes: ³Z*n;{KēImP (10”r added for easier testing as it expects input on the stack (could be <s>10</s> 9 bytes with a counter variable :/))
 
1:33 PM
Alphabet CMC, Jelly, 10 bytes: ²ØAṁsµḣ"JY
 
CMC: Find the LCM of the range [1..n], what I think I'm going to call the LCMorial
 
@Sherlock9 Test case?
 
1
2
6
12
60
60
420
840
2520
2520
 
If I wasn't lazy and actually made the LCM operator for Gaia, it'd be 2 bytes
 
1:38 PM
@BusinessCat Dew it
 
I'm going to see if I can make a GCD function in Parenthetic and work up from there
 
I thought Gaia was basically complete by you don't even have LCM?
ಠ_ಠ
 
Nah far from done
I don't have it because I don't like to make operators that only work only one type/combination of types and I haven't figured out what else to put on it
 
@BusinessCat what I do with SOGL is I mix completely unrelated things :p - is factorial, reverse array and reverse string on newlines
 
Yeah I have some completely unrelated things too
 
1:41 PM
Why isn't it negate :P
It says literally no
 
@totallyhuman in monospace the o looks like ! a bit :p
 
is sign for numbers, trim for strings, deltas for lists
And multiset union/intersection are ranges when used with numbers
 
I used ± for sign lol
It's plus or minus duh :P
 
Why does reduce in Proton return a function ಠ______ಠ I can't even do this CMC
 
@totallyhuman I use that for negating, string reversing and arrays vecorize
 
1:45 PM
Oh ye I wanted to file an issue on that
Might as well do that considering neutrino is on vacation
 
Proton, 58 bytes if not for random interpreter bugs: n=>reduce((a,b)=>a*b/(g=(x,y)=>y?g(y,x%y):y)(a,b),1..n+1)
 
@programmer5000 because for him the question was still open
 
You know what stinks about trying to implement GCD in Parenthetic? I forgot that there's no modulo in Parenthetic ಠ__ಠ
 
checks are only done client-side
 
1:50 PM
@EriktheOutgolfer what?
So... I could bypass the client-side validation to answer it now?
ಠ_ಠ
 
ಠ_ಠ that's dumb
 
Then how did pizzakingme do it?
 
@totallyhuman because the question ain't symmetric
 
1:55 PM
If anyone wants to try to golf the grass thing then here is a simplified version I guess
https://tio.run/##hVRNb6MwED0zv2LaHmwKTZUPZauoaU@76m2POaQIESANWhcjm5Sy2v@enTEkoVK7ewDPx3tvZmzLm8TuDoc0qfEBX0xibTuqWry///7zB9g6SX8t16IQoWjoC8b00yKCymjCvi6FgCzf4raUZfKah5iYFxviRmetvwDvRelNotCphNhzwFM6TVTsorjssutFhIFjg9fjMFgiFcVrVHkpOeWDt9WGUV2xbdmtb4lhA4vSVabCQw1JridWLCTHVGRQfb1Y3IyjUVFm@bvs1HwfA0do/kvoy/rUlsffcCyqu@77jD5O9CbAO2M6AG8hqUmT208n@8deDqXPM3493Sfb@wVjMN65377DU8tWWm5OFWVu@SxHtlJFLcVzKfrT4hSfjIPw0fCg1@wdsSioxhXucqU0NtqoDOg@iSITIa7Fu4hoiXwXq5sizV14SxexS0nRUoQDSBE/RCl@nwKt8CMfr7DZ14@P4BoWQjxDMEGnhc
 
but it would've saved a whole bunch of bytes on my charcoal answer
 
0
A: Sandbox for Proposed Challenges

programmer5000code-golf? code-challenge? answer-chaining string JS, 44 bytes Here's a list of languages & byte counts from PPCG: JS, 44 bytes Mathematica, 174 bytes Scala, 91 bytes 05AB1E, 12 bytes dc, 13 bytes Python 2, 115 bytes V, 25 bytes Charcoal, 48 bytes Jelly, 10 bytes Haskell, 25 bytes MATL, 14 byt...

 
The goal is basically to make the stack as easy to reach as possible
 
104
A: How was this answer posted after this question was closed?

Tim StoneIf a question is closed while you're answering on the full version of the site, you will receive a notification that the question was closed and the 'Post Your Answer' button will be disabled. However, this is only a client-side restriction, so it is possible in some cases that this process fails...

 
Which is mostly avoiding the use of +1 if there's any alternative
Someone can try changing it to ternary to see if it helps
 
oh wait
i think i know why reduce is borked
 
@totallyhuman ಠ___ಠ
 
because reduce is part of functools in python3
 
@totallyhuman lol
 
still doesn't explain why it isn't just throwing a nameerror
 
@ASCII-only but why is a non-existent function not throwing
 
@totallyhuman Oh it exists
 
...then what does it do ಠ_ಠ
 
!!reduce = (function, array) => {
	list = list(array)
	if !list return 0
	while (len(list) > 1) {
		list[0, 1] = [function(list[0], list[1])]
	}
	return list[0]
}
 
what
what is that
 
2:07 PM
the implementation of reduce?
 
where
nvm i found it
ಠ_ಠ just use the built-in reduce function
this is overcomplicating things
 
@ASCII-only I don't see how that returns a function wtf
Not only a function but a function that returns a function that returns a function...
 
There's another Proton bug bugging me
 
then bug neutrino about the bug with a bug report on the bug tracker
 
2:13 PM
Actually a few, maybe I'll blow up the issues page
 
is bork
the way functions work is borked
i dunno
 
that's for real?
 
.-. how could this happen
 
2:20 PM
wowza my android question's about to hit 4k views
well no
but it's at 3,644
that's more than pie got
 
Hallo
 
hi
 
:O new main challenge
another alphabet?
 
wowza
oh this is nice
 
2:23 PM
I try to FGITW in Python :)
 
@ATaco : Userscript which shows quality of chatroom by finding median length of last 20 messages
 
Trying to golf from 65 bytes :/
 
oh dude c'mon
;-; that's just range adjustment, no fair
 
@totallyhuman Yeah, you got me by 7 seconds, I got you by 7 bytes :)
@totallyhuman blows raspberry :-) - I gave you an consolation upvote
 
> that's just range adjustment
@totallyhuman isn't yours?
 
2:29 PM
@Mayube What?
@totallyhuman See the good part: We'll both be outgolfed by Rod :)
 
@Mayube what do you mean?
 
1
Q: Semi-Diagonal Alphabet

TheIOSCoderGiven a letter of the English alphabet, your task is to build a semi-diagonal alphabet to the input. How to build a Semi-Diagonal alphabet? Brief Description: First, you take the position of the letter in the alphabet, P (P is 1-indexed here). Then, you print each letter until the input (incl...

 
hey what's bitwise for n-1
 
@totallyhuman ~-n
 
dammit looks you got the optimal version
 
2:34 PM
Yay, I tried to golf yours and it was mine :)
 
@Mr.Xcoder have you used ARKit before for iOS?
trying to get 3D characters overlayed based on longitudes latitude
 
Nope, I didn't use it
I took a break from iOS dev a month ago
 
Is it normally allowed to use input() in Python 2 and expect the input like 'this'?
 
@BusinessCat Yes, you are allowed to use input() and wrap in brackets
 
@Mr.Xcoder what where does it say this
 
2:36 PM
I don't think you'll get shorter though
 
Unless the challenge allows
 
@Downgoat Why would it be a problem? I have used it in tons of answers, you are generally allowed to take input as a string.
 
@Mr.Xcoder The thing is for python AFAIK input() always returns a string so wrapping input in quotes is a different string
if you use a Lang where input is evald then that's different
 
@Downgoat Not in Python 2
 
Ok well if it is still a string of the language gets it with extra quotes it's a different stribg
 
2:40 PM
python 2 is allowed to take strings with quotes around it to save 4 bytes
that's about it
 
@totallyhuman 59 bytes :)
 
@Downgoat Input is evaled in Python 2
 
Braingolf is really bad at ASCII art stuff
 
@DJMcMayhem I thought everyone use python 3
 
But the question was specifically "is it allowed in python 2?"
 
2:48 PM
@Downgoat not for golfing
python 2 is better usually for golfing
python 3 is better for... just about everything else
 
Generally, yeah 2 is better. But sometimes new features in 3 are nice
(like splat)
 
When you do array-manipulation, 3 is much better for golfing
 
@Ruud Leaky doesn't like Python 2. — Mr. Xcoder 5 hours ago
 
@LeakyNun Am I wrong?
 
@Mr.Xcoder did I imply that?
 
2:53 PM
Not necessarily, more like you only do Python 3.
 
hmm
is exply a word
 
@totallyhuman no it isn't
 
wow, Pyke has character range :c
 
dangit
charcoal : pls allow other degree cursor pivots
45 and 90 is so restrictive
 
2:58 PM
WHY DO PEOPLE RANDOMLY DOWNVOTE MY POSTS?
 
hmm?
 
@totallyhuman -1 for my Python answer (that happened 1 week ago too)
 
o0
why?
oh wait nvm that's what you're asking
 
it gets really annoying
 
mm
the ones without explanations are annoying
 
3:01 PM
@totallyhuman they're the ones that can be done without storing anything
yay pyth is better than charcoal
 
I think I can do better
 
@EriktheOutgolfer what?
 
multiples of 45 degrees can be done with a constant direction among the 8 directions
 
right
but degrees like 15 and 30
 
the others may need to alternate between directions, so they have to store a number or something and it's confusing when it changes or even an operator called "cycle state" may be needed
 
3:03 PM
quetion: what is the loop variable stored in
 
and of course who ain't too lazy to implement that? :p
 
in charcoal
 
@totallyhuman first free variable starting with ι and ending with θ cycling from ω to α
free = not used by any parent loop
 
@Mr.Xcoder No need to yell
 
Too late to edit, sry
 
3:06 PM
yeah yelling is when something is repeated too many times and there's a reason for it
or it's just too intense
 
@EriktheOutgolfer oh thanks
 
Well, I wrote modulo, gcd, and lcm in 388 bytes in Parenthetic (that will probably have to increase as I may need to rename gcd later on)
 
@totallyhuman that extra byte is exactly to fix that issue
 
But reduce was being such a pain in the butt that I'm taking a break from Parenthetic to work in a more human language
 
3:09 PM
@Sherlock9 nice!
@Sherlock9 you don't need reduce
 
Or maybe I mean a more humane language
@LeakyNun How do you get the LCMorial then?
Lists, my friend. They're a pain
 
@Sherlock9 no
just the same way as factorial
recursion
but instead of multiplication u lcm
 
Recursion sucks. Iterative is where it's at.
 
@EriktheOutgolfer @ASCII-only blasphemy has occur
 
@LeakyNun facepalm You know what sucks about this epiphany. I've already written LCMorial in this exact way in Racket before
Should have realized earlier XD
 
3:14 PM
@Sherlock9 lol
 
@Mr.Xcoder I mean you have over 9K rep so like -2 isn't like super big diff to your rep :P
 
@Downgoat I know, but you see your answer leading and then osabie gets upvoted and mine downvoted, and suddenly I have the second :0
 
⁺℅⁺ι⁶⁴ this bit is pissing me off
 
@Mr.Xcoder RIP
 
I couldn't get below 19 in Gaia
 
3:18 PM
@Downgoat Thanks. Good luck with ARKit
 
@totallyhuman there's §αι too ;)
for half the size
 
@EriktheOutgolfer I think you have to add 1 for that to work
 
⁺§α⁻ι¹ is same byte count for my approach
rip
 
In case anybody wants to generate some more numbers and compare results: The sum of the first 7^77 numbers in the sequence is 333640244023888511998016913602068358641316864529234192648289‌​85216343326549842791‌​62327502549917668322‌​95074492998398754534‌​1421076028 — Niklas B. Nov 28 '16 at 23:46
totally did not brute force
 
the return of the alphabet challenges is upon us
 
3:29 PM
And people like them. I had a very similar challenge in mind, but harder (compared to the new one)
 
@LeakyNun Having some trouble again: tio.run/…
LCMorial[6, 1] runs fine and every LCMorial before that. But after LCMorial[7,1] everything breaks
 
What is Parenthetic? The new brain-flak or so?
 
Something about a Parentheses Mismatch
 
@totallyhuman CMC: Output aBcDeFgHiJkLmNoPqRsTuVwXyZ
 
@Downgoat Ono where
@Mr.Xcoder no, the really really old one
 
3:34 PM
> (() ()((()))()) LCMorial
so long
 
@ASCII-only :o
 
I asked them to golf the hello world (and they managed to golf quite a bit :D), turns out it's actually pretty intuitive
 
@StepHen SOGL, 8 bytes: z{ē2%⌡Uo
 
:o I earned 3 tag badges today
 
untested really interesting looking code: print map(chr,sum(zip(range(97,122,2),range(66,91,2)),()))
 
3:36 PM
@totallyhuman wat
 
@StepHen PowerShell, 41 bytes -- -join(65..90|%{[char]($_,($_+32))[$_%2]})
 
With a little Python 3 editing, I get this
>>> print(list(map(chr,sum(zip(range(97,122),range(66,91)),()))))
['a', 'B', 'b', 'C', 'c', 'D', 'd', 'E', 'e', 'F', 'f', 'G', 'g', 'H', 'h', 'I', 'i', 'J', 'j', 'K', 'k', 'L', 'l', 'M', 'm', 'N', 'n', 'O', 'o', 'P', 'p', 'Q', 'q', 'R', 'r', 'S', 's', 'T', 't', 'U', 'u', 'V', 'v', 'W', 'w', 'X', 'x', 'Y', 'y', 'Z']
 
i edited
 
@StepHen Gaia, 10 bytes: ₵a:2%;ₔ⁻⌉Z
 
>>> print(list(map(chr,sum(zip(range(97,122,2),range(66,91,2)),()))))
['a', 'B', 'c', 'D', 'e', 'F', 'g', 'H', 'i', 'J', 'k', 'L', 'm', 'N', 'o', 'P', 'q', 'R', 's', 'T', 'u', 'V', 'w', 'X', 'y', 'Z']
 
3:37 PM
yay it works
58 bytes
shorter to hardcode :P
 
true, same for PowerShell
but that's boring
 
@StepHen Proton, 43 bytes: print(''.join(chr(i+32*(i%2))for i:65..91))
 
@BusinessCat what
oh nvm
nice
 
@BusinessCat Oh, that's a good idea. Saves 4 bytes by doing multiplication rather than selecting
-join(65..90|%{[char]($_+32*($_%2))})
 
Why doesn't it work to do i%2*32 instead?
I'm confused
 
3:42 PM
@LeakyNun Any luck?
 
@totallyhuman @BusinessCat @StepHen print("aBcDeFgHiJkLmNoPqRsTuVwXyZ") is much shorter
 
It seems * has higher precedence than %
 
4 mins ago, by totallyhuman
shorter to hardcode :P
 
4 mins ago, by AdmBorkBork
but that's boring
 
3:43 PM
@Mr.Xcoder Boring -1
 
Shorter +1
 
@BusinessCat hehe ninja'd you
 
PowerShell, 28 bytes -- "aBcDeFgHiJkLmNoPqRsTuVwXyZ"
 
@Sherlock9 could you comment the rest of the code?
 
Yeah, let me find it all
 
3:45 PM
print([[chr(x),chr(x).lower()][x%2]for x in range(65,92)])
 
@LeakyNun Just checked: LCMorial[6, 7] is also not working
 
@LeakyNun Okay, but LCMorial[6, 8] and LCMorial[6, 9] works. May be some problem with 7
 
Cantor's unspeakables
 
CMC: Given an integer, return it multiplied by the golden ratio
Golden ratio = Phi (just in case)
Jelly, 3 bytes: ×Øp
Pyth, 4 bytes: *.n3
 
3:57 PM
Actually, 2 bytes: φ*
 
Well done +1
 
Welp, that's a constant Gaia doesn't have
 
05AB1E doesn't have it haha
 
lambda n:n*(1+5**.5)/2
python does not have it anywhere in stdlib
 
@LeakyNun And plain lcm(7, 60) works fine as well
Is it a bug?
 
3:59 PM
@Sherlock9 let me install a debug later
 
@totallyhuman yes, it's basically just $\sqrt{5}$
 

« first day (2398 days earlier)      last day (2447 days later) »