« first day (2041 days earlier)      last day (2804 days later) » 

12:01 PM
@Adnan how is it?
@ReleasingHeliumNuclei yes, you really missed that
 
>_>
the dictionary i use dont have world
so the hello world only print Hello, W!
 
@Adnan halp inconsistency: no multiple digits at the end but yes in the beginning
 
@LeakyNun yes, that was on purpose
 
@Adnan add stack operators please
 
@LeakyNun Added
 
12:16 PM
@Adnan Also, I had a CMC which is abs(n-1) which I did in 3 bytes
 
how to replace every uppercase letter to lowercase in a file?
 
@TùxCräftîñg guG
 
@LeakyNun Hmm
 
@TùxCräftîñg :%s/[A-Z]/[a-z]/g lel
 
12:19 PM
nvm it doubled it i am stupid
so now the hello world is small yay
 
@LeakyNun I have no idea how
What is the answer?
 
@Adnan you give up so fast
it is your own language
22 hours ago, by Fatalize
pls halp @LeakyNun is better than me at my own language
 
@ReleasingHeliumNuclei that's very wrong. You mean :%s/\v([A-Z])/\l\1/g
Or maybe \L I'm not sure
Oh it's either
 
@LeakyNun Does it also work for negative numbers?
 
@Adnan no
 
12:26 PM
So is the break already over, or it didn't start yet?
 
Hahahaha
@LeakyNun Ahh, it's <01.
 
0
A: Catalan Numbers

Leaky NunOasis, 9 bytes nxx«*n>÷1 Try it online! Oasis is a language designed by Adnan which is specialized in sequences. Here, we shall use the following relationship kindly provided by Stefano Sanfilippo: Currently, this language can do recursion and closed form. To specify that a(0)=1 is simpl...

 
@MartinEnder my teacher went on a rant yesterday about how some students were calling the pythagorean theorem the "theorem thingy".
 
@Adnan you meant >
 
Yes, sorry
 
12:28 PM
@Adnan now, n%4 without the built-in
 
halp
ruby Fixnum#chr dont support unicode chars
 
@LeakyNun Oh, nice
 
@Adnan Feature request: if an A2 operator is at the beginning, let the second argument be a(n-2) instead of a(n-1)
Currently it is useless, since + became equivalent to x, and * to ²
- became N, ÷ became 1
(then Fibonacci would be +T)
 
Oh, that is clever
n%4 is 4e32T.
 
@Adnan nice
so n%2 is only 2 bytes
10 hours ago, by Leaky Nun
@Adnan n%4 is 4e32T
 
12:32 PM
@LeakyNun hahahaha
 
and n%3 is 3 bytes
1
A: 4, 8, 15, 16, 23, 42

