The Nineteenth Byte

@HyperNeutrino ey no stalking

Lembik

that is write code that takes an n and gives the smallest set size possible

also i gave up on that :P

user165474

the sudoku solver also has nothing and it's status-completed

Lembik

the point is that naive search will give you something

user165474

2:00 PM

@totallyhuman then don't put your link on SE or you will be stalked :P

it means cool apparently :/

user165474

what should XOR do for strings?

user165474

like what would be a related and useful string operation for xor

multiset symmetric difference?

xor the ascii values?

user165474

2:04 PM

@LeakyNun that would be something else because xor on lists works element-wise so i need another thing

user165474

@KritixiLithos that seems like the most logical thing to do but I'm not sure how useful that would be

if you do choose something, let me know

user165474

okay

I need it for Carrot

user165474

ah lol

user165474

2:08 PM

I decided to go with XOR of ORD

user165474

thanks

for the ^ operator, I need string^float, float^string, float^array, array^string, array^float, array^float, string^regex, float^regex, array^regex, float^float, array^array, ...

user165474

lol

because I want to maximise the operator overloading

user165474

for int ^ array just do element-wise like [int ^ elem1, int ^ elem2, etc]

2:10 PM

and guess what, I will have to do this for all other operators

user165474

lol I'm trying to do the same because preferably all operators should be defined for all types

user165474

wait you have regex as an object?

I have it as a datatype

user165474

I just have regex commands that use strings

user165474

@KritixiLithos oh cool. interesting

2:11 PM

so it can be specified as an argument to the operators

user165474

Oh okay

user165474

I used to have tuple, set, and list, but that got annoying

haha

user165474

@CameronAavik You have apparently not talked on chat for 241 days ಠ_ಠ

correct

been busy lol

2:12 PM

:o

user165474

quite busy I'd say :P

so I came back and just submitted a solution, but I checked up on an old solution I submitted ages ago where someone offered a bounty for the smallest solution that runs in log(n) and I came up with a 1995 character solution that did it. I was the only person to submit a log(n) solution

so who do I chase up for that?

1

A: Partitioning reciprocals

Python 3, 7306 1995 Bytes This solution runs in log(n) complexity (as far as I can tell). def i(s,t): for n in s[::-1]:t=t.replace(*n) return [[]]*78+[list(bytearray.fromhex(a))for a in t.split(",")] def f(n): g,h=lambda c,n:c+[[[2],[3,7,78,91]][n[len(c)]%2]+[i*2for i in c[-1]]],lambda n:[]if n

user165474

What do you mean chase up?

about the bounty

user165474

also wow that's almost as long as my answer here

user165474

2:16 PM

@CameronAavik who offered the bounty?

orlp

in the OP

user165474

You might want to add a comment to the OP then

user165474

orlp appears to be currently or very recently active

but yeah, afaik you can't avoid hardcoding hundreds of values

user165474

ah okay

2:18 PM

and I didn't know anything about compression

user165474

also that really long string looks ugly >.< but I don't know how i'd shorten it lol

will probably give F# golfing a try at some point

been learning it lately and loving it

user165474

Interesting. I've seen it a couple of times but not much.

user165474

Also I have a completely evil line of python code in my interpreter >.<

user165474

return function(num_preprocessor(item) if num_preprocessor else item) if isNumber(item) else requireSingularMonadicNumberOperator(function, string_transformer(item), string_transformer, string_function, num_preprocessor, string = string) if string_transformer else string_function(item)

2:22 PM

I've found it's almost pointless to try and force FP on a non-FP language, especially ones that don't support persistent data structures

user165474

FP?

functional programming

idk, I saw monads in your code

user165474

oh

user165474

lol that's because the function is specifically used for operators that use 1 parameter

user165474

it's for my programming language

2:23 PM

oh, this is an interpreter for your own language

A cheddar answer to my challenge would be great

user165474

yeah

user165474

@LeakyNun which one?

Q: How far away is n to the next power of b?

8

Let n and b be positive integers larger than 1. Output the distance from n to the next power of b. For n=5 and b=3, the next power of 3 from 5 is 9 (3^2 = 9), so the output is 9 - 5 = 4. For n=8 and b=2, the next power of 2 from 8 is 16 (2^4 = 16), so the output is 16 - 8 = 8. Note that n is a...

user165474

hm

user165474

2:25 PM

lol I don't cheddar

user165474

where can I find docs

A: Sandbox for Proposed Challenges

@HyperNeutrino docs.cheddar.vihan.org

user165474

thanks

user165474

@LeakyNun Do you know how to do logarithm in Cheddar?

New Sandboxed Posts

1

Write an Answer Quine code-golf quine Challenge Write an answer which outputs the source of the answer. For example, if I have an answer in Floobit formatted like so: # Floobit, 12 bytes yt38&i)/on:3 The code yt38&i)on:3, when run, must output the source of the answer: # Floobit, 12 ...

2:34 PM

@HyperNeutrino I don't think you can.

user165474

darn

user165474

how do I i/o

@NewSandboxedPosts I have a feeling this is a dupe

@HyperNeutrino you can just use lambda

user165474

but I need to test

user165474

2:37 PM

