Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.
3 edited body
source | link

The Task

In this challenge, your task is to write some code which outputs one of it's anagramits anagrams chosen randomly with uniform distribution but it should never output itself.


Elaboration

Given no input, your program should output any one of the anagrams of it'sits source code. But, yourYour program should never output it'sits own source as it is, i.e. it should never be a quine.


Input

Your program must not take any input. However, if your language requires input as a necessity, you may assume that it will be given lowercase "A"a. You must not use the input in any way, though.


Output

Your program can output in any way except writing it to a variable. Writing to file, console, screen, etc. is allowed. Function return is allowed as well.


Additional Rules

  • Your program's source code must have at least 3 chars (not 3 bytes).

  • Your program's source code must have at least 3 possible anagrams (excluding itself). For example, aab does not count as a valid submission as aab only has two anagrams other than aab (baa and aba).

  • Your program must not produce any error.

  • Your program should output its anagrams exactly.

  • Standard Loopholes and Standard quine rules apply.


Example

Suppose your program's source code is abc. It should randomly output any one of the following (with uniform distribution):

  1. acb
  2. bca
  3. bac
  4. cba
  5. cab

And, it should never output abc.


Winning Criterion

This is , so the shortest code in bytes wins! In case of a tie, the solution which was posted earlier wins!

The Task

In this challenge, your task is to write some code which outputs one of it's anagram chosen randomly with uniform distribution but it should never output itself.


Elaboration

Given no input, your program should output any one of the anagrams of it's source code. But, your program should never output it's own source as it is, i.e. it should never be a quine.


Input

Your program must not take any input. However, if your language requires input as a necessity, you may assume that it will be given lowercase "A". You must not use the input in any way, though.


Output

Your program can output in any way except writing it to a variable. Writing to file, console, screen etc. is allowed. Function return is allowed as well.


Additional Rules

  • Your program's source code must have at least 3 chars (not 3 bytes).

  • Your program's source code must have at least 3 possible anagrams (excluding itself). For example, aab does not count as a valid submission as aab only has two anagrams other than aab (baa and aba).

  • Your program must not produce any error.

  • Your program should output its anagrams exactly.

  • Standard Loopholes and Standard quine rules apply.


Example

Suppose your program's source code is abc. It should randomly output any one of the following (with uniform distribution):

  1. acb
  2. bca
  3. bac
  4. cba
  5. cab

And, it should never output abc.


Winning Criterion

This is , so the shortest code in bytes wins! In case of a tie, the solution which was posted earlier wins!

The Task

In this challenge, your task is to write some code which outputs one of its anagrams chosen randomly with uniform distribution but it should never output itself.


Elaboration

Given no input, your program should output any one of the anagrams of its source code. Your program should never output its own source as it is, i.e. it should never be a quine.


Input

Your program must not take any input. However, if your language requires input as a necessity, you may assume that it will be given lowercase a. You must not use the input in any way, though.


Output

Your program can output in any way except writing it to a variable. Writing to file, console, screen, etc. is allowed. Function return is allowed as well.


Additional Rules

  • Your program's source code must have at least 3 chars (not 3 bytes).

  • Your program's source code must have at least 3 possible anagrams (excluding itself). For example, aab does not count as a valid submission as aab only has two anagrams other than aab (baa and aba).

  • Your program must not produce any error.

  • Your program should output its anagrams exactly.

  • Standard Loopholes and Standard quine rules apply.


Example

Suppose your program's source code is abc. It should randomly output any one of the following (with uniform distribution):

  1. acb
  2. bca
  3. bac
  4. cba
  5. cab

And, it should never output abc.


Winning Criterion

This is , so the shortest code in bytes wins! In case of a tie, the solution which was posted earlier wins!

    Tweeted twitter.com/StackCodeGolf/status/866993405225832451
2 added 53 characters in body
source | link

The Task

In this challenge, your task is to write some code which outputs one of it's anagram chosen randomly with uniform distribution but it should never output itself.


Elaboration

Given no input, your program should output any one of the anagrams of it's source code. But, your program should never output it's own source as it is, i.e. it should never be a quine.


Input

Your program must not take any input. However, if your language requires input as a necessity, you may assume that it will be given lowercase "A". You must not use the input in any way, though.


Output

Your program can output in any way except writing it to a variable. Writing to file, console, screen etc. is allowed. Function return is allowed as well.


