The Nineteenth Byte

« first day (2242 days earlier) ← previous day next day → last day (2603 days later) »

11:01 PM

so its the nth y-triangle number, n being the amount of possible values (like 2^3, for example), y being the number of numbers

orlp

@DestructibleLemon does this help? en.wikipedia.org/wiki/Multiset#Counting_multisets

Destructible Lemon

but how to efficiently calculate a triangle number? That thing Gauß came up with?

but can you even do that with higher order ones?

you need.... 9 bits apparently

orlp

@DestructibleLemon 0 points, didn't show method :)

Destructible Lemon

gimme a minute!

0 1 2 3 4 5 6 7
8 7 6 5 4 3 2 1

shows what the possible values are for the last number given the second to last number

by triangle numbers, adding up to the end number, the possible values of the second to last number and the last number, given the third last number

0  1  2  3  4  5 6 7
36 28 21 15 10 6 3 1

given the first number, the possibilities for the rest

0   1  2  3  4  5  6 7
120 84 56 35 20 10 4 1

sum those, you get all the possibilities

330 possibilites. 9 bits

orlp

that works, but you're indirectly computing it

Destructible Lemon

11:10 PM

Indirectly?

orlp

if you check the wikipedia link

Destructible Lemon

no that's cheating

orlp

you can use factorials to directly compute the number of ways you can select k items from n options, with being able to choose the same option multiple time

@DestructibleLemon it really isn't, I assumed you were already familiar with this formula, as it's very common in combinatorics

it also isn't the point of the challenge, it merely gets you to the real challenge :)

Destructible Lemon

I don't know combinatorics

ASCII-only

@DestructibleLemon :| what grade are you in

Destructible Lemon

11:11 PM

secret

orlp

let's just say the formula for choosing k elements from n options with repeats can be done in (n + k - 1)!/(k!(n - 1)!) ways

Destructible Lemon

are factorials fast enough though?

orlp

now for our CMC, we have k = 10^6 and n = 2^32

Destructible Lemon

also it seems like if anything that is an indirect method

orlp

now you can start on the real challenge :)

ASCII-only

11:13 PM

@DestructibleLemon Well there isn't anything faster

Plus how fast do you want it to be, with factorials it should be pretty much instant

Destructible Lemon

is it possible to simplify given the fact that we are using round numbers?

ASCII-only

@DestructibleLemon Round numbers?

Destructible Lemon

like 10^6 is round

because it only has two factors

and 2^32 more so

ASCII-only

@DestructibleLemon It has way more than 2 factors

orlp

no, the factorials are way too large to evaluate

but we don't need to

Destructible Lemon

11:15 PM

yes, I meant prime factors

orlp

we want to know how many bits

Conor O'Brien

do you mean prime factors?

ASCII-only

@orlp Link to challenge?

Destructible Lemon

@ConorO'Brien yes

orlp

so we're interested in log2((n + k - 1)!/(k!(n - 1)!))

35 mins ago, by orlp

CMC: how many bits do you at least need to store one million 32-bit integers, if you do not care about their order

Destructible Lemon

11:18 PM

is there some trick here?

orlp

unless you are gifted like ramanujan you most likely won't find the solution by yourself

you should use google :)

Destructible Lemon

is the n to add to k+1 unimportant?

ASCII-only

@DestructibleLemon what

Destructible Lemon

wait nvm I forgot what scale 2^32 was

@orlp A lot

Wait a minute...

oh wait nvm you were actually clear in the original spec and didn't say 2^32 like it could be interpreted 34

ASCII-only

@DestructibleLemon ?

Destructible Lemon

11:29 PM

^, power, or xor sometimes

Also I was thinking of posting "excluding users" to the things to avoid when writing challenges

ASCII-only

@DestructibleLemon Excluding users?

Destructible Lemon

As in that challenge that excluded people with >50k rep

ASCII-only

D: what

also yes definitely that should not exist

Destructible Lemon

actually, thats not entirely accurate

it was in the sandbox and it suggested they couldn't answer for a week

orlp

@DestructibleLemon I don't think that needs to be explicitly mentioned

Destructible Lemon

11:39 PM

It will probably help

also a lot of things shouldn't need to be explicitly mentioned

I mean just look at the standard loopholes page

also people tend to do things and then say, "theres no rule!"

ok, how can I answer this with esolangs.org/wiki/Itflabtijtslwi

Riker

A: Code Johnny Code, Code!

VIM, 54 49 Keystrokes (saved 1 keystroke from Kritixi Lithos) yw~hC<Ctrl-R>", <Ctrl-R>0<Enter>Johnny B. <Ctrl-R>"ode<Esc}O<Ctrl-R>", Johnny <Ctrl-R>0, <Ctrl-R>0<Esc>3. Start with the word on a line on a file with the cursor at the first character, then this will replace it all with ...