The Nineteenth Byte

ngn

12:02 AM

@Zacharý if it were ltr, you would be able to use -⍨/

@Zacharý apl is unparsable

H.PWiz

1 2 3 a 4 5 6 could be multiple different things

ASCII-only

@Dennis O_o

Zacharý

Operators ...

ASCII-only

I wonder how long Charcoal would take to do that (it would probably time out. plus I don't think there's a way to easily instantiate a Rational yet.)

Destructible Lemon

@ASCII-only reminds me of the brain-flak quine

Zacharý

12:10 AM

Is -⍨` in LTR equivalent to -` in RTL? That doesn't seem right...

ngn

@Zacharý up to a sign

Zacharý

Ah, I see...

ngn

for -/ at least

ASCII-only

Finally, all tests pass again >_> (read: time to prepare for tests for fail for another few days)

ngn

@Zacharý was that a response to my comment that apl is unparsable?

H.PWiz

12:17 AM

The worst part about right-associative scan is that it requires a separate computation for each prefix. Unless the interpreter can figure out that the function is associative

ngn

@H.PWiz yeah, it's O(n^2) for user-defined functions

Esolanging Fruit

What's the most bountied answer on SE?

There's a SciFi.SE answer that's at +3850 from bounties (and that also happens to be the sole post of the user on the site), and I haven't seen anything more than that

Dennis

@ASCII-only C takes 0.035 seconds with GMP.

H.PWiz

@Dennis As a rational?

Dennis

Yes.

Takes slightly longer on TIO, because it counts compilation time. tio.run/##RU7LCoMwEDwnX7FYChG11F61/YXSe0Ek0XQhiY/EU/…

H.PWiz

12:32 AM

Haskell has it at 1 second

Dennis

Nice! Python 3 + gmpy2 gets it in 0.060 seconds. tio.run/…

quartata

Surprising

gmpy2 must be pretty heavy C

Dennis

It's supposed to be a very thin wrapper around GMP and MPFR.

H.PWiz

Looks like GHC uses gmp. The slowness probably comes down to rationals being defined inside of Haskell

Dennis

Heck, import sympy takes 100 times longer that computing the sum with gmpy2.

quartata

12:37 AM

whats your Haskell?

(code)

H.PWiz

tio.run/##y0gszk7Nyfn/PzcxM0/…

quartata

@EsolangingFruit probably the branch prediction fail answer

DJMcMayhem

@EsolangingFruit If you include all 6 of them as one answer, then it's QFT

Dennis

@H.PWiz Try -O3.

H.PWiz

Right, I was only providing the code

quartata

12:39 AM

Huh that's only at 1550

ASCII-only

@Dennis O_o I should probably switch Charcoal to gmpy2

Dennis

What is it using now?

ASCII-only

Python >_>

Οurous

@Zacharý tio.run/##S85JTcz7/z83P6U0J1UhNzEzjysztyC/… - in Clean, ofc Haskell can do it too, so can others.

quartata

Probably the built in fractions module then

ASCII-only

12:42 AM

> x.denomintor

how has this not been fixed yet D:

~~How fast is mpz compared to Python's int?~~ nvm they say in the wiki page

@quartata Charcoal? No, it's using pure Python int arithmetic >_>

quartata

you mean you wrote the rational code yourself?

ASCII-only

Yes. And it's not very fast, nor does it contain anything resembling good code

Zacharý

Rational code is easy to do.

So your rational code isn't RATIONAL?

New Main Posts

1

Q: Crazy but Rational Bases

We have many challenges based on base 10, base 2, base 36, or even base -10, but what about all the other rational bases? Task Given an integer in base 10 and a rational base, return the integer in that base (as an array, string, etc.). Process It's difficult to imagine a rational base, so le...

quartata

@Zacharý not easy to do it fast

ASCII-only

12:48 AM

Does anyone know if gmpy2 (or gmp)'s precision applies to integers, rationals and complex too?

Οurous

@Zacharý Here we go: tio.run/…

quartata

there's a couple extensions for complex numbers

at least in C world

ASCII-only

hang on never mind >_> I can just (somehow) cast to real

HyperNeutrino

complex complex numbers

Οurous

@HyperNeutrino why

HyperNeutrino

12:52 AM

@Οurous because I can >:-D

ngn

@HyperNeutrino complex complex numbers are just complex numbers: (a+ib) + i(c+id) = (a-d) + i(b+c)

