« first day (2002 days earlier)      last day (2839 days later) » 

4:02 AM
hey guys. do you think it's possible that I could complete this challenge in stackylogic, if I use unary:
13
Q: Divisibility test

Leaky NunTask Given two strictly positive integers n and d as input, determine whether n is evenly divisible by d, i.e., if there exists an integer q such that n = qd. You may write a program or a function and use any of the our standard methods of receiving input and providing output. The output shoul...

except that it would have to have upper bounds I guess
 
@DestructibleWatermelon no, because stackylogic is finite
 
I'll make that TC extension sometime
actually stackylogic cannot handle negative integers soooo
 
@Dennis Using the algorithm actually makes it longer :o
 
You might be on to something then. Two of the primality test answers in Sesos use that divmod algorithm.
 
@Dennis what about Martin's?
his answer is shorter than the other two by a bunch
 
4:07 AM
Martin's uses multiplication, not division.
 
@Dennis how?
 
He takes all products of two positive numbers below the input and compares the results with the input.
 
4
A: Is this number a prime?

Martin EnderSesos, 50 49 bytes Algorithm #3... 0000000: 16def7 f5991b 7441bf 3f0ebb eecfd8 b86b33 b7eb33 ......tA.?......k3..3 0000015: 37ecda bccdd8 b86b33 3ffcfe 8c7de8 797cfc f599c3 7......k3?...}.y|.... 000002a: f973f5 8479c5 03 .s..y.. Try it online! This is the v...

@Dennis oh
O(exp(n)^2)...
 
Almost all operations have a terrible complexity in BF.
 
user214599
Should I make a challenge about calculating the sum of 1 to N, with a twist?
 
4:12 AM
Depends on the twist.
 
@MatthewRoh go ahead
 
user214599
 
Since the sum is n(n+1)/2, that's not very interesting.
 
user214599
oh
 
4:14 AM
Sesos and BF are going to lose
unless @Dennis can you optimize multiplication
 
@LeakyNun ?
 
Multiplication is a bit hard to optimize because it requires additional space. Destructive addition and subtraction would be easy though.
 
BF isn't gonna be that bad
 
BF has to count up to the product.
 
user214599
Ok then what about adding the elements in the array?
 
4:15 AM
@Dennis I mean, detect patterns like [->++<]
 
make 2 copies of n destructively, increment the second, multiply in a loop
then decrement result by 2, increment final result cell
 
@LeakyNun Oh, a+=nb where a and b are cells and n is constant is easy. a*=b is an entirely different animal though.
 
@Dennis alright
 
There are optimizing BF compilers by the way.
 
@Dennis i'm talking about sesos
 
4:20 AM
Yes, but I could get a little inspiration from them, or actually add a Sesos wrapper on top.
 
@Dennis but optimized sesos isn't the same as optimized BF
 
@Dennis feature request: number of steps
 
@MᴀʀsUʟᴛᴏʀ It pretty much is. Ignoring EOF behavior, you can convert all Sesos programs to BF and vice versa.
 
@MatthewRoh Are you writing a challenge?
 
user214599
Yes
 
4:28 AM
@Dennis What about input?
 
user214599
@Leaky I was thinking of what to do of a challenge
 
@downgoat hallo?
 
user214599
@CᴏɴᴏʀO'Bʀɪᴇɴ That goat is gone
 
@CᴏɴᴏʀO'Bʀɪᴇɴ look at user list
he should be back in an hour or so i think
 
4:36 AM
@MatthewRoh nope goat is here
 
user214599
I invited you
 
@CᴏɴᴏʀO'Bʀɪᴇɴ question: can you run npm install -g cheddar-lang? I made some changes for it to work on windows :D
 
user214599
@Cᴏɴ ta-daa. the goat came out of nowhere.
 
@MᴀʀsUʟᴛᴏʀ damnit, wrong by about an hour
 
I made a programming language name generator because I've got nothing
from random import*
while 1:
 x=''
 z=4
 while randint(0,2):
  z+=1
 for i in range(z):
  x+=chr(randint(1,26)+(96,64)[i==0])
 print(x)
 input()
 
4:38 AM
@DestructibleWatermelon does that even generate names
 
0
Q: Quick! Add those numbers now!

Matthew RohThis challenge is easy. You have to add all numbers in an array. but wait there! There is a twist! It's a fastest-code, not code-golf! Specs You can choose between 2 methods of input. Input an array(ex.[1,2,3,4,5]) Input N and N numbers (ex. 5 1 2 3 4 5) Examples [10,20,30,30] or 4 10 20 ...

 
it generates random strings
 
@DestructibleWatermelon 0/10 not names
 
with alphabetic characters only
 
