« first day (2366 days earlier)      last day (2771 days later) » 

16:00
r1;2r
@HyperNeutrino probably wrong
@HyperNeutrino Yes
or not
(I mean I was guessing what your code might've been and it gives the same result)
oh
hmm how does fix
@HyperNeutrino 4 bytes you said?
16:01
yup
CMC: number of distinct prime factors
12 -> [2,3] -> 2
Æv ;_;
less boring: ÆFL
@LeakyNun Pyth, 3 bytes: l{P
do it in SILOS :p
What's SILOS? >_<
16:03
@Mr.Xcoder tio.run/#silos
python: lambda n:len([f for f in range(2,n)if n%f==0and all(f%k for k in range(2,f))])
@HyperNeutrino 77: lambda n:len([f for f in range(2,n)if n%f<1and all(f%k for k in range(2,f))])
@HyperNeutrino I give up on that one
Hint: Use the same atom that you used last time.
16:07
@HyperNeutrino Oh
:)
don't give up tho lol
@HyperNeutrino I don't
@HyperNeutrino I must use ŒḄ, right?
I haven't found another solution, but I know there's a 4-byter with that one
16:11
@HyperNeutrino Does it use ?
mine doesn't, but I think you can
@totallyhuman O_o what is 'programming ligature'
@HyperNeutrino Does it use r?
oh I see
@Mr.Xcoder mine doesn't
16:12
@HyperNeutrino Does it contain Œ more than once?
>.<
mine doesn't.
@HyperNeutrino R?
ok ŒḄ is at the very end, so just figure out in two bytes how to get the first half and then do ŒḄ.
@HyperNeutrino :)
the next sequence tho ;_;
round(cos(n))
finally a sequence where you don't have to spend two hours doing research
16:21
@HyperNeutrino Hooray, RṚŒḄ. What was yours?
Same but with U lol
nice job
Thanks
Like RUŒḄ
'nother one
yup k lemme think of a good one
do the next sequence in Jelly
round(cos(n))?
16:23
Super
I don't think it should be too hard but I haven't tried it yet
Try it
@HyperNeutrino Is ÆẠ in radians?
16:25
It gives -0.95 for 60
It should be 0.5 in deg
But how do I convert to deg?
°
deg -> rad
AE for rad -> deg
Oh, thanks
except you should be using radians lol
16:26
Æ°
@HyperNeutrino What?!
the sequence uses radians
Can you link to OEIS
?
NVM
Can somebody post A34?

Cubix, `....I2%:)O@`
well we have to wait for an answer to A484
@HyperNeutrino ÆẠĊ
16:28
I just answered that one
I will
@Mr.Xcoder not quite
Too late
that's ceil but you need round
16:28
@BlackCap StepHen did
I really wish I could answer more than once per hour
@HyperNeutrino ÆẠḞ
that's floor isn't it
sorry to disappoint you but that's still wrong
Searching through the atoms
ÆẠær0 hehe
you pretty much have it
so I'll just tell you what the atom is because it's a bit obscure
there really should be a round atom (maybe there is o0)
16:31
@BlackCap Sorry, didn't see that til afterwards
Fire truck just passed a tractor on a country road outside my window xD
or at least I think it did, couldn't see the actual event but it was already pulling over when it left my field of view
Is ruby taken?
16:34
the shortest solution you may post is 5 bytes lol
yes, just open the snippet and Ctrl-F Ruby
oh A000004 already happened lol
@HyperNeutrino no, 0
although it amounts to the same thing
>.<
there's no A0 though
@HyperNeutrino When there isn't a sequence for a length, it uses the first available sequence
so a 0 length program would use (and remove) A000005
(atm)
16:35
hm ok
If there isn't a sequence for then length of the last post, then the sequence for your post is the lowest unused sequence. @HyperNeutrino
ah ok
I really REALLY REALLY REALLY wish I could still participate but there's the one hour rule >.<
@HyperNeutrino ninjas would be so much worse if everyone could always participate
true
we'd all be ninja-ing each other lol
Wouldn't that be more fun though?
16:38
I've been thinking about the ninja'ing and what do you think of no time limit after 100 answers?
also I expect this question to be autoprotected some time within the next few days
You can't answer twice in a row, but you have no time limit
@cairdcoinheringaahing I think shorten it to maybe 10-20 minutes
no time limit would still cause a bunch of ninja's
having a shorter limit allows people to post more answers and reduces ninja'ing a bit I hope
@ALL who here can [un]protect questions (i.e. rep >= 3500)
@HyperNeutrino No, because it will gradually become inactive
true
maybe that would be a good idea
though we've had 50 answers within the past 24 hours xD
50+
16:39
@HyperNeutrino @ALL who here can [un]protect questions (i.e. rep >= 3500)??
What?
people with >=3500 rep can protect/unprotect questions
so like you can
@HyperNeutrino I know. So, what?
the OEIS question will be autoprotected quite a bit I think
@HyperNeutrino By community?
@Mr.Xcoder yup. self-deletions
16:42
@HyperNeutrino Only mods can unprotect questions protected by community.
oh, I think I misread my privileges when I've hit 4k
I just noticed the new and improved stack snippet
half of the revision history of the Hello World challenge is just protect/unprotect lol
16:44
Time for some arithmetic CMCs
more cthulhu dev?
@HyperNeutrino Yes
@cairdcoinheringaahing did you say alephalpha answered the next sequence?
I won't PR anything thiygh
@HyperNeutrino He didn't
16:45
@HyperNeutrino I thought he answered within the time limit
But he didn't
I really want to hit 5k today
ooo you're close
Anyone easy main challenge?
I might post one soon if I can think of a good one
16:46
destructive concatenation?
brb opening sandbox to pull challenges out of it
Final feedback?
2
A: Sandbox for Proposed Challenges

