Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Challenges

I irradiate your source code, you irradiate your output

+1
−0

Your task is to write a program $p$ which outputs a string $s$ with the same length as $p$, where $s \neq p$.

If I remove the $n$th byte from your program to get program $q$, then either $q$ outputs $s$ with the $n$th byte removed, or it does something else.

Your score is the number of ways a single byte being removed from $p$ results in a program that does "something else", or is a quine. With a lower score being the goal. Ties will be broken by code golf.

History
Why does this post require attention from curators or moderators?
You might want to add some details to your flag.
Why should this post be closed?

2 comment threads

Can you give a ungolfed example? (One that is easy to understand). And explain the score of the examp... (1 comment)
Clarification of "number of times" (1 comment)

0 answers

Sign up to answer this question »