4:39 AM
and the string length is biased to shorter names
 
n=100: 0m0.127s
 
@DestructibleWatermelon 0/10 unpronounceable
 
@Dennis What complexity is my code above?
 
unpronounceable names are more deep d00d
 
@DestructibleWatermelon announcing my new language: kcsncshdbicirgoat
 
4:40 AM
@MatthewRoh Why the builtin restriction?
for addition should be too fast to get reliable results
 
user214599
@MᴀʀsUʟᴛᴏʀ They restrict creativity.
 
^^
 
user214599
uhh
 
Ascedo <- my favourite name from the generator so far
 
Prononced: Ass-see-though? :P
 
4:45 AM
@MatthewRoh An advice when making fastest-code challenges:
don't.
 
@Downgoat s/th/thr/
 
user214599
@LeakyNun xD
 
@Downgoat I got 5ms for square root (I think?), so addition will probably be sub-1ms
 
@MᴀʀsUʟᴛᴏʀ then just do it 1000 times
 
@LeakyNun brb, writing
 
4:48 AM
I think I will submit a stackylogic post to the showcase question
 
@MᴀʀsUʟᴛᴏʀ are you timing on the command line?
 
@DestructibleWatermelon nice
 
time within the program like:
 
@Downgoat yeah
 
@DestructibleWatermelon but the only valid 1-byte snippet will be undefined, lol
 
4:49 AM
Eze <- another kinda good one from the generator
@LeakyNun not all snippets have to be valid code
 
user214599
._. I can't even delete my challenge
 
@MᴀʀsUʟᴛᴏʀ i cannot write literal newnlines but write timing code in the program to avoid including overhead from stdlib loading etc.
 
alright
@MatthewRoh now you can
 
@Downgoat yeah, I'm using Dennis' timing code
@LeakyNun Yeah, I get huge variance still
 
what computational class is stackylogic in? I know it's obviously not TC, but what is it, exactly?
 
4:54 AM
@DestructibleWatermelon each program is essentially a one-output logic gate
 
user214599
thx
 
A question: does printing each character have the same time as printing them all by once?
 
user214599
uhh idk?
 
I'm not an expert, but I would say no, depending on which programming language you use
 
@LeakyNun My guess is O(n²).
@LeakyNun That depends on a lot of factors.
 
4:59 AM
@Dennis but what factor of n^2?
@Dennis usually the latter is faster?
 
@MᴀʀsUʟᴛᴏʀ That's not really important, since we're not trying to optimize I/O.
@LeakyNun Factor?
 
@Dennis I know, but input may affect the style of optimization
 
@Dennis I reckon 1.5n^2
 
@MᴀʀsUʟᴛᴏʀ It shouldn't really. The painful part is in arithmetic operations and copying cells.
 
@LeakyNun it depends where you're writing. if it's to stdout, each character is gonna make the terminal flush again - making it a lot slower
 
user214599
5:02 AM
@Lea can you describe what you want to do?
 
I'm not sure, but I think some loops might be able to be optimized to remove the loop
 
@LeakyNun 1.5n² of what exactly?
 
if it's to a file it depends on the overhead of your language and your OS
 
@Dennis of the input
@Aearnus thanks
 
But 1.5n² what? Seconds? Hamburgers?
 
5:04 AM
@Dennis steps
 
Ah, OK. That should be easy to calculate.
 
@Dennis avocads
@Dennis by implementing the "debug" functionality
 
shudders
 
I'm going to remove the < in my stackylogic variant.
that way 0 can be a quine :)
 
@DestructibleWatermelon just for a quine?
 
5:07 AM
@DestructibleWatermelon then where will it start
 
