The Nineteenth Byte

Calculate Phi (not Pi) code-golf No, I don't mean ϕ = 1.618... and π = 3.14159.... I mean the functions. φ(x) is the number of relatively prime integers less than or equal to x. π(x) is the number of primes less than or equal to x. Let's say that "not pi" is then π̅(x) and define it to be the...

Sp3000

Doesn't seem to be on the site any more though... so... er... tip?

randomra

well, there is no legal first char which would error if it would be the only char in the code so I will end my search too...

Optimizer

I don't want to talk anything legal without my lawyer!

Calvin's Hobbies

8:58 AM

Pristine has become a lot like a cops and robbers, like someone said

TanMath

@Mego I have upvoted your Seriously answer... Show us another Seriously program! ;)

@NewMainPosts this is unexpected.. As a bot, it is ironic to say that!

Optimizer

what is pristine?

El'endia Starman

@TanMath I was actually responding to this, a full-blown math question.

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Enumerating N-Dimensional Grids code-golfsequence (combinatorics?) Given a positive integer k and a non-negative integer i, generate a k-tuple of non-negative integers. For every k, the map from ℕ to ℕk, must be bijective. That is, every input i should produce a different tuple, and every possi...

TanMath

@El'endiaStarman huh?

El'endia Starman

9:07 AM

That's what the bot posted.

Calvin's Hobbies

37

Q: Programming a Pristine World

Let's define a pristine program as a program that does not have any errors itself but will error if you modify it by removing any contiguous substring of N characters, where 1 <= N < program length. For example, the three character Python 2 program `8` is a pristine program (thanks, Sp) becau...

@TanMath Look at history: chat.stackexchange.com/messages/25294504/history

TanMath

@Calvin'sHobbies oh... I see! @AlexA. was the one who edited it!

Martin Büttner

@feersum Are you aware that you've only got one day left to beat this answer or you'll have to make good on your bounty promise? ;)

feersum

@MartinBüttner What?

Martin Büttner

I nominate Sp3000's answer! — mbomb007 Nov 4 at 17:55

feersum

9:15 AM

I wasn't aware of this comment.

Martin Büttner

that's odd

feersum

hmm, my wording does not seem to allow someone to nominate an answer written by a different person

Let's ask @Sp3000 if he thinks it is a decent candidate

Sp3000

I told mbomb it's a really long answer and there's surely lots of ways you could golf it

feersum

Do you want to nominate it? I think if you don't then the nomination doesn't count.

Sp3000

I don't want to nominate it for the bounty (pretty sure it'd be easily beaten), but I wouldn't mind some company since the question's only got one answer atm :P

New Sandboxed Posts

9:23 AM

0

A: Sandbox for Proposed Challenges

How much can this sequence be compressed? code-golf Consider this sequence: 010011000111000011110000011111 Now, you can collapse subsequences that are entirely composed of the same character by adding a number in front. For convenience, let's assume the number and character are always disting...

Calvin's Hobbies

@MartinBüttner Enumerating all tuples with length <= k instead of just = k might be a nice option for your sandbox challenge. Just an idea, but up to you

Sp3000

@NewSandboxedPosts Surely there's some RLE question that'd be a near dupe of?

El'endia Starman

I wondered about that.

New Main Posts

0

Q: Self-debugging code

You write a code and save it as a ASCII text file in an empty folder. I copy an exe program called the "bugger"* into the same folder. I run it. The program executes, and then deletes itself. Now you compile the code that you've written (if that is necessary). Finally you run (or use the interpr...

popularity-contest error-correction

El'endia Starman

I found this, which is why I decided not to use the concept of "entropy" because I was thinking of something else instead.

Martin Büttner

9:26 AM

@Calvin'sHobbies But then the only sensible approach is actually counting through them all.

By requiring only k, I can ask for analytic solutions.

@El'endiaStarman Shouldn't the alternating example give +30?

El'endia Starman

Right, yes.

(It's well past my bedtime...I blame that. :P)

Martin Büttner

Also, I'm generally not a fan of requiring a leading +

apart from that it's 10 bytes in CJam ;)

El'endia Starman

Yeah, I'll take out the leading + part.

Martin Büttner

goo.gl/oLYdrN if you want to generate more test cases

El'endia Starman

haha, awesome

Martin Büttner

9:30 AM

@Calvin'sHobbies Sorry, I misunderstood your suggestion.

Will think about that.

El'endia Starman

@Sp3000: Just did a search for questions with "compress" in them and didn't find any that definitely duplicates. The majority were variants of "given this text, compress it" and scoring is based on how well it's compressed.

Sp3000

Did you look up run length encoding instead?

El'endia Starman

Perhaps my version would do well as a catalog?

Will do that now.

Sp3000

If you were trying to catalogue, straight RLE is more catalogue-suited than having to take the difference. But I'm fairly sure straight RLE has been done

El'endia Starman

13

Q: Run-Length Encoding

Write a program uses run-length encoding to shorten a list of non-negative integers it has to read in. You can assume the non-negative integers can fit in 32bit signed integers. Input Format The length, n, of the list on the first line. On the second line, a space-separated list of integers r...

code-golf compression

I have a feeling that would be considered a duplicate, but I'm not sure.

Sp3000

9:36 AM

5

Q: Shorten text with Run Length Encoding

Shorten (or not) text using run length encoding Input: heeeello woooorld Output: 1h4e2l1o 1w4o1r1l1d Read lines from stdin. Print to stdout. Stderr is of course discarded. Assume there are hidden testcases (no embedding of the output) Input/Output as ASCII Any language is accepted