The Nineteenth Byte - 2019-07-07

« first day (3081 days earlier) ← previous day next day → last day (1764 days later) »

2:05 AM

0

Q: Sum of multiples of powers of ten of an integer

Write a function to produce, for a non-negative integer, a string containing a sum of terms according to the following: 3 -> "3" 805 -> "800 + 5" 700390 -> "700000" + "300" + "90" 0 -> "0" 13 -> "10 + 3" 200 -> "200" Any input other than a non-negative integer can be ignored. Zero terms m...

code-golf integer

4 hours later…

6:33 AM

0

Q: 2 downvotes + 1 upvote = 1 more reputation

This site gives one more reputation to specific -1-voted questions. (This is the formula that I tried myself: 2 downvotes + 1 upvote = 1 more reputation. Two downvotes is -4 reputation, and 1 upvote is +5 reputation.) Using this formula, people could (slowly) get more reputation despite that thei...

5 hours later…

11:28 AM

0

Q: Binary Encryption, convolutional coding bpsk

i am founding some problem to define the polynomial to encrypt and/or decrypt the following problems. i have 3 samples that should be encrypted by convolutional code. 1) we assume that code 111100101000100001010 is encrypted to 111001111111000110000110000011111000110011111001111000001100111100001...

code-challenge binary

11:45 AM

@NewMainPosts Does VTC with the same reason as someone else auto-upvote their auto-generated comment?

@Adám Yes I think so

user image

2 hours later…

1:48 PM

0

Q: Swapping between two words

Challenge Description: Write a program to ask user for input and print its antonym to the user. But user will have only two options; Good and Bad for input. When he type Good, he will get Bad or vice versa. Notes: 1) You cannot use any other set of two words opposite to each other. 2) Program...

code-golf code-challenge

2:00 PM

@flawr TNB?

2:59 PM

@Adám yep

@flawr An order of magnitude‽ That looks serious. It seems my joining severely damaged the community!

I don't think so, without you ppcg would probably look a lot emptier.

When did you join?

user image

@Adám What the heck happened to your ^ rep???

You can't possibly have gotten so many downvotes???

@flawr bounties

oh I see

@flawr End of Aug. '15. The trend reversed shortly after… Coincidence?

@flawr I have this ongoing bounty without deadline. Feel free to claim some rep!

By the way, the graph is wildly misleading. Giving away all that rep hardly made a dent in mine. The graph makes it look like significantly more than 10%.

@flawr Is it possible to get a list of most prolific TNBrs?

3:16 PM

@Adám how would you define those?

@flawr messages/month

@Adám thanks, I hope I will at some point, but probably not in the near future:)

@Adám in total or just recently?

@flawr Moving average over four weeks

Hm I probably don't know enough sql to do that.

I just used TNBDE with the help of Mr Starman

@flawr Yeah, that's complicated, how about for each of the last few months separately?

3:32 PM

I'm gonna try, but I'm not sure whether I can do it:)

4:03 PM

@Adám This is the best I could do for now, you have to manually change to the month/year you're interested in.

Huh, the "write a function" challenge got edited to say that your function must return.

So x=x was previously a valid entry for Haskell, but now it is not.

what does it mean a function "must return"?

It cannot run forever?

I don't get @SmileAndNod's edit, and I don't even understand why this edit is supposed to be in the sense of the OP

@TannerSwett how was this a valid function?

4:19 PM

code-golf has to be pure code golf now that bonuses are discouraged, right?

I'm pretty sure

> Code length + (sum of the test cases output length)/8.
> -300 if your program consist in a point-free style Haskell function (Prelude only as well).
> The smallest score wins!!

is not

From this question

yes, that should be changed to code-challenge

@flawr Well, it takes a parameter and then performs a computation. I think that makes it a function.

what, this really works!

but when you call x it will not terminate, right?

I think if you ask GHCi for the type of x there, it will say that the type is forall t1. t1.

And that's right, it won't terminate.

I expected this to throw an error, TIL:)

4:23 PM

t1 is a type parameter there. Type parameters in Haskell are always passed implicitly, so some people might say they're not "really" parameters at all.

Sriotchilism O'Zaic

