Skip to main content
added 690 characters in body
Source Link
Larry Bagel
  • 4.2k
  • 4
  • 9

Halve Code Regen

TODO: This is a horrible title.

Your challenge is to write a program, and when I half the program, the output must stay the same. Then, I will halve it and add the last two characters, and the output should be the same with the program's last two characters at the end.

Sometimes the code can't be halved evenly, and when that happens, I will do something similar to floor division:

blahy => bl
horse => ho
meddle => med (regular halving)
oof => o

Example for "the output should be the same with the program's last two characters at the end"

Let's say we have this code:

q|w_a2e(o+2ei2ere

and the output is

q|w_a2e(o+2ei2ere

when I change it to

q|w_a2e(o+2ei2erere

by adding the last two characters (re), the output should look like

q|w_a2e(o+2ei2erere

(Note the extra re at the)

Rules

  • No padding with comments
  • The program must have at least 2 characters.
  • Standard loopholes apply
  • The output cannot be empty.

Scoring

This is , so the answer with the least bytes wins.

How I came up with the random code in the example two sections ago

q means quine. | is a separator. w_a2e means when the last two characters are added to the end. (o+2e means add the last two characters to the end. i2ere means ignore a repeated 2e at the end.

Meta

  • Is this even possible?
  • If so, any other suggestions?

Halve Code Regen

TODO: This is a horrible title.

Your challenge is to write a program, and when I half the program, the output must stay the same. Then, I will halve it and add the last two characters, and the output should be the same with the program's last two characters at the end.

Sometimes the code can't be halved evenly, and when that happens, I will do something similar to floor division:

blahy => bl
horse => ho
meddle => med (regular halving)
oof => o

Rules

  • No padding with comments
  • The program must have at least 2 characters.
  • Standard loopholes apply
  • The output cannot be empty.

Scoring

This is , so the answer with the least bytes wins.

Meta

  • Is this even possible?
  • If so, any other suggestions?

Halve Code Regen

TODO: This is a horrible title.

Your challenge is to write a program, and when I half the program, the output must stay the same. Then, I will halve it and add the last two characters, and the output should be the same with the program's last two characters at the end.

Sometimes the code can't be halved evenly, and when that happens, I will do something similar to floor division:

blahy => bl
horse => ho
meddle => med (regular halving)
oof => o

Example for "the output should be the same with the program's last two characters at the end"

Let's say we have this code:

q|w_a2e(o+2ei2ere

and the output is

q|w_a2e(o+2ei2ere

when I change it to

q|w_a2e(o+2ei2erere

by adding the last two characters (re), the output should look like

q|w_a2e(o+2ei2erere

(Note the extra re at the)

Rules

  • No padding with comments
  • The program must have at least 2 characters.
  • Standard loopholes apply
  • The output cannot be empty.

Scoring

This is , so the answer with the least bytes wins.

How I came up with the random code in the example two sections ago

q means quine. | is a separator. w_a2e means when the last two characters are added to the end. (o+2e means add the last two characters to the end. i2ere means ignore a repeated 2e at the end.

Meta

  • Is this even possible?
  • If so, any other suggestions?
added 84 characters in body
Source Link
Larry Bagel
  • 4.2k
  • 4
  • 9

Halve Code Regen

TODO: This is a horrible title.

Your challenge is to write a program, and when I half the program, the output must stay the same. WhenThen, I will halve it 3 timesand add the last two characters, and the output should still be the same. When I halve it 4 times, with the output should still beprogram's last two characters at the sameend.

Sometimes the code can't be halved evenly, and when that happens, I will do something similar to floor division:

blahy => bl
horse => ho
meddle => med (regular halving)
oof => o

Rules

  • No padding with comments
  • The program must have at least 162 characters.
  • Standard loopholes apply
  • The output cannot be empty.

Scoring

This is , so the answer with the least bytes wins.

Meta

  • Is this even possible?
  • If so, any other suggestions?

Halve Code Regen

TODO: This is a horrible title.

Your challenge is to write a program, and when I half the program, the output must stay the same. When I halve it 3 times, the output should still be the same. When I halve it 4 times, the output should still be the same.

Sometimes the code can't be halved evenly, and when that happens, I will do something similar to floor division:

blahy => bl
horse => ho
meddle => med (regular halving)
oof => o

Rules

  • No padding with comments
  • The program must have at least 16 characters.
  • Standard loopholes apply

Scoring

This is , so the answer with the least bytes wins.

Halve Code Regen

TODO: This is a horrible title.

Your challenge is to write a program, and when I half the program, the output must stay the same. Then, I will halve it and add the last two characters, and the output should be the same with the program's last two characters at the end.

Sometimes the code can't be halved evenly, and when that happens, I will do something similar to floor division:

blahy => bl
horse => ho
meddle => med (regular halving)
oof => o

Rules

  • No padding with comments
  • The program must have at least 2 characters.
  • Standard loopholes apply
  • The output cannot be empty.

Scoring

This is , so the answer with the least bytes wins.

Meta

  • Is this even possible?
  • If so, any other suggestions?
added 99 characters in body
Source Link
Larry Bagel
  • 4.2k
  • 4
  • 9

Halve Code Regen

TODO: This is a horrible title.

Your challenge is to write a program, and when I half the program, the output must stay the same. When I halve it 3 times, the output should still be the same. When I halve it 4 times, the output should still be the same.

Sometimes the code can't be halved evenly, and when that happens, I will do something similar to floor division:

blahy => bl
horse => ho
meddle => med (regular halving)
oof => o

An example would be this python program:

print("Hello World!")
# blahblahblahblahbla

Rules

Although that's not very creative.

  • No padding with comments
  • The program must have at least 16 characters.
  • Standard loopholes apply

Scoring

This is , so the answer with the least bytes wins.

Halve Code Regen

TODO: This is a horrible title.

Your challenge is to write a program, and when I half the program, the output must stay the same.

Sometimes the code can't be halved evenly, and when that happens, I will do something similar to floor division:

blahy => bl
horse => ho
meddle => med (regular halving)
oof => o

An example would be this python program:

print("Hello World!")
# blahblahblahblahbla

Although that's not very creative.

Scoring

This is , so the answer with the least bytes wins.

Halve Code Regen

TODO: This is a horrible title.

Your challenge is to write a program, and when I half the program, the output must stay the same. When I halve it 3 times, the output should still be the same. When I halve it 4 times, the output should still be the same.

Sometimes the code can't be halved evenly, and when that happens, I will do something similar to floor division:

blahy => bl
horse => ho
meddle => med (regular halving)
oof => o

Rules

  • No padding with comments
  • The program must have at least 16 characters.
  • Standard loopholes apply

Scoring

This is , so the answer with the least bytes wins.

Source Link
Larry Bagel
  • 4.2k
  • 4
  • 9
Loading