HyperNeutrino

@ngn nope. a complex number in C++'s complex library is defined as a pair of numbers with the operations overloaded

complex complex numbers should be complex numbers but they aren't in this implementation/meaning of the term

Οurous

@HyperNeutrino Yeah, instead they're complicated numbers.

HyperNeutrino

lol

totallyhuman

wtf c++

HyperNeutrino

12:58 AM

basically (a, b) + (c, d) := (a + c, b + d)

totallyhuman

so complex numbers are just twoples in c++

HyperNeutrino

(a, b) * (c, d) = (ac - bd, ad + bc)

(a, b) / (c, d) = (a, b) * (c, -d) / (c^2 + d^2)

-(a, b) = (-a, -b)

etc, you get the point

it doesn't matter what a, b, c, d are, just that they support those operations

because C++ doesn't support restricted template arguments (IIRC) so you can put anything in there, it's just that it won't compile if it doesn't support the required methods/fields/operations

Esolanging Fruit

@DJMcMayhem I don't.

@quartata That's at +1550. The answer I mentioned is more than double that.

Zacharý

@HyperNeutrino I have a feeling we've had this conversation before...

HyperNeutrino

@Zacharý I have with you before :D

ASCII-only

1:17 AM

@EsolangingFruit :/ There's no easy way to find total bounty for a question

quartata

@HyperNeutrino you use template traits for that

you're right though in that it's all dependent on SFINAE

Οurous

I'm not sure why a 2D language needs a builtin to read environment variables but now I have one.

feersum

My monitor is borked

It's like everything has a drop shadow to the right.

Does anyone know this problem?

Οurous

@feersum Only if your monitor is a website and it has questionable CSS.

feersum

nvm pushing in the cable fixed it.

ASCII-only

1:50 AM

@EsolangingFruit You're right

Destructible Lemon

someone please help me come up with a name for a programming language

ASCII-only

@ASCII-only Fixed

ASCII-only

2:11 AM

Is there any disadvantage for using gmpy2 for all calculations?

Dennis

It's slower for everything that could be done with native types.

To the processor, not Python. 64-bit ints will be faster than gmpy2.mpz.

Anonymous

gmpy2 will be slower than Python regardless - the extra cost of running a non-native library will make it slower than just using Python's longs

Anonymous

The Python runtime -> gmpy2 -> gmpy transitions alone will be quite costly

ASCII-only

2:32 AM

@Mego Wait, but gmpy2 said it's faster for calculations > 20-50 digits :/

@Dennis But would it be faster than switching between Python and gmpy2 depending on the calculation?

Dennis

It depends on what you're doing. If you're going to sum a huge amount of different integers, the cost of typecasting will be higher than the save in computation time. If you have a small amount of integers you're performing expensive calculations on, gmpy2 will be much faster.

Anonymous

@ASCII-only True... It's reasonable that, for some length, the extra cost of running native gmp code from Python is less than the cost of performing the same calculations with Python's longs

Dennis

tio.run/##dU67CsMgFN39irOp1ME0W6F/…

ASCII-only

@Dennis What if you directly translate from source code (string) to e.g. mpz?

Or do you mean a huge amount of numbers with different GMP types?

Dennis

Things like sum(map(mpz, range(10 ** 8))) must absolutely be avoided.

Even sum(range(10 ** 8), mpz(0)) is way too slow.

ASCII-only

2:47 AM

@Dennis oh, ranges :/

Dennis

But if you don't typecast all the time, the performance difference is less. tio.run/##bY49DsIwDIX3nMJbEtEhhQ3oFXoIpJRGwnEUGaH28sFtUwQSHvzz/…

Actually, that's not quite fair because of the import.

Better. tio.run/…

ASCII-only

Hmm so basically avoid unnecessary instantiation

Destructible Lemon

ok so, what if i wanted to interact with a list, but it's in a nested list, and i want to use an integer to represent how nested it is?

HyperNeutrino

@DestructibleLemon what exactly do you mean by that, example?

Destructible Lemon

so, i'm parsing bf