iirc This is how undefined is defined

undefined also just has one typevariable t as signature, but behaves differently:)

Sriotchilism O'Zaic

How does it behave differently?

undefined indicates an error when it's called, instead of running forever.

if you call x the program gets stuck executing it, while calling undefined just throws an error

Sriotchilism O'Zaic

4:25 PM

Oh yes they are slightly different

I guess I was thinking of bottom

bottom?

In Haskell, "bottom" is any thunk which cannot be evaluated to a value.

In other words, thunks which run forever or indicate an error instead of successfully evaluating.

Sriotchilism O'Zaic

It's the difference between Hask and Set

Oh I see

Sriotchilism O'Zaic

x=x is a bottom. But undefined is not(?)

4:33 PM

undefined is also a bottom thunk.

Sriotchilism O'Zaic

Ah ok they are just different

4:49 PM

0

Q: Make a slow monotonic injection

In 256 bytes or fewer write a function from the positive integers to the positive integers that is: Monotonic: larger inputs always map to larger outputs. (\$a < b \implies f(a) < f(b)\$) Injective: different inputs always map to different outputs. (\$a \neq b \implies f(a)\neq f(b)\$) Non-line...

math code-challenge

Sriotchilism O'Zaic

5:47 PM

@Mr.Xcoder Also if we are being super nitpicky functions with order notation better than linear (e.g. \$O(1)\$) are also \$O(n)\$, so not linear does imply supra-linear. But that is quite nitpicky and I understand that \$O(n)\$ tends to mean \$O(n)\$ and not better than \$O(n)\$.

Specifically, O(f) is often used when ϴ(f) is intended

6:03 PM

@SriotchilismO'Zaic Indeed, I see your point.

I don't see the point of this challenge (isn't it just floor(n^(1+1/(big number))))?

6:28 PM

I think this can very easily be solved theoretically but in practice I don't really have a clue how one should avoid/handle native number types inaccuracies in a clever manner... Otherwise, a function like $f(n)=\lfloor n^{1+\epsilon}\rfloor$, where $\epsilon$ is very close to zero (as lirtosiast pointed out) would be an immediate winner...

-1

Q: Solving Problem 5 (Choose your own path) from the Canadian Computing Contest

In question J5 from the CCC, it asks to make a program to decide the shortest way to read the "Choose your adventure". The program must also decide if all the pages of the Choose your adventure book are read. The complete problem can be found at. https://cemc.uwaterloo.ca/contests/computing/2018/...

2 hours later…

8:09 PM

0

Q: Total time to deteriorate all shielded cells

Problem: sum of time to zero all cells if on each turn cells decrease by 1 if a neighbor (top/bottom/left/right) is zero. Is there a faster solution than to use a priority queue? Is there a name for this problem or a similar problem? I don’t know what to search for. Example, answer is 7. 0000...

fastest-algorithm

8:49 PM

@flawr Woah, that's a thing?

Sriotchilism O'Zaic

9:01 PM

@Mego (since you were the most recently here) or any other mods the sandbox has been unfeatured.

9:20 PM

@MilkyWay90 yes apparently:) unfortunately I cannot ping the author here

if you search for "tnbde" in the chat search you'll find a bunch of interesting stats

Anonymous

9:34 PM

@SriotchilismO'Zaic Say no more

@flawr Okay, that I will do

Aww, I keep getting Error: Invalid permalink

Sriotchilism O'Zaic

I wonder what the most editted post on SE is and I wonder how long until it is the sandbox

9:58 PM

@SriotchilismO'Zaic It has long been the sandbox, and the previous sandboxes that were archived for growing too large.

Sriotchilism O'Zaic

I knew that the sandbox was the most answered question is there a source for the most editted claim?

@SriotchilismO'Zaic It is the sandbox but not the one you were thinking of

At least it's probably that

« first day (3081 days earlier) ← previous day next day → last day (1764 days later) »

Transcript for

Jul '197

The Nineteenth Byte

The Nineteenth Byte: General discussion for codegolf.stackexc...

join this room
about this room

00:00

06:00

12:00

18:00

all times are UTC

site design / logo © 2024 Stack Exchange Inc; legal

mobile