oh wait "print"

user165474

eh forget it syntax is too confusing for me to learn it right now

@HyperNeutrino just ask me

user165474

okay

user165474

why does this print nil? is that how lambda syntax works?

user165474

(I don't need the braces in this case but I'll need them later)

2:44 PM

ooh, magic semicolon insertion

having the lambda on one line works

user165474

rip i have to go now

relevant: chat.stackexchange.com/transcript/message/38061316#38061316

user165474

maybe i'll try again later

user165474

o/

@LeakyNun On your question: Will b ever be larger than n? If so, add some test cases on that.

I commented earlier

2:50 PM

@LeakyNun Hey, this time I wasn't off for a long time !

Hi everyone !

@Katenkyo welcome back

@Mr.Xcoder done

@LeakyNun thanks

Why 2 5 5? How does that work @LeakyNun ?

How are you doing?

@Mr.Xcoder the next power of 5 from 2 is 5

@Katenkyo I don't really know how to answer to that question lol

2:51 PM

And isn't it that 5-2 = 3 ?

@LeakyNun It should be 2 5 3

@Mr.Xcoder brain fart

@Katenkyo fixed

Thanks @LeakyNun

caird coinheringaahing

I've got my gold badge, I'm off! Toodles!

@cairdcoinheringaahing congratulations!

code-golf string permutations

3:02 PM

When I run this Python code: a,b=int(input()), what should the input format be? Or is it impossible to take it like that?

New Main Posts

1

Q: Solve an Anagram

See also: Granma loves Ana You will be given a string of lowercase ASCII letters. Using this dictionary file, your task is to solve the anagram. To solve an anagram, you must output all words or sets of words that can be formed using each letter from the input string exactly once, separated by n...

@Mr.Xcoder is it python 2 or 3?

Is it possible on either of them @DJMcMayhem ?

^^

Either way, that's invalid because of the int cast.

@Mr.Xcoder It's possible in 2 if you remove the int, and not possible in 3

3:04 PM

If I dropped int(), would it be valid in Python 2 @DJMcMayhem ?

Yes

@DJMcMayhem Thx a loooot

A: Sandbox for Proposed Challenges

If the input looks like 2, 3, it'll evaluate as a tuple

New Sandboxed Posts

0

Am I a Zeisel Number? A Zeisel Number is a square-free integer k with at least three prime factors that fall into the pattern: P(n)=a*P(n-1) + b where a and b are integers and n is the index number of each prime factor in the factorization, sorted from lowest to highest. For the purpose of det...

^ Similar to the Cullen Challenge

3:07 PM

How long d'you think it'll be before I get suspended for voting irregularities? ;)

FYI, if anyone wants to try this out, they can use the less damaging: javascript:($(".vote-up-off").click())(); — Beta Decay 43 secs ago

@BetaDecay No more than one week, if you keep up the pace

I tried it on a question on RaspberryPi.SE and it worked perfectly :)

codegolf.stackexchange.com/a/57414/68615

heh

LegionMammal978

...and I'm once again out of things to do

Just finished playing SPACEPLAN

What's the protocol for accepting answers on a PPCG post?

3:13 PM

@Christian ideally, don't

@Mayube All right

I don't see accepted answers that often but I've seen them a few times

@LegionMammal978 I've just rediscovered the joy of bookmarklets, so you could always try and make an awesome one

@LegionMammal978 play CrossCode

@Christian If your challenge is tagged code-golf and winning criterion is the shortest code in bytes, you can accept the shortest one after things settle down

(Like after 1 month or so)

@Mr.Xcoder it's generally discouraged though

3:15 PM

@Mayube Yes, true.

I always accept an answer after a week

@Mr.Xcoder you think you can delete your comment now?

because code-golf isn't supposed to be about which language can get the fewest bytes, it's supposed to be a separate competition for each language

@LeakyNun Yes, forgot to do so, sorry

I don't see why you shouldn't accept an answer

3:15 PM

@BetaDecay I never accept answer

and I don't care about how people accept answer

@BetaDecay I literally just explained why

so I wouldn't say you shouldn't accept an answer

Wheat Wizard

@BetaDecay Accepting an answer pins it to the top overriding the default sort

I probably just won't, I do see how it gives golfing languages an unfair advantage

I accept answers

3:17 PM

a 50-byte python answer may be just as impressive as an 8-byte jelly one, for example

LegionMammal978

Ima go try and write up a draft of the graph @HelkaHomba described

and it might not be the most interesting answer

Sure, but when it comes down to it, it is still a multilingual competition and the winner should be rewarded

∧ that's the point of code-golf

Q: How far away is n to the next power of b?

Cookies to whomever does my challenge in Brachylog

13

Let n and b be positive integers larger than 1. Output the distance from n to the next power of b. For n=5 and b=3, the next power of 3 from 5 is 9 (3^2 = 9), so the output is 9 - 5 = 4. For n=8 and b=2, the next power of 2 from 8 is 16 (2^4 = 16), so the output is 16 - 8 = 8. Note that n is a...

code-golf arithmetic

3:18 PM

@Christian I mostly have my winning criterion: "The shortest program in each language wins." - So I don't have to accept anything