Additional Rules

  • Your program's source code must have at least 3 chars (not 3 bytes).

  • Your program's source code must have at least 3 possible anagrams (excluding itself). For example, aab does not count as a valid submission as aab only has two anagrams other than aab (baa and aba).

  • Your program must not produce any error.

  • Your program should output its anagrams exactly.

  • Standard Loopholes and Standard quine rules apply.


Example

Suppose your program's source code is abc. It should randomly output any one of the following (with uniform distribution):

  1. acb
  2. bca
  3. bac
  4. cba
  5. cab

And, it should never output abc.


Winning Criterion

This is , so the shortest code in bytes wins! In case of a tie, the solution which was posted earlier wins!

The Task

In this challenge, your task is to write some code which outputs one of it's anagram chosen randomly but it should never output itself.


Elaboration

Given no input, your program should output any one of the anagrams of it's source code. But, your program should never output it's own source as it is, i.e. it should never be a quine.


Input

Your program must not take any input. However, if your language requires input as a necessity, you may assume that it will be given lowercase "A". You must not use the input in any way, though.


Output

Your program can output in any way except writing it to a variable. Writing to file, console, screen etc. is allowed. Function return is allowed as well.


Additional Rules

  • Your program's source code must have at least 3 chars (not 3 bytes).

  • Your program's source code must have at least 3 possible anagrams (excluding itself). For example, aab does not count as a valid submission as aab only has two anagrams other than aab (baa and aba).

  • Your program must not produce any error.

  • Your program should output its anagrams exactly.

  • Standard Loopholes and Standard quine rules apply.


Example

Suppose your program's source code is abc. It should randomly output any one of the following :

  1. acb
  2. bca
  3. bac
  4. cba
  5. cab

And, it should never output abc.


Winning Criterion

This is , so the shortest code in bytes wins! In case of a tie, the solution which was posted earlier wins!

The Task

In this challenge, your task is to write some code which outputs one of it's anagram chosen randomly with uniform distribution but it should never output itself.


Elaboration

Given no input, your program should output any one of the anagrams of it's source code. But, your program should never output it's own source as it is, i.e. it should never be a quine.


Input

Your program must not take any input. However, if your language requires input as a necessity, you may assume that it will be given lowercase "A". You must not use the input in any way, though.


Output

Your program can output in any way except writing it to a variable. Writing to file, console, screen etc. is allowed. Function return is allowed as well.


Additional Rules

  • Your program's source code must have at least 3 chars (not 3 bytes).

  • Your program's source code must have at least 3 possible anagrams (excluding itself). For example, aab does not count as a valid submission as aab only has two anagrams other than aab (baa and aba).

  • Your program must not produce any error.

  • Your program should output its anagrams exactly.

  • Standard Loopholes and Standard quine rules apply.


Example

Suppose your program's source code is abc. It should randomly output any one of the following (with uniform distribution):

  1. acb
  2. bca
  3. bac
  4. cba
  5. cab

And, it should never output abc.


Winning Criterion

This is , so the shortest code in bytes wins! In case of a tie, the solution which was posted earlier wins!

1
source | link

Golf you an anagram for great good!

The Task

In this challenge, your task is to write some code which outputs one of it's anagram chosen randomly but it should never output itself.


Elaboration

Given no input, your program should output any one of the anagrams of it's source code. But, your program should never output it's own source as it is, i.e. it should never be a quine.


Input

Your program must not take any input. However, if your language requires input as a necessity, you may assume that it will be given lowercase "A". You must not use the input in any way, though.


Output

Your program can output in any way except writing it to a variable. Writing to file, console, screen etc. is allowed. Function return is allowed as well.


Additional Rules

  • Your program's source code must have at least 3 chars (not 3 bytes).

  • Your program's source code must have at least 3 possible anagrams (excluding itself). For example, aab does not count as a valid submission as aab only has two anagrams other than aab (baa and aba).

  • Your program must not produce any error.

  • Your program should output its anagrams exactly.

  • Standard Loopholes and Standard quine rules apply.


Example

Suppose your program's source code is abc. It should randomly output any one of the following :

  1. acb
  2. bca
  3. bac
  4. cba
  5. cab

And, it should never output abc.


Winning Criterion

This is , so the shortest code in bytes wins! In case of a tie, the solution which was posted earlier wins!