if i come across a [, i start a new list

ASCII-only

2:55 AM

@DestructibleLemon why can't you just use an integer

Destructible Lemon

if there have been 5 [ so far, and no ], that means that program[-1][-1][-1][-1][-1] is a list that is being edited with the commands inside the loop

obviously that looks ugly as frick

and also not arbitrary

HyperNeutrino

every time you recurse just add call_stack[-1][-1] to the call stack and when you unrecurse then del call_stack[-1]

ASCII-only

@DestructibleLemon well yeah but you're never actually going to type program[-1][-1][-1][-1][-1]

Destructible Lemon

i guess i could use repeated assignment of like, for i in range(thingy): current_program = current_program[-1] but that looks rather inelegant somehow

@ASCII-only exactly, which is why i need to know how to use an integer for this task

ASCII-only

@DestructibleLemon why?

HyperNeutrino

2:58 AM

g = lambda a, r: g(a[-1], r - 1) if r else a

send code please? this is not a good way of doing this

ASCII-only

just use a list of indices as IP

Destructible Lemon

@ASCII-only because i can't type [-1][-1] and i feel like there should be a not hacky way of doing this

HyperNeutrino

send code @destructible I'm pretty sure there's a way better way of doing what you're trying to do

Destructible Lemon

i've written like nothing

tape = [0]
program_string = input("input program")
parsing = True
program = []
while parsing:

which gives a syntax error because i haven't written any of the actual parser

HyperNeutrino

you don't really need to parse BF, you can just interpret it. why do you need to parse it?

Destructible Lemon

3:01 AM

parse it into an easier to interpret state?

HyperNeutrino

ok makes sense I guess

so how should the parse tree for ,+++[>++<-]>. look

ASCII-only

@DestructibleLemon well of course you can't type [-1][-1], you don't know there's a list there

,+++
  >++<-
>.

@HyperNeutrino

HyperNeutrino

ok makes sense

still don't see why that's necessary because it will recursion error way sooner than regular interpretation will, but okay

ASCII-only

otherwise, loops are a huge PITA

@HyperNeutrino no?

HyperNeutrino

yes...?

Destructible Lemon

3:04 AM

wait a second, i wrote a bf interpreter before, i can just look at that one and copy it with minor modifications

ASCII-only

@HyperNeutrino you're just pre-extracting the loops so you won't spend O(length(code)) time looking for the matching bracket?

@DestructibleLemon ...

Destructible Lemon

copy paste

the requirements i have for the new interpreter are a bit different though

HyperNeutrino

@ASCII-only yes but it will still recursion-error earlier, potentially. actually if you implement it correctly it won't so never mind ignore me ಠ_ಠ

also you won't have 1000 nested loops

Destructible Lemon

so it makes sense i need a new one

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Lead or Follow answer-chaining descision-problem restricted-source In this challenge you are to write a program or function, that takes a string as input and outputs one of two possible values. For an answer to be valid it must meet three additional criteria When you pass your program to its...

Destructible Lemon

3:05 AM

yeah i just used the recursive approach to parsing in the old one

rather than the iterative one that i was thinking of using this time...

ASCII-only

@HyperNeutrino I did it this way with UGL

Destructible Lemon

should i include randomness in this dialect?

because it's the dialect i'm using for the compiler challenge

ASCII-only

@HyperNeutrino github.com/schas002/Unipants-Golfing-Language/blob/gh-pages/…

@HyperNeutrino yes >_>

HyperNeutrino

done

o ok

ASCII-only

@HyperNeutrino nice 10/10

HyperNeutrino

3:08 AM

ty

Golfed to 106 bytes:

p=input()
P=[]
s=[P]
for c in p:
	if c<"[":s[-1]+=[c]
	elif c>"[":s=s[:-1]
	else:s[-1]+=[[]];s+=s[-1][-1:]

Destructible Lemon

@HyperNeutrino 6/10 abuses confusing reference equality

HyperNeutrino

@DestructibleLemon lol well I mean it makes perfect sense to me but I guess it is confusing

Destructible Lemon

it took me like 5 minutes or something to figure out what was happening

HyperNeutrino

oh lol

more confusing than I expected, I guess :P

Destructible Lemon

i know how it could be less confusing

wait actually it's not very elegant

alright so... i think i saw some sort of list indexing/slicing notation that included ,

was that a dream or was that real

ASCII-only

3:17 AM

@DestructibleLemon That's used by some third-party Python libraries. Also Pytek.

Pavel

I just saw a guy digging through every single mailbox on my street and I can't help but wonder who the hell tries to steal mail on Sunday.

Downgoat

LLVM is backed by companies with total worths of over a trillion USD. It was developed by apple and yet their website still looks like: llvm.org

Destructible Lemon

@ASCII-only what actually is the syntax?

HyperNeutrino

@Downgoat that is a very beautiful website

Pavel

It's really basic but it's not actually bad

Anonymous

3:18 AM

@DestructibleLemon numpy uses "extended" slicing. It's just regular slicing with __getitem__, but it works with tuple arguments

HyperNeutrino

I mean it probably loads very quickly if routed through TOR because of the simplicity in its design :P

Destructible Lemon

oh ok

Anonymous

@Downgoat Useful > pretty. See: gcc.gnu.org

HyperNeutrino

@destructible tio.run/…

Destructible Lemon

alright, now i'm going to do a good old copy paste of the program i made a while ago and then modify to be arbitrary cell size

HyperNeutrino

3:19 AM

why are we getting flooded with off-topic questions

Destructible Lemon

also should i include randomness in it? i think i won't because it's likely that there are similar bf interpreters, but not ones that will likely have randomness.

New Main Posts

0

Q: Eigenvalue, Eigenvectors and Eigenspaces

Let $A,B \in \mathcal{M}_{n,n}(\mathcal{F})$ be such that $AB = BA$ and let $\lambda$ be an eigenvalue of $A$ with eigenvector $\vec{v}$. Prove the following: For all $m \in \mathbb{N}$ and $a_0, a_1, ..., a_m \in \mathcal{F}, a_m\lambda_m + a_{m-1}\lambda_{m-1} + ... + a_1\lambda + a_0$ is an...

math matrix linear-algebra

0

Q: Any ideas on how to solve this problem?

I am currently trying to solve this problem Some gave me a hint: this problem is equivalent to a certain "matrix multiplication" using min/max and '+' instead of '+' and '*' respectively. Then you need to compute a matrix power. However, after thinking about this problem 2 hours, I still have ...

code-challenge algorithm

Anonymous

@HyperNeutrino Finals in some parts of the world

HyperNeutrino

oh I see

> My final exam is coming up and I am panicking

oh I didn't see that :P

is there a site policy about ongoing external contests?

Destructible Lemon

well, the first modification i have made is that now it reads end of line newlines as 10 instead of 0

Anonymous

3:24 AM

@HyperNeutrino Assuming no copyright infringement issues, there is no firm policy other than "use your best judgment". We don't want to compromise the integrity of external contests, but we also don't want to turn away valid challenges.

HyperNeutrino

hm okay. I see

Downgoat

Also CS exam questions are pretty trivial at least the AP CS one I took

the hardest problem was "convert 1d array into 2d array with row size N"

HyperNeutrino

wow so difficult lambda a, n: [a[i * n:i * n+n] for i in range(len(a) // n] :P

ASCII-only

@HyperNeutrino @DestructibleLemon this took way too long:

https://tio.run/##dZPNjpswEIDP9lOMkCpBiVG2q/YQGY59gt6QFXmD2VhljWXMtlXVZ09nTEiJdksCsme@@bXH/4rn0T1eLj6Mz0G/QA3W@TnmBfc6TKZDQav4FPXpOy0XoeL9GOB01gFpuJoeOLP9IqxryNoMBSwZtuJBVdp747q8VcUqXkU3hl7UmmHrR/3zgwks7AFB4ibzbgyyLTiP2hvKea/gIzzu8eFx9MfBvJoB5d/CbLh1nT2ZacG49bjY89QBXGX9OD7pkC2CI7LmZwI601Ob8gLDPw/IDLBBOAtmmgfyMIYuT5p2o1cF2H5rABIG4xawACoLY7AtUNbwQG7jHBws3lMSk4n5qx5ms8mEyuaMvq31CpNIwIofrX9jYT1G8zdSn6IdHfXkN2fZLjvAoF@eOn1Yat6hsNoIfbAuYs9DvsYsdoDHUGdZYsWGpXxvGAh4KOADfPr8JYHlf8HyHpT3IJWUY/5Xd@mkE9e8z5Vbjv9JnQmzy6/3eAfDOPr6q8ZzoCb1NkxxvS/sx9kOBhYZzgChoF0Ha650IWk4rJtimFMn72eE0ZTYifTanUy@ATGynWKRIEY…

Anonymous

@WheatWizard In addition to what I said in my comment, my script has Stack Overflow hardcoded :P

Wheat Wizard

3:28 AM

Fair enough

Destructible Lemon

@ASCII-only why do you only have limited cells

ASCII-only

@DestructibleLemon because it's easier :P

It isn't hard to change it to infinite though

Destructible Lemon

yeah i seem to have been able to just delete a %256 in my program, so it now complies, except i need to get rid of randomness

ps. mine is more efficient

the one i made a while ago: github.com/Compiler-Chain/Compiler-chain/blob/master/InterBF.py

newlines are read as 0, because i didn't realise that that might be better than considering it end of line

it's called interbf because it has interactive i/o

HyperNeutrino

@ascii tio.run/…

Destructible Lemon

mine stores contiguous runs of the commands <>-+ as a list of effects

like +1 to cell 2 to the left, and -5 cell 7 to the right

hence it is more efficient

take that

ASCII-only

3:34 AM

@HyperNeutrino oh yeah that's much better

Destructible Lemon

i should probably add the ability to deal with EOF

how is EOF communicated on tio?

ASCII-only

@DestructibleLemon well those are basically useless compared to the optimizations bfo makes

Destructible Lemon

what does bfo do?

ASCII-only

optimize loops, collapse runs of commands (into one) (this includes opposite commands, e.g. <> is removed), idk what else

Not sure, but it might recognize simple polynomials or something

Destructible Lemon

@ASCII-only mine does all of those except the first?

actually was that only 2 things listed?

ASCII-only

3:37 AM

@DestructibleLemon what does yours do to >>>><<><<>

Anonymous

@DestructibleLemon The same way as any Linux system - read() returns 0, and getchar() returns -1

ASCII-only

@DestructibleLemon esolangs.org/wiki/BFO

Destructible Lemon

uh, it takes the sum of the movement, and goes there each time

@Mego so how would that work for a python interpreter?

ASCII-only

@DestructibleLemon ...the same way you detect EOF in Python normally?

Destructible Lemon

i haven't done that before

HyperNeutrino

3:39 AM

@DestructibleLemon EOF is met if std.stdin.read(1) returns ""

You can just do input_string = input_source.read() to read the whole thing

Destructible Lemon

i'm using input() though

HyperNeutrino

well that will error if you're at EOF

Anonymous

@DestructibleLemon input() raises EOFError

Destructible Lemon

@Mego ok thx

i forgot

HyperNeutrino

if you want to care about whether or not it's EOF, don't use input()

please send code

Destructible Lemon

3:40 AM

i put it earlier

9 mins ago, by Destructible Lemon

the one i made a while ago: https://github.com/Compiler-Chain/Compiler-chain/blob/master/InterBF.py

Anonymous

input_lines = []
try:
    while True:
        input_lines.append(input())
except EOFError:
    pass

# do stuff here

Anonymous

Alternatively: input_lines = sys.stdin.read().splitlines()

HyperNeutrino

wait splitlines is a function? ಠ_ಠ i always just did .split("\n")

Destructible Lemon

i made it just do input = chr(0) like how bf uses 0 = eof

@HyperNeutrino yeah me too

HyperNeutrino

I mean it's golfier but like I trust splitlines has some advantage (maybe supporting stuff like \r\f)

Destructible Lemon

3:43 AM

yeah but who cares about windows newlines

Anonymous

splitlines() splits on (\r?\n)|\r

Anonymous

i.e. \r, \n, or \r\n

Anonymous

@DestructibleLemon It's also the standard for HTTP according to RFC2616

Destructible Lemon

what

why

nasty

Οurous

@DestructibleLemon People who use windows.

Anonymous

3:45 AM

I dunno, but it's the standard

Destructible Lemon

i though standards had... standards

@ASCII-only bfo actually only optimises for length though

HyperNeutrino

but are you sure having a standard that standards should have standards would follow the standard of standards?

Destructible Lemon

it isn't an optimised interpreter really

Pavel

@Downgoat APL, 12 bytes: {(⍺÷⍨≢⍵)⍺⍴⍵}

Anonymous

Probably for compatibility: by matching \r?\n, you can match both styles of line endings very easily. The standard says use \r\n, but applications should be able to handle \n.

HyperNeutrino

3:47 AM

there should really be a regex operator to do a or b or both

Anonymous

\r\n doesn't affect \n systems at all, but \n makes stuff unreadable on \r\n systems

HyperNeutrino

so you don't have to do a?b|a

Destructible Lemon

that said, mine doesn't optimise double brackets though, but at the same time that's not super necessary

Pavel

@HyperNeutrino or both implies ba is also allowed

ASCII-only

@DestructibleLemon this maybe?

HyperNeutrino

3:48 AM

@Pavel (a or b or ab in that case :P)

Destructible Lemon

@ASCII-only maybe

probably

ok so apparently the speed optimiser doesn't work when there are non-command characters

better fix that

well it did work, but not as well as it could and the fixing was quick

should i use a minimal version or a more complicated version of the language for this challenge?

Destructible Lemon

4:13 AM

wait apparently it did work with non-command characters because it stripped them out earlier

either way, i haven't downgraded it significantly, and i'd say it's clearer now

HyperNeutrino

4:26 AM

i have a weird thing where i'll procrastinate on things because i really don't want to do it because it's boring (and sometimes seemingly pointless) and then randomly out of nowhere i will find it tolerable/enjoyable and then do it and finish it at the exact right moment that I finish it comfortably on-time (without being last-minute)

anyone else get that or am i just weird

ASCII-only

@HyperNeutrino how can you finish exactly on time without it being last minute

HyperNeutrino

as in I finish it the night before but not at like 3am

so i guess not "exactly on time"

Wheat Wizard

I would call that comfortably on time

HyperNeutrino

sure, that makes more sense

Destructible Lemon

6:02 AM

@HyperNeutrino the superpowered Studentman

ASCII-only

@DestructibleLemon student and man usually don't go together

Destructible Lemon

Studentboy?

ASCII-only

6:32 AM

That's quite a bit better, I guess?

Also: improving Charcoal's deverbosifier is harder than I though >_>

Destructible Lemon

I think i finished the quarterstaff parser

ASCII-only

why is it called quarterstaff

Destructible Lemon

uh, because it's simplistic?

and like a quarterstaff it does not have function calls

Οurous

6:56 AM

That's technically true

ngn

7:07 AM

@Pavel k, 10 bytes: {(0N;x)#y}

Adám

7:20 AM

@Downgoat @Pavel @ngn APL (Dyalog Unicode), 10 bytes ⊢⍴⍨⊣,⍨÷⍨∘≢

ngn

7:37 AM

@Adám you can unswap the comma

HyperNeutrino

... I am disappointed in Quora

I have a math thing that I decided to post to Quora instead of Math.SE to see if people there are competent

4 answers are all wrong in the exact same way ಠ_ಠ

oh well going to Math.SE now

Adám

@ngn Yes, of course.

APL (Dyalog Unicode), 9 bytes ⊢⍴⍨÷⍨∘≢,⊣

ngn

7:55 AM

@Adám and here's a weird 9-byter: ⍉|∘⍳∘≢⊢⌸⊢

New Main Posts

8:13 AM

0

Q: Balanced Zero-One Encoding

Task Encode a string that entirely consists of uppercase alphabets (A-Z) using only zeros and ones, using your own favorite scheme. But the rule isn't that simple! Rules Your program/function must correctly handle any valid input string of length 8. The results must have the same length for a...

string code-challenge balanced-string encode

New Main Posts

8:30 AM

0

Q: How to count (add/getCount) items and getMaxItems in O(1) avarage time?

I was given a question to implement a data structure that counts items. So here' the puzzle: The data structure has several methods and all must support O(1) average time complexity. Methods: increment(item) - increment counter for that item. getCount(item) - The overall count for that item (h...

data-structures

Adám

@ngn With emphasis on weird. :-D

New Main Posts

8:47 AM

1

Q: There, I fixed it (with tape)

Challenge: Given a string only containing upper- and/or lowercase letters (whichever you prefer), put tape horizontally to fix it. We do this by checking the difference of two adjacent letters in the alphabet (ignoring wrap-around and only going forward), and filling the space with as much TAPE/...

code-golf string

New Main Posts

9:04 AM

0

Q: How many languages are there?

Write a program that can be run in at least two languages. It should output the running language name, and optionally language version (see below). There may be an arbitrary amount of white spaces (spaces, tabs and newlines) before and after the language name. Case independent but there should n...

code-challenge polyglot

Lembik

9:44 AM

hi all

HyperNeutrino

hello

question: is it even possible to download bluestacks

like the download button brings you to a page with another download button which does absolutely nothing

label a -- goto a

what browser

Lembik

hi @ngn

label a -- goto a

@Lembik late, but hello :p

Lembik

hi @labela--gotoa :)

ASCII-only

10:04 AM

@HyperNeutrino yes?

@HyperNeutrino you're doing something wrong then

ngn

@Lembik hi, i'll reply to your comment in a moment

Destructible Lemon

I believe i have finished implementing my language quarterstaff

wait now i have i think...

actually just going to do misc bugfixes

New Meta Posts

10:27 AM

1

Q: Getting rid of past scores in the answer titles

Usually the format for writing titles is similar to this: C, 3 2 bytes C, 10 8 7 6 4 3 2 bytes This format is not really readable, especially when golfs happened several times in a row. Also, this created the infamous "Crossed out 44 is still regular 44 ;(" meme, which is frowned upon....

discussion answers

Destructible Lemon

what the frick...

Destructible Lemon

10:44 AM

oh the program was working but 65-45 != 10 haha

ASCII-only

Who uninstalled Skynet from NMP

New Main Posts

0

Q: Compress to Impress

Inspired by both the challenge "Unique is Cheap" by @Laikoni, where the score is based on the challenge itself, as well as the JavaScript (ES6) answer of @ETHproductions for the "Palindrome Compression" challenge, where he uses a pretty cool compression method for the palindrome-flag, upper/lower...

string code-challenge binary compression decode

Lembik

@ngn thanks

@ngn if you had the energy/time to explain the algorithm I would be very grateful

user202729

11:03 AM

@Lembik So ngn implemented it in C?

Lembik

@user202729 apparently!

but it's not written in a tutorial style, let's say :)

I can test how fast it is in about 9 hours from now

Esolanging Fruit

I'm trying to figure out grep; why doesn't echo -e "hel42lo\nworld123" | grep '[0-9]+' work?

totallyhuman

11:18 AM

there are so many invalid answers

New Main Posts

0

Q: Woody words, tinny words

Note: There are some rude words in this question. There's an implicit puzzle in posed in this classic Monty Python sketch (you can also ready the script online). Various words are described as being 'woody' or 'tinny', and one is described as being 'PVC'. Here is a list of woody words: Gorn...

code-golf code-challenge regular-expression

user202729

11:34 AM

@totallyhuman That's old, don't bring it up.

Also you can just leave a comment/mod custom flag about invalid etc.

Adám

closed as unclear with 105 answers. Hm.

orlp

12:43 PM

soundcloud.com/orlp/weird-groove

I made a weird groove

no clue how you'd count this

Anonymous

1:01 PM

@Adám The flaws with a challenge are not always immediately obvious

Adám

1:11 PM

@Mego Sounds like some Zen wisdom.

AdmBorkBork

1:22 PM

@Pavel That's because there are three newlines, not too. Durr

Mr. Xcoder

@Downgoat I've encountered that before... Yes, make sure you have no file named main.swift in your project.

(Note that if a library you import uses main.swift, you've got to delete that)

Stewie Griffin

Although I understand your reasoning, I don't like the recommendation about answering challenges before writing them @Adám.

Adám

@StewieGriffin Maybe I should have said, "solving" instead of "answering".

Stewie Griffin

@Adám still don't think it's a good advice to be honest...

Creating and solving challenges require very different skills.

Adám

1:37 PM

@StewieGriffin But trying to solve challenges forces into the mindset of the future reader. Doesn't matter if the potential challenge author is very good at solving problems.

Stewie Griffin

But the user might not even enjoy solving problems.

As I said, I do understand your reasoning, but I don't like discouraging users from creating challenges.

My first post was a challenge by the way. I would not have liked if someone asked me to not post challenges until I've solved some myself.

ASCII-only

Also IIRC Helka doesn't really solve problems?

Adám

@StewieGriffin Oh well, at least it is phrased as a personal recommendation.

Stewie Griffin

@Adám :)

Adám

If you only have a hammer, you tend to see every problem as a dupe.

moonheart08

1:55 PM

passes Adam a chisel

Anonymous

@StewieGriffin While some users may be able to write good challenges right off the bat, most new users we get do not. Answering challenges first is a good way to get experience with the site before trying to write a challenge. However, it's ultimately a recommendation, and not a mandate.

Anonymous

The same goes with the use of the Sandbox

user202729

@Adám I don't have a hammer, but most Stack Overflow problems are indeed a dupe.

moonheart08

2:11 PM

I've been trying to ''optimize'' my use of the jump drive in Stellaris to minimize the days taken for travel, but keep it above 120 days so the debuff wears off. I just realized that could be a awesome puzzle.