Given the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o.

#This is the robbers thread. Post solutions that you cracked here.

#The COPS thread is located here .

Robbers should post solutions like this:

#[Language], `n` Bytes, `c` Unique Bytes (Cracked)[Original Link to Cop Thread]
 [Solution]
 
(Explanation)

#Rules

• You may not take any input for your program.
• The program must use at least 1 byte, but cannot exceed 255 bytes.
• The output itself is also limited to 255 bytes.
• The program must have consistent output results when executed multiple times.
• If your submission is not cracked within 7 days, you may mark it as "safe".
  • When marking it safe, post the intended solution and score it as c*n.

#Winning

• The uncracked post with the lowest c*n score, wins the cop's thread.
• Whomever cracks the most wins the robbers thread, with earliest crack breaking the tie.
• This will be decided after 10 safe answers, or a few weeks.

#Caveats

• If you feel cocky, you may tell the user the algorithm using a spoiler tag.

Note: Also, please remember to upvote cracks, they're usually the impressive part.

Given the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o.

This is the robbers thread. Post solutions that you cracked here.

The COPS thread is located here .

Robbers should post solutions like this:

#[Language], `n` Bytes, `c` Unique Bytes (Cracked)[Original Link to Cop Thread]
 [Solution]
 
(Explanation)

Rules

• You may not take any input for your program.
• The program must use at least 1 byte, but cannot exceed 255 bytes.
• The output itself is also limited to 255 bytes.
• The program must have consistent output results when executed multiple times.
• If your submission is not cracked within 7 days, you may mark it as "safe".
  • When marking it safe, post the intended solution and score it as c*n.

Winning

• The uncracked post with the lowest c*n score, wins the cop's thread.
• Whomever cracks the most wins the robbers thread, with earliest crack breaking the tie.
• This will be decided after 10 safe answers, or a few weeks.

Caveats

• If you feel cocky, you may tell the user the algorithm using a spoiler tag.

Note: Also, please remember to upvote cracks, they're usually the impressive part.

Given the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o.

#This is the robbers thread post solutions that you cracked here.

#The COPS thread is located here.

Robbers should post solutions like this:

#[Language], `n` Bytes, `c` Unique Bytes (Cracked)[Original Link to Cop Thread]
 [Solution]
 
(Explanation)

#Rules

• You may not take any input for your program.
• The program must use at least 1 byte, but cannot exceed 255 bytes.
• The output itself is also limited to 255 bytes.
• The program must have consistent output results when executed multiple times.
• If your submission is not cracked within 7 days, you may mark it as "safe".
  • When marking it safe, post the intended solution and score it as c*n.

#Winning

• The uncracked post with the lowest c*n score, wins the cop's thread.
• Whomever cracks the most wins the robbers thread, with earliest crack breaking the tie.
• This will be decided after 10 safe answers, or a few weeks.

#Caveats

• If you feel cocky, you may tell the user the algorithm using a spoiler tag.

Note: Also, please remember to upvote cracks, they're usually the impressive part.

Given the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o.

#This is the robbers thread. Post solutions that you cracked here.

#The COPS thread is located here.

Robbers should post solutions like this:

#[Language], `n` Bytes, `c` Unique Bytes (Cracked)[Original Link to Cop Thread]
 [Solution]
 
(Explanation)

#Rules

• You may not take any input for your program.
• The program must use at least 1 byte, but cannot exceed 255 bytes.
• The output itself is also limited to 255 bytes.
• The program must have consistent output results when executed multiple times.
• If your submission is not cracked within 7 days, you may mark it as "safe".
  • When marking it safe, post the intended solution and score it as c*n.

#Winning

• The uncracked post with the lowest c*n score, wins the cop's thread.
• Whomever cracks the most wins the robbers thread, with earliest crack breaking the tie.
• This will be decided after 10 safe answers, or a few weeks.

#Caveats

• If you feel cocky, you may tell the user the algorithm using a spoiler tag.

Note: Also, please remember to upvote cracks, they're usually the impressive part.

Given the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o.

#This is the robbers thread post solutions that you cracked here.

#The COPS thread is located here.

Robbers should post solutions like this:

#[Language], `n` Bytes, `c` Unique Bytes (Cracked)[Original Link to Cop Thread]
 [Solution]
 
(Explanation)

#Rules

• You may not take any input for your program.
• The program must use at least 1 byte, but cannot exceed 255 bytes.
• The program must have consistent output results when executed multiple times.
• If your submission is not cracked within 7 days, you may mark it as "safe".
  • When marking it safe, post the intended solution and score it as c*n.

#Winning

• The uncracked post with the lowest c*n score, wins the cop's thread.
• Whomever cracks the most wins the robbers thread, with earliest crack breaking the tie.
• This will be decided after 10 safe answers, or a few weeks.

#Caveats

• If you feel cocky, you may tell the user the algorithm using a spoiler tag.

Given the output of the cop's program (o), the byte-count (n) and the number of unique bytes (c) used, come up with a corresponding piece of code that is n bytes long with c unique bytes which matches the cop's output o.

#This is the robbers thread post solutions that you cracked here.

#The COPS thread is located here.

Robbers should post solutions like this:

#[Language], `n` Bytes, `c` Unique Bytes (Cracked)[Original Link to Cop Thread]
 [Solution]
 
(Explanation)

#Rules

• You may not take any input for your program.
• The program must use at least 1 byte, but cannot exceed 255 bytes.
• The output itself is also limited to 255 bytes.
• The program must have consistent output results when executed multiple times.
• If your submission is not cracked within 7 days, you may mark it as "safe".
  • When marking it safe, post the intended solution and score it as c*n.

#Winning

• The uncracked post with the lowest c*n score, wins the cop's thread.
• Whomever cracks the most wins the robbers thread, with earliest crack breaking the tie.
• This will be decided after 10 safe answers, or a few weeks.

#Caveats

• If you feel cocky, you may tell the user the algorithm using a spoiler tag.

Note: Also, please remember to upvote cracks, they're usually the impressive part.