@MᴀʀsUʟᴛᴏʀ at the bottom or top (doesn't matter)
@LeakyNun No, I plan on using binary, perhaps huffman coded binary, so it will also reduce program size
also, it is pretty cool for stackylogic to win a challenge :p
 
@DestructibleWatermelon Use jelly to reduce program size
 
@DestructibleWatermelon then you would need more information if you remove the <
which would increase your bytecount
you can just huffman encode the < as well
 
but, but the quines dude
 
@EᴀsᴛᴇʀʟʏIʀᴋ @CᴏɴᴏʀO'Bʀɪᴇɴ New Monstercat artist.
 
5:11 AM
iirc quines should ideally be payload capable. right?
 
@DestructibleWatermelon idea: instead of 0 and 1, use all integers (including negative numbers)
(they can be huffman encoded)
 
@vtc oh cool! any good? on mobile rn
 
also i forgot. there are 5 symbols in stackylogic: 1, 0, <, \n, ?
 
@DestructibleWatermelon yes
 
probably if i remove the one, the rest can be stored more efficiently, if i was not extending it
 
5:17 AM
@DestructibleWatermelon not really
 
as in two bits for 4, 3 for 5
 
@DestructibleWatermelon just use hoffman lol
 
I'm not sure anymore, but the fact of being able to win a challenge with stackylogic is too much :p
anyway, I should stop saying stackylogic when I mean my extension
is Ascedo a good or bad name?
 
just call your new language Stackly
use 2 bits for 1 0 ?, 3 bits for \n <
 
but that seems too generic
 
5:23 AM
stackylog
cf. python -> pyth, matlab -> matl
 
@DrGreenEggsandIronMan vim question: how to f over multiple lines?
 
let me alter my random name generator
 
user214599
0
Q: Gear Train, Rotating

Matthew RohGears transfer different amount of energy, depending on the size of the meshed gear. Jack has a machine, that rotates a Gear Train. but you don't know the energy that will be transfered at the end. Luckily, You are a great code golfer, so you can help him! So, What should I do? Given a list, ...

 
user214599
^ my NEW challenge
 
0
Q: Gear Train, Rotating

Matthew RohGears transfer different amount of energy, depending on the size of the meshed gear. Jack has a machine, that rotates a Gear Train. but you don't know the energy that will be transfered at the end. Luckily, You are a great code golfer, so you can help him! So, What should I do? Given a list, ...

 
5:29 AM
@MatthewRoh could you clarify what to do? I've read the whole thing twice and I have no idea what's going on
 
user214599
get a list
 
user214599
where all elements are a gear
 
user214599
where all gears are inputted with 2 numbers
 
user214599
gear example : 1,2 ->
 
@Downgoat same here
 
5:31 AM
mod abuse 11?
 
user214599
 
user214599
(drawn with mspaint, it sucks)
 
Gicstac: is this a good name?
Tesstaco <- comes from the generator (I like this one)
 
@MatthewRoh Shouldn't the first example give 2?
 
user214599
No.
 
5:33 AM
@CᴏɴᴏʀO'Bʀɪᴇɴ don't mean to badger you about this but did the npm work?
 
@downgoat still need me?
 
Mystac <- also from the generator, I like this name as well. This generator is really slow, but sometimes outputs pretty good names
 
@MatthewRoh should the second testcase be 2*2*2 = 8?
 
56 mins ago, by Downgoat
@CᴏɴᴏʀO'Bʀɪᴇɴ question: can you run npm install -g cheddar-lang? I made some changes for it to work on windows :D
 
user214599
@LeakyNun 1*2*2 = 8 (the power of the first one is 1)
 
5:34 AM
@MatthewRoh Can you give us a formula?
 
user214599
example code
 
user214599
C++:
 
lel Im on mobie rn. cant test until tomorrow.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ >_> okay
 
yes, put the code in the question @MatthewRoh
 
5:35 AM
Ostacu, Itstac, Oistac, Ifystac, Ostacuwa. some names from the generator
Austac, Nostac, Huustacar, Ustaca. some more names from the generator
 
@Downgoat testing it
but ewww node
 
cmc: find a mapping from a well ordered set S of natural numbers to N that only preserves the numbers but not the order
 
user214599
^^^^ and ^^^^^
 
@Aearnus :D thanks
 
Pneostac, this one is pretty cool
 
5:38 AM
@Aearnus ;___;
 
why am i considering the name but none of the specs so far -_-
 
:D :D :D :D :D :D :\o/ \o/ \o/ \o/ \o/ \o/
 
@Aearnus but node is the best
 
@Aearnus can you test what cheddar.internal(cheddar.uid).require('fs') says?
 
5:40 AM
@Downgoat wat
 
@MᴀʀsUʟᴛᴏʀ it is JS interfacing
 
@Downgoat :D
 
@Downgoat {"F_OK":0,"R_OK":4,"W_OK":2,"X_OK":1}
but christ is this an entire language written in node?
 
ok, that's good. How about:
cheddar.internal(cheddar.uid).require('fs').readFileSync.c("path/to/some/file/on/your/computer")
@Aearnus still better than python
 
@Aearnus yes
@Aearnus why not?
 
5:42 AM
o boi
@MᴀʀsUʟᴛᴏʀ i mean there are a ton of reasons as to why not
 
@Aearnus for example?
 
one, youll have pretentious people criticize you
 
it's slow and constricts the written language, loosely typed so it's prone to errors, uncompiled so it can't really be run on embedded systems
 
@Aearnus XD sure
 
also i personally don't like it nor the NPM but that's not valid haha
 
5:44 AM
@Aearnus python is loosely typed, and slow
 
and i'm not a fan of python
 
@Aearnus constricts?
@Aearnus Why not on embedded systems?
 
python antivenom is expensive but it's so bad I sold my arms and legs for it
 
yeah, cheddar can't really be faster than node.js is
 
@Downgoat D: no limbs = snake
 
5:45 AM
that's my largest concern for it
 
@Aearnus JS isn't slow though
 
@Aearnus false
cheddar is pretty fast
 
@Downgoat Cheddar doesn't use gyp
 
Q_______________Q NODE GYP Y U US PYTHON ;____; Y U DO DIS
 
5:46 AM
windows uses \ for path separation so let me try escaping the \'s
 
@MᴀʀsUʟᴛᴏʀ yes it does
 
@Downgoat wait, for what?
 
@Downgoat yeah it works once the paths are escaped properly
let me try using forward slashes
 
:D :D :D \o/ \o/ \o/
 
5:47 AM
add another caret :p
 
works with forward slashes too
 
@MᴀʀsUʟᴛᴏʀ some packages cheddar use, use gyp
 
@Aearnus It's not that, it's because escape codes
@Downgoat 0/10 doesn't count
 
@CᴏɴᴏʀO'Bʀɪᴇɴ you would need to reverse the entire set
which is not possible
 
@MᴀʀsUʟᴛᴏʀ what do you mean?
 
5:48 AM
because the set is well-ordered
 
@MᴀʀsUʟᴛᴏʀ ;___;
 
also all modern languages have a FFI (i'm assuming that's what gyp is)
 
why reverse it?
 
@Downgoat need me to test anything else?
 
@Downgoat you can't. Use / or install the easymotion plugin.
 
5:50 AM
@DrGreenEggsandIronMan easymotion???
oh that's also a vim thing nvm
@DrGreenEggsandIronMan /?
 
@Downgoat well I decided to try to break it instead - it crashes on the input () (or any valid combination of parens)
 
wat works for me
 
O HAIAH O
 
@Downgoat Do you not know slash yet?
 
5:52 AM
 
@DrGreenEggsandIronMan no?
 
How could you even use vim without /?
 
@Aearnus try deleting cookies and clearing caches
@DrGreenEggsandIronMan :|
 
can't tell if irony or just node.js antics
lmao
 
@DrGreenEggsandIronMan I used vim for like a year with only knowing a :x :w 0 $ and :q
 
5:53 AM
/ is search with a regex.
 
oh
what's different with s/ then?
ohhhhhhhh
nvm I have used / before
 
Could someone go to Convex's documentation (gamrcorps.github.io/ConvexPy) and check if it is formatted correctly for me please? It should have fancy bootstrap tables if it is.
 
@GamrCorps do you know CSS?
 
:s/foo/bar/ is a substitute, / is just a search.
 
@TùxCräftîñg No
 
5:54 AM
I see ಠ_ಠ
 
@DrGreenEggsandIronMan yeah, I didn't know / was regex search
 
@DrGreenEggsandIronMan i've been using Vim for 6 months and i didn't know that
bless up
 
Oh, Ok. There's also ?
Which is exactly like / but in reverse.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ g'night!
@DrGreenEggsandIronMan wat
 
5:55 AM
@TùxCräftîñg But I do know HTML, and importing the bootstrap scripts usually works.
 
user214599
@LeakyNun thx for adding an explanation to my challenge
 
wat is reverse of find
 
Find previous
 
@MatthewRoh what is your native language?
 
user214599
@LeakyNun Wait Do you mean REAL language not programming
 
5:56 AM
@Downgoat @Aearnus Have you done vimtutor yet? If you haven't, i highly recommend it. It's a ~20~ minute lesson, and it teaches most of the essentials.
 
@DrGreenEggsandIronMan yes i have
 
@MatthewRoh yes
 
user214599
@Lea Korean
 
@MatthewRoh I see
how do you write "Roh" in Korean?
I thought initial "R" do not exist in Korean
 
@DrGreenEggsandIronMan not yet; I came from emacs and I'm only using vim because I haven't bothered to emerge emacs or install atom.io haha
 
5:57 AM
Hahaha
 
@Aearnus aaaahhhhhhhh emacs
 
eh tru
 
Wouldn't that make you a traitor?
 
brb breaking out the terminal
 
:31234649 ಠ___________________________ಠ
vim editor is best editor
 
5:58 AM
what did tux say?
 
@DestructibleWatermelon blasphemy
 
user214599
@LeakyNun "No" when pronounced in korean but "No" is too weird in names so many people use "Roh" instead of "No" in names
 
someone know a link to download gVim on windows?
 
@MatthewRoh Neo or No? What is your name in hanja?
 

« first day (2002 days earlier)      last day (2839 days later) »