HyperNeutrinoSlowly converging zigzag Given a single positive odd integer as input, return a converging zigzag as a list of strings, list of lists of characters, or newline-separated string, in this form: # # # # # # # # # # # You can replace # with any consistent non-whitespace cha...

Lol, I just got an upvote
I want to hit 10k network rep soon lol
@Mr.Xcoder typically happens if you say you want to hit <reptarget> lol
@HyperNeutrino Wait till I read it
here's a sandbox of mine that I offer to anyone who wants it: codegolf.meta.stackexchange.com/a/10995/41805
16:48
I highly doubt it's someone in this room though
idk ¯\_(ツ)_/¯
Nor do I ¯\\_(ツ)_/¯
lol I have 5 things in my rep log all about the OEIS challenge
new ><> answer to OEIS
I find the challenge... Hm... quite non-interesting
Tell me about it
16:49
lol
@BlackCap Wait, how do you have that dark theme?
isn't it funny how ><> backwards is ><>?
@Mr.Xcoder its pony exclusive
but it's frozen
@Cowsquack how do you unfreeze rooms?
ask mods
the oeis challenge is back to partitions!
@HyperNeutrino I don't understand the testcases
16:52
AGAIN (ノ°Д°)ノ︵ ┻━┻
@Cowsquack what about them is unclear?
nvm
I figured it out
@HyperNeutrino it looks good
┬─┬ ノ( ゜-゜ノ)
put the tables back ಠ_ಠ
actually wait
I'm thinking of having a way for people to nominate languages that they want used in the answer-chaining, but a meta post would be closed :(
Actually what do people think of this: Someone (not me) posts a CW answer with a list of languages that people want used. It can't be larger than, say, 10 languages, so one of them has to be used before new ones can be added. I accept that (pin it to the top) and people can pick from that.
16:58
I don't like that idea.
Nor do I
I do like that idea ..
I am writing a new challenge
It's not exactly an answer, and even if we "make an exception", we don't want to make exceptions to begin with, and we don't want people thinking that that's acceptable, or that that's what community-wiki is for.
17:01
grr. 18 minutes to go before I can answer again
What do you think about this: Write a program that outputs double the integer in the answer before yours and has a double number of bytes.
@HyperNeutrino @cairdcoinheringaahing ^?
that will get huge quickly
@HyperNeutrino "huge"?
double the bytes
@HyperNeutrino Yeah, thought about that too
17:02
the size limit is 65536 bytes
you get 1024 bytes in 10 answers
that only allows for like 16 answers
NVM, I don't like it either
also I posted the zigzag challenge
I won't answer it because it's too hard for my lazyness
17:03
lol
what, did you expect CMC-level easiness???
@HyperNeutrino Pff, no, I'm just too lazy now
CMC: output powers of 2
infinitely
@HyperNeutrino You have 8.1k on PPCG, I have 8.1 k network
lol
i=1
while i:print(2**i);i+=1
did you want 1 too?
meh
either way is fine
17:06
if so then:
actually
i=1
while 1:print(i);i*=2
><> <><
@totallyhuman 9 bytes, Pyth: W1^2Z=+Z1
Also 9 bytes: K1W1K=*K2
Z is initialized to 0 i presume?
@totallyhuman yes
and..... capped ._.
17:09
.-.
with 7 hours to go until a new day ._.
9 bytes: W1^2Z=ZhZ
I have an answer to A196 in Pony if anyone can post an answer yet: pastebin.com/F6wikmjJ
17:10
Man, take it easy
._.
I have +201 today
Like this ^
oh ye i liek updoots
gimme more
oh hey new challenge
hmm
17:11
why do I keep getting +201
we get it you cap
:P
I had a period like that too ^^^
hrmm
i can't think of a good way to approach this
I have the first part :)
i=input()
for x in range(i):print' '*x+'#'
17:19
[0, 1, 2, 3, 4, 3, 2, 1, 2, 3, 2]
number of spaces per line for 5
3 -> [0, 1, 2, 1]
interesting
n - 1 ranges concatenated together
@HyperNeutrino Your test cases with 7: 3<(7+1)/2
NVM
@totallyhuman wt is this?
14 mins ago, by totallyhuman
number of spaces per line for 5
17:44
can someone explain this
> a(n) = n! * sum i=0 ... [n/4]( (-1)^i /(i! * 4^i))
hmm...unreadable
like what's exp(-x^4/4)/(1-x)
@HyperNeutrino maybe (e^(-x^4/4))/(1-x)?
tried but then it gives errors
well gives wrong results
I think it's e**(x**4/4)/(1-x)
we all know -x**4 == x**4
or does it mean e**(-(x**4)/4)/(1-x)?
17:47
it is not (-x)**4 but rather -x**4
@Cowsquack yeah oeis doesn't parenthesize well
dunno why
nvm, chained onto OEIS challenge
> keyword easy
I don't think that means that it's easy to implement lol
I don't even know what it means xD
> An exceptionally nice sequence.
what languages are left lol
Processing
aaa I want to try using Hexagony but it's confusing
17:56
K
@HyperNeutrino If only the language had some way of warning you... too bad nothing in the name suggests that :P
7
lol certainly not... xD
How should I get more bots for my koth?
@HyperNeutrino ooh bc is nice

« first day (2366 days earlier)      last day (2771 days later) »