Martin ThomaThe following snippets will print 4, 8, 15, 16, 23, 42 infinitely often: Python OASIS import urllib2 response = urllib2.urlopen('https://oeis.org/search?q=id:A104101&fmt=text') html = response.read().split("\n") while True: print(html[6][-15:]) Char-Codes: four = ord('') eight = ord("\n...

Why is OASIS already a reference to OEIS here? @Adnan
 
Hahahaha, must be a mistake
What a coincidence
 
@Adnan When is W used? (Sorry for many pings)
 
@LeakyNun For big boring sequences
 
@Adnan like?
 
12:35 PM
Let me see if I can find one
 
””×÷…‘’αβωτπφ≈←→¿¬əḑç
 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~⻵⻶⻷⻸⻹⻺⻻⻼⻽⻾⻿⼀⼁⼂⼃⼄⼅⼆⼇⼈⼉⼊⼋⼌⼍⼎⼏⼐⼑⼒⼓⼔⼕⼖⼗⼘⼙⼚⼛⼜⼝⼞⼟⼠⼡⼢⼣⼤⼥⼦⼧⼨⼩⼪⼫⼬⼭⼮⼯⼰⼱⼲⼳⼴⼵⼶⼷⼸⼹⼺⼻⼼⼽⼾⼿⽀⽁⽂⽃⽄⽅⽆⽇⽈⽉⽊⽋⽌⽍⽎⽏⽐⽑⽒⽓⽔⽕⽖⽗⽘⽙⽚⽛⽜⽝⽞⽟⽠⽡⽢⽣⽤⽥⽦⽧⽨⽩⽪⽫⽬⽭⽮⽯⽰⽱⽲⽳⽴⽵⽶⽷⽸⽹⽺⽻⽼⽽⽾⽿
(temporary) codepage of Ru
 
Damn, is it just me or is OEIS very slow
 
OEIS is very slow
 
@LeakyNun Hmm, I can't find it anymore
 
@Adnan Will you do this?
25
Q: Hofstadter Q-sequence

Leaky NunDefinition a(1) = 1 a(2) = 1 a(n) = a(n-a(n-1)) + a(n-a(n-2)) for n > 2 where n is an integer Task Given positive integer n, generate a(n). Testcases n a(n) 1 1 2 1 3 2 4 3 5 3 6 4 7 5 8 5 9 6 10 6 11 6 12 8 13 8 14 8 15 10 16 9 17 10 18 11 19 11 20 12 Reference Obligatory OE...

 
12:41 PM
Okay
 
@Adnan OEIS is going to be very slow if you input 0,0,0 as search query
OEIS search likes big numbers
 
I just searched with google using "a(0)=0" "a(1)=0" "a(2)=0" oeis.
 
so is google slow or oeis slow?
 
OEIS is slow
 
12:42 PM
When I tried to click an OEIS link, it was slow
 
google works fine for me
 
But the problem seems to be solved now
 
@TùxCräftîñg Golfing language?
 
yes
the codepage is padded with CJK but now i am filling it with meaningful[citation-needed] characters
 
Cool I'm doing one too >_>
Codepage is too much work though, I just picked some random encoding
 
12:44 PM
cool thing: Ru is infix \o/
 
Infix is best fix
 
and the shitty parser allow a lot of wtf constructs
like ++ == α+:α+β;
 
@Adnan Feature request: if a recursion does not specify a(0), default it to either 0 or 1
I'm still struggling which is more appropriate
 
I think a(0) = 0 is a lot more used
 
@Adnan Submitted two feature requests
 
12:49 PM
0
A: Hofstadter Q-sequence

AdnanOasis, 9 bytes (non-competing) Non-competing, since the language postdates the challenge. Code: n-anc-a+V Expanded form (V is short for 11): a(n) = n-anc-a+ a(0) = 1 a(1) = 1 Code: n # Push n - # Subtract a(n - 1) from n a # Calculate a(n - a(n - 1)) n ...

 
@Adnan e = Pops x, pushes a(n - x) (A 1)
22 hours ago, by Fatalize
pls halp @LeakyNun is better than me at my own language
 
@LeakyNun holy shit, I didn't even know that was possible
 
@Adnan you don't know your language...
 
@LeakyNun Get that nasty transcript out of my face!
 
22 hours ago, by Fatalize
pls halp @LeakyNun is better than me at my own language
 
12:52 PM
how do I do the owl face thingy
 
You can't now, for whatever reason
We used to type @ and then that username would appear
 
@Adnan ಠ_ಠ
@ಠ_ಠ plz
come back
 
It's a great geeling when someone is better than you at your own language
 
@RohanJhunjhunwala ಠ_ಠ
@LeakyNun ಠ_ಠ
 
I'm not being sarcastic. I think its good> Its a poweful part of this community
 
12:57 PM
@Adnan How do you know my real name :o
 
@LeakyNun You used it as your first username here?
 
@Adnan :o you remember
@Adnan Look at my sample program here
 
good symbol for power except ^?
 
@TùxCräftîñg ? and * are used by some languages
 
: Add ಠ_ಠ in the room description so we can copy-paste
 
1:02 PM
good idea for *
 
Typically it's **
 
You can copy paste from the chatiguette ironically where it says not to use it
6
 
But if your language uses the multiplication sign for multiply you can probably use * for power
 
Ru use × to multiply
so go for *
yay
 
I think ^ is more readable
 
1:04 PM
ruby have **
@BusinessCat it's already used for XOR
 
I use ¦ for XOR because I want to watch the world burn
5
 
wat
:/
i have no idea how to type the borked bar with my compose key
 
@BusinessCat you monster
 
@Adnan Feature request: recursion check
 
because its not in my settings LOL ROFL XD
 
1:10 PM
@LeakyNun I think you are missing an initial starting point?
Or is that what you meant
 
@Adnan yes, but recursion check?
like, stop before it exceeds the limit
then you won't need the limit at all
you can check if it is referencing itself
 
Oh, you mean that
 
Can anyone help me combine the first two replace stage into one in this Retina program? I really feel like they could be 1 stage =/
 
I'm finally on my new Windows XP computer! Hello! :D
 
»  echo '“H i”¦… „…a' | ./ru c
Hai
 
1:12 PM
WTF
 
seems like the only reasonalbe way to print Hai in any language
 
@BusinessCat ftfy
 
Oh nice, thanks!
 
it split (¦) H i (“H i”) with a space () and join it () with a (…a)
 
1:15 PM
@BusinessCat ftfy again
 
Wat
you're too good at this >_<
 
0
A: Swap bits with their neighbours

Leaky NunOasis, 17 bytes n4÷axxn4÷xxe+3120 Try it online! Oasis is a language designed by Adnan which is specialized in sequences. Currently, this language can do recursion and closed form. We use this formula: a(4n+k) = 4a(n) + a(k), 0 <= k <= 3 To specify the base case is simple: the 3120 at the ...

@Adnan ^
 
@LeakyNun Nice one
 
@BusinessCat you're a genius
 
1:21 PM
@LeakyNun I already fixed the issue: github.com/Adriandmen/Oasis/issues/2
 
@Adnan I saw it, thanks
 
CMC: Print a pyramid of height N. 1 is `/\`
 
@Adnan Now what should a(1) default to?
@DJMcMayhem very clear thanks
 
VTC as unclear
 
I can't draw 2 on my phone. :(
 
1:21 PM
if you just want to give one testcase, at least give n=3
 
@DJMcMayhem You mean something like this
  /\
 /  \
crap
 
1:23 PM
Yes
 
Trailing spaces allowed?
 
@LeakyNun I don't think it should default to anything
 
@BusinessCat sure
 
@Adnan uh, I mean, if it is accessed without being defined
just like a(0)=0
 
How about 1
 
1:24 PM
@Adnan that's the question i'm asking you....
 
@ΛεγίωνΜάμμαλϠΨΠʹ Return to the Game of Life room, we're missing you.
exempt
installing programs on his new machine
 
@DJMcMayhem Pyth, 18 bytes: VQ+X_JX*QdN\\\\\/J
 
@Geobits this lets me draw two cards from my deck
 
@DJMcMayhem how does it work?
 
1:28 PM
Just got an idea on how to rename PPCG from my last challenge
“pregromming pezzlos & coda gulf”
 
@LeakyNun Are there any docs for Oasis yet?
 
@quartata ask me or @Adnan if you have any question
 
@LeakyNun I don't feel like explaining it from my phone, but basically it enters n-1 spaces + `/\`, then recursively extends it down until the left side hits the first column
 
@DJMcMayhem alright
 
I was in fact working on something similar but I've been squarely beaten to the punch >_>
 
1:30 PM
@quartata on which question?
 
@quartata Most people would say it forces you to draw two cards from the deck, but your phrasing is fine, too :P
 
@quartata what do cursed wands do?
 
@Adnan pull request
 
No I mean a language like this
 
So Oasis is basically 05AB1E v3?
 
1:31 PM
0A515
7
 
No. It's for sequences
 
I usually write CMC's I know V can compete at.
 
@Geobits pot of greed allows me to take two cards from my deck and add them to my hand
Ugh weak joke shouldn't have required followup joke
 
@Fatalize No, apart from having a stack, it's nothing like it
@Geobits Hahahaha
 
@Adnan So have you decided on a(1)?
 
1:33 PM
What's the difference?
(besides the built-ins)
 
@DJMcMayhem CJam, how the hell did I make this work: q~,_,f{\_@(@-S*'/+\2*S*+'\+N+}
 
@quartata I prefer Divination for that.
 
@Fatalize Let's use Fibonacci as an example
The program for it is +T, or +10 (since T is shorthand for 10)
The 10 means that a(0)=0 and a(1)=1
to add more basecases just append directly
 
@LeakyNun I'm still struggling on how to implement that
 
@Adnan I wrote a sample program
@Fatalize The + is a stack operator, and since stack is empty, it takes a(n-1) and a(n-2) as argument
 
1:35 PM
@LeakyNun I meant in the source code of oasis.py
 
this language is highly specialized for sequences
@Adnan I wrote a program to detect. You just need to find the arities
@Fatalize In fact there are one-byte built-ins for a(n-1), a(n-2), and a(n-3).
 
@LeakyNun If T pushes 1 and 0, how the hell do you push 10?
 
@Fatalize The basecases can only be single-digit
But the program can have multi-digit numeral literals
 
@LeakyNun That's… way too restrictive?
 
so T+0 would mean a(0)=0 and a(n)=10+a(n-1)
@Fatalize his rationale is that you won't have a sequence with a base case more than 9
 
1:36 PM
what if I want a sequence where a(0) is 42
 
@LeakyNun Do the pyramid challenge in brain-flak? :P
 
@Fatalize rip
 
That's… dumb, sorry
 
@DJMcMayhem SyntaxError: not a chance
@Fatalize cc @Adnan
 
@Fatalize How is that dumb
 
1:37 PM
Hahaha
 
It's better than wasting 100 bytes for multidigit numbers
 
@Adnan You make a language for sequences where almost all sequences are not inputable
 
I can now ably post answers :)
 
@Adnan that said, you can use an extra byte for multi-digit
 
idk how to implement 2d indexing operator for Ru
 
1:38 PM
now sure in most PPCG challenges the base cases are single digits
 
array₂xy or array₂[x;y]
 
@Fatalize almost all sequences have a basecase larger than 9?
 
or any other syntax
 
@LeakyNun Theoretically yes, there are only 10 digits
 
@Fatalize demonstrate it
 
1:39 PM
So, first you say that almost all sequences are not inputable, and a minute after that you say that most PPCG challenges only use 1-digit basecases
 
@Adnan Maybe you could have ß42ß for a basecase of 42
 
I feel like there's something wrong here
 
I just don't like the idea of building a language which is solely fitting to PPCG challenges
 
@Fatalize jelly?
isn't brachylog for golfing?
 
if you make a language for sequences it should be good for sequences
 
1:39 PM
@LeakyNun I was thinking of something like ßz, which converts z from base 214
 
not a subset of sequences
 
@Adnan nice
@Fatalize calm down, this issue is being addressed atm
@Adnan In other news, RIP your own challenge
15
Q: Alternating Sign Sequence

AdnanIntroduction The sign of a number is either a +, or a - for every non-zero integer. Zero itself is signless (+0 is the same as -0). In the following sequence, we are going to alternate between the positive sign, the zero and the negative sign. The sequence starts with 1, so we write 1 with a pos...

 
@Adnan why 214? if you want a big base a good ol b256 is better
 
@TùxCräftîñg CP1252 encoding has only 215 printable characters iirc
 
1:41 PM
:O
 
4
A: Sandbox for Proposed Challenges

zyabin101Peter Piper and the Peck of Pickled Peppers tags: code-golf kolmogorov-complexity Without an introduction, output the following tongue twister: Peter Piper picked a peck of pickled peppers. A peck of pickled peppers Peter Piper picked. If Peter Piper picked a peck of pickled peppers, Where's...

 
it have 215 chars
it's enormous
 
@LeakyNun rip oasis for the 100th time haha
 
Gotta post ^^^^ someday ;(
 
@TùxCräftîñg It's 41 less than the Jelly encoding
 
1:42 PM
@LeakyNun I'm just pointing out that it's pretty arbitrary to have that limitation just because it's true in most PPCG challenges. Sure Jelly is short and good at PPCG challenges but I don't think it has such specific limitations to save 1 byte
 
Hey @Dennis how does TIO supply the interpreter with the code? I'm trying to work out how, in Python, to take multi-line code as input.
 
@Fatalize I see, thanks
 
@βετѧΛєҫαγ python isn't on TIO though
 
._.
i am stupid
 
Hi stupid. I'm Rainbolt.
7
 
1:45 PM
¿ used @last for :func but it need to use self.terminal
 
I missed the MTG chatter :(
 
There wasn't much really.
 
0
A: Alternating Sign Sequence

Leaky NunOasis, 12 bytes (non-competing) n3÷>n3÷y>n-* Try it online! Oasis is a language designed by Adnan which is specialized in sequences. Currently, this language can do recursion and closed form. This answer can only demonstrate closed form. For recursion, see for example this answer. We use t...

@Adnan
 
There's a Grand Prix in November in Dallas, TX. Format is Modern. I'll be there for sure, along with half of my store (like 30 regulars).
 
brb restarting computer
 
1:48 PM
Nice. Good luck with it :)
 
@Adnan Have you implemented it yet?
 
2 mins ago, by TùxCräftîñg
i am stupid
 
You're not getting any stars. I stole them from you. Give it up.
 
@LeakyNun Which feature?
 
@Adnan The only feature request atm
Oops, you opened another one
 
1:48 PM
TIL using features before they are implemented dont work
 
@Rainbolt sigh As much as I want to star it to spite you, I'll restrain myself.
 
It was a calculated gamble. I believed in you and you didn't let me down.
3
 
Yay, somebody believes in me :)
 
0
A: Sandbox for Proposed Challenges

Andreï KostyrkaBefore the Auto-Correct prevailed: Deciphering T9 text You are a spy who needs to obtain some crucial information from the security service M1S. The agents of M1S are well aware that their Wi-Fi signals can be intercepted, their Android/iOS security vulnerabilities exploited etc., so all of them...

 
Hello
 
1:52 PM
@Rainbolt GL. I won't make it because I live in Canada
 
40 mins ago, by TùxCräftîñg
»  echo '“H i”¦… „…a' | ./ru c
Hai
 
Hard to get good GPs up here >_< mostly standard and sealed
 
5
A: Swap bits with their neighbours

Leaky NunOasis, 17 bytes (non-competing) n4÷axxn4÷xxe+3120 Try it online! Oasis is a language designed by Adnan which is specialized in sequences. Currently, this language can do recursion and closed form. We use this formula: a(4n+k) = 4a(n) + a(k), 0 <= k <= 3 To specify the base case is simple: ...

Holy cow how is this getting 5 upvotes
 
@LeakyNun I'm stuggling with the implementation
 
Last time, I installed Windows, Firefox, VLC, IrfanView, SumatraPDF and ClamWin on it, and now the last one runs a hourly scan for viruses of memory and Drive C:.
 
1:54 PM
@Adnan Should I help you?
 
Okay
 
@DJMcMayhem I'm writing a DNA# interpreter in python. Like hoe Fourier's interpreter is written in python
 
Not as live checking as commercial antiviruses do, but regular enough.
 
@LeakyNun Will there be a shorter answer after implementing missing features? Because this seems fairly long for a language aimed at sequences
 
Posting
 
1:54 PM
@Adnan then what is the default of a(1)?
 
4
A: Sandbox for Proposed Challenges

zyabin101Peter Piper and the Peck of Pickled Peppers tags: code-golf kolmogorov-complexity Without an introduction, output the following tongue twister: Peter Piper picked a peck of pickled peppers. A peck of pickled peppers Peter Piper picked. If Peter Piper picked a peck of pickled peppers, Where's...

 
@LeakyNun 1
 
now, any last feedback?
 
@Fatalize yes, after Dennis has pulled, there will be modulo
@Adnan ok a moment
 
@βετѧΛєҫαγ Ooh, duh that makes more sense. I've got two languages on TIO, and they both take input from a file rather than STDIN, if that helps at all
Although I think STDIN is possible too
 
1:56 PM
@DJMcMayhem That helps a lot, yeah that'll work
 
So TIO writes to a file and runs it?
 
Okay, because everyone has no attention on me, I'll post anyway. Thank you.
 
@BusinessCat yeah, it writes the source and input to two different files
(At least, that's the only way I've done it before)
 
@Adnan What should a(n) default to?
(Such scenario can occur)
 
@LeakyNun For simplicity, n
 
1:58 PM
@Adnan I won't mess with them
I won't check if a(n) is undefined
I'll just check a(0) and a(1) using my algorithm
 
@zyabin101 I'm not sure what feedback you want that isn't already given in the sandbox. It's very similar to other challenges already, and might be improved by finding another tongue twister, but other than that it's straightforward.
 
@LeakyNun Okay
 
Asking for feedback after receiving some and doing nothing about it tends to not work well.
 

« first day (2041 days earlier)      last day (2804 days later) »