question stringlengths 53 2.32k | answer stringlengths 1 5.65k | metadata stringlengths 73 5.85k | dataset_source stringclasses 34
values |
|---|---|---|---|
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | A# B# B# A# A# A# | {"source_dataset": "ab", "source_index": 0, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #A #B #B #B A# A# | {"source_dataset": "ab", "source_index": 1, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #B B# A# B# A# A# | {"source_dataset": "ab", "source_index": 2, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #A #B #B #A #A #B A# A# | {"source_dataset": "ab", "source_index": 3, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #B A# A# B# B# A# A# A# | {"source_dataset": "ab", "source_index": 4, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #A #B #B #A #B #B #B A# | {"source_dataset": "ab", "source_index": 5, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #A #A B# B# A# B# | {"source_dataset": "ab", "source_index": 6, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #B A# | {"source_dataset": "ab", "source_index": 7, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #B #A #A #A B# A# | {"source_dataset": "ab", "source_index": 8, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #A #A #A B# | {"source_dataset": "ab", "source_index": 9, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #A #B #B A# B# B# | {"source_dataset": "ab", "source_index": 10, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #B #A #B A# B# B# | {"source_dataset": "ab", "source_index": 11, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #A #B #B #B #A #B | {"source_dataset": "ab", "source_index": 12, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | B# B# | {"source_dataset": "ab", "source_index": 13, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #B #B #A B# | {"source_dataset": "ab", "source_index": 14, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #A #B #B A# | {"source_dataset": "ab", "source_index": 15, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #A #A B# B# | {"source_dataset": "ab", "source_index": 16, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #B A# A# A# | {"source_dataset": "ab", "source_index": 17, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #A #A #A #A A# A# | {"source_dataset": "ab", "source_index": 18, "difficulty": {"length": 10}} | ab |
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #B #A #A #A #A B# | {"source_dataset": "ab", "source_index": 19, "difficulty": {"length": 10}} | ab |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-3 number 220020 to binary
| 1010001110 | {"source_dataset": "base_conversion", "source_index": 0, "decimal_value": 654, "source_base": 3, "target_base": 2, "source_repr": "220020", "target_repr": "1010001110", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-6 number 103 to base-13
| 30 | {"source_dataset": "base_conversion", "source_index": 1, "decimal_value": 39, "source_base": 6, "target_base": 13, "source_repr": "103", "target_repr": "30", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-10 number 418 to base-13
| 262 | {"source_dataset": "base_conversion", "source_index": 2, "decimal_value": 418, "source_base": 10, "target_base": 13, "source_repr": "418", "target_repr": "262", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-8 number 426 to base-9
| 338 | {"source_dataset": "base_conversion", "source_index": 3, "decimal_value": 278, "source_base": 8, "target_base": 9, "source_repr": "426", "target_repr": "338", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-3 number 1020200 to base-8
| 1615 | {"source_dataset": "base_conversion", "source_index": 4, "decimal_value": 909, "source_base": 3, "target_base": 8, "source_repr": "1020200", "target_repr": "1615", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-3 number 111100 to base-8
| 550 | {"source_dataset": "base_conversion", "source_index": 5, "decimal_value": 360, "source_base": 3, "target_base": 8, "source_repr": "111100", "target_repr": "550", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-7 number 1431 to base-4
| 20301 | {"source_dataset": "base_conversion", "source_index": 6, "decimal_value": 561, "source_base": 7, "target_base": 4, "source_repr": "1431", "target_repr": "20301", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-7 number 125 to base-8
| 104 | {"source_dataset": "base_conversion", "source_index": 7, "decimal_value": 68, "source_base": 7, "target_base": 8, "source_repr": "125", "target_repr": "104", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-15 number 23e to base-6
| 2205 | {"source_dataset": "base_conversion", "source_index": 8, "decimal_value": 509, "source_base": 15, "target_base": 6, "source_repr": "23e", "target_repr": "2205", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-15 number 119 to base-10
| 249 | {"source_dataset": "base_conversion", "source_index": 9, "decimal_value": 249, "source_base": 15, "target_base": 10, "source_repr": "119", "target_repr": "249", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the binary number 100010010 to hexadecimal
| 112 | {"source_dataset": "base_conversion", "source_index": 10, "decimal_value": 274, "source_base": 2, "target_base": 16, "source_repr": "100010010", "target_repr": "112", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-15 number 2c1 to hexadecimal
| 277 | {"source_dataset": "base_conversion", "source_index": 11, "decimal_value": 631, "source_base": 15, "target_base": 16, "source_repr": "2c1", "target_repr": "277", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-4 number 32213 to base-9
| 1248 | {"source_dataset": "base_conversion", "source_index": 12, "decimal_value": 935, "source_base": 4, "target_base": 9, "source_repr": "32213", "target_repr": "1248", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-5 number 332 to base-4
| 1130 | {"source_dataset": "base_conversion", "source_index": 13, "decimal_value": 92, "source_base": 5, "target_base": 4, "source_repr": "332", "target_repr": "1130", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-15 number 45e to base-10
| 989 | {"source_dataset": "base_conversion", "source_index": 14, "decimal_value": 989, "source_base": 15, "target_base": 10, "source_repr": "45e", "target_repr": "989", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-7 number 61 to base-11
| 3a | {"source_dataset": "base_conversion", "source_index": 15, "decimal_value": 43, "source_base": 7, "target_base": 11, "source_repr": "61", "target_repr": "3a", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-5 number 4334 to base-13
| 369 | {"source_dataset": "base_conversion", "source_index": 16, "decimal_value": 594, "source_base": 5, "target_base": 13, "source_repr": "4334", "target_repr": "369", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-3 number 22111 to hexadecimal
| e5 | {"source_dataset": "base_conversion", "source_index": 17, "decimal_value": 229, "source_base": 3, "target_base": 16, "source_repr": "22111", "target_repr": "e5", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-6 number 1243 to base-11
| 267 | {"source_dataset": "base_conversion", "source_index": 18, "decimal_value": 315, "source_base": 6, "target_base": 11, "source_repr": "1243", "target_repr": "267", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-4 number 13322 to base-10
| 506 | {"source_dataset": "base_conversion", "source_index": 19, "decimal_value": 506, "source_base": 4, "target_base": 10, "source_repr": "13322", "target_repr": "506", "difficulty": {"base": [2, 16], "value": [0, 1000]}} | base_conversion |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 5 | {"source_dataset": "binary_alternation", "source_index": 0, "string": "011001010101010011101001010110", "solution": 5, "solvable": true, "n": 30, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 3 | {"source_dataset": "binary_alternation", "source_index": 1, "string": "00110110100", "solution": 3, "solvable": true, "n": 11, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 5 | {"source_dataset": "binary_alternation", "source_index": 2, "string": "00000001111110000111011", "solution": 5, "solvable": true, "n": 23, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 3 | {"source_dataset": "binary_alternation", "source_index": 3, "string": "101000001001111011", "solution": 3, "solvable": true, "n": 18, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 2 | {"source_dataset": "binary_alternation", "source_index": 4, "string": "010110110100", "solution": 2, "solvable": true, "n": 12, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 6 | {"source_dataset": "binary_alternation", "source_index": 5, "string": "100111101001011000100", "solution": 6, "solvable": true, "n": 21, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 6 | {"source_dataset": "binary_alternation", "source_index": 6, "string": "100101010010011010111001010", "solution": 6, "solvable": true, "n": 27, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 2 | {"source_dataset": "binary_alternation", "source_index": 7, "string": "101010010011", "solution": 2, "solvable": true, "n": 12, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | -1 | {"source_dataset": "binary_alternation", "source_index": 8, "string": "01010011111011110000011001", "solution": -1, "solvable": false, "n": 25, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | -1 | {"source_dataset": "binary_alternation", "source_index": 9, "string": "101110110000100001", "solution": -1, "solvable": false, "n": 17, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 4 | {"source_dataset": "binary_alternation", "source_index": 10, "string": "011100111000111000", "solution": 4, "solvable": true, "n": 18, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | -1 | {"source_dataset": "binary_alternation", "source_index": 11, "string": "110101001011001011011110100100", "solution": -1, "solvable": false, "n": 29, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 2 | {"source_dataset": "binary_alternation", "source_index": 12, "string": "01110001011001", "solution": 2, "solvable": true, "n": 14, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | -1 | {"source_dataset": "binary_alternation", "source_index": 13, "string": "10001111001110", "solution": -1, "solvable": false, "n": 12, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 5 | {"source_dataset": "binary_alternation", "source_index": 14, "string": "010101000000011111111100001", "solution": 5, "solvable": true, "n": 27, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 3 | {"source_dataset": "binary_alternation", "source_index": 15, "string": "11010010001", "solution": 3, "solvable": true, "n": 11, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 6 | {"source_dataset": "binary_alternation", "source_index": 16, "string": "0101010011110000101111001100", "solution": 6, "solvable": true, "n": 28, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 4 | {"source_dataset": "binary_alternation", "source_index": 17, "string": "11000111000010110", "solution": 4, "solvable": true, "n": 17, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 6 | {"source_dataset": "binary_alternation", "source_index": 18, "string": "1111000111010100001", "solution": 6, "solvable": true, "n": 19, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 6 | {"source_dataset": "binary_alternation", "source_index": 19, "string": "1100101011000010110101011", "solution": 6, "solvable": true, "n": 25, "difficulty": {"n": [10, 30]}} | binary_alternation |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 0 1
0 0 0 0
... | 1 1 0 1
0 0 0 0
1 1 1 0
1 0 1 0 | {"source_dataset": "binary_matrix", "source_index": 0, "matrix": [[1, 1, 0, 1], [0, 0, 0, 0], [1, 1, 1, 0], [1, 0, 1, 0]], "solution": [[1, 1, 0, 1], [0, 0, 0, 0], [1, 1, 1, 0], [1, 0, 1, 0]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}} | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 0 1
1 1 1
1 0 ... | 1 0 1
2 1 2
1 0 1 | {"source_dataset": "binary_matrix", "source_index": 1, "matrix": [[1, 0, 1], [1, 1, 1], [1, 0, 1]], "solution": [[1, 0, 1], [2, 1, 2], [1, 0, 1]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}} | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
0 1 1 1 1 1 1 0 ... | 0 1 1 2 1 2 1 0 1
1 1 0 1 0 1 0 1 1
1 0 1 1 0 1 0 1 0
2 1 2 2 1 2 1 0 1
2 2 2 1 0 1 1 0 1
1 2 3 2 1 1 2 1 1
0 1 2 2 1 0 1 1 0
1 1 2 3 2 1 2 2 1
0 0 1 2 3 2 3 3 2 | {"source_dataset": "binary_matrix", "source_index": 2, "matrix": [[0, 1, 1, 1, 1, 1, 1, 0, 1], [1, 1, 0, 1, 0, 1, 0, 1, 1], [1, 0, 1, 1, 0, 1, 0, 1, 0], [1, 1, 1, 1, 1, 1, 1, 0, 1], [1, 1, 1, 1, 0, 1, 1, 0, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 1, 1, 1, 1, 0, 1, 1, 0], [1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 1, 1, 1, 1, 1, ... | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1 1 0 1 1
1 ... | 3 2 1 1 0 1 1
2 1 0 1 1 1 0
1 0 1 2 1 0 1
1 0 1 1 0 0 1
1 0 0 1 1 0 1
2 1 1 2 2 1 0
3 2 2 2 1 0 1 | {"source_dataset": "binary_matrix", "source_index": 3, "matrix": [[1, 1, 1, 1, 0, 1, 1], [1, 1, 0, 1, 1, 1, 0], [1, 0, 1, 1, 1, 0, 1], [1, 0, 1, 1, 0, 0, 1], [1, 0, 0, 1, 1, 0, 1], [1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 1, 1, 0, 1]], "solution": [[3, 2, 1, 1, 0, 1, 1], [2, 1, 0, 1, 1, 1, 0], [1, 0, 1, 2, 1, 0, 1], [1, 0, 1, ... | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 0 0
0 0 1 1
... | 1 1 0 0
0 0 1 1
0 1 2 2
1 2 3 3 | {"source_dataset": "binary_matrix", "source_index": 4, "matrix": [[1, 1, 0, 0], [0, 0, 1, 1], [0, 1, 1, 1], [1, 1, 1, 1]], "solution": [[1, 1, 0, 0], [0, 0, 1, 1], [0, 1, 2, 2], [1, 2, 3, 3]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}} | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1 1 0 1 0 1
... | 3 2 2 1 0 1 0 1
2 1 1 0 1 0 1 1
1 0 1 1 2 1 0 0
2 1 2 2 2 1 1 1
2 2 3 2 1 0 0 1
1 2 3 2 1 0 1 2
0 1 2 1 0 1 2 3
1 2 2 1 0 0 1 2 | {"source_dataset": "binary_matrix", "source_index": 5, "matrix": [[1, 1, 1, 1, 0, 1, 0, 1], [1, 1, 1, 0, 1, 0, 1, 1], [1, 0, 1, 1, 1, 1, 0, 0], [1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 0, 0, 1], [1, 1, 1, 1, 1, 0, 1, 1], [0, 1, 1, 1, 0, 1, 1, 1], [1, 1, 1, 1, 0, 0, 1, 1]], "solution": [[3, 2, 2, 1, 0, 1, 0, 1], [2, 1,... | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 0 0 1 1 1 1
... | 2 1 0 0 1 1 2 1
2 1 0 1 1 0 1 0
2 1 0 0 1 1 2 1
1 0 1 0 1 0 1 0
1 0 1 1 1 1 0 1
1 0 1 1 0 1 1 2
2 1 2 1 1 0 1 1
3 2 1 0 0 1 1 0 | {"source_dataset": "binary_matrix", "source_index": 6, "matrix": [[1, 1, 0, 0, 1, 1, 1, 1], [1, 1, 0, 1, 1, 0, 1, 0], [1, 1, 0, 0, 1, 1, 1, 1], [1, 0, 1, 0, 1, 0, 1, 0], [1, 0, 1, 1, 1, 1, 0, 1], [1, 0, 1, 1, 0, 1, 1, 1], [1, 1, 1, 1, 1, 0, 1, 1], [1, 1, 1, 0, 0, 1, 1, 0]], "solution": [[2, 1, 0, 0, 1, 1, 2, 1], [2, 1,... | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1 1
1 1 0 1
... | 3 2 1 2
2 1 0 1
1 0 1 1
2 1 1 0 | {"source_dataset": "binary_matrix", "source_index": 7, "matrix": [[1, 1, 1, 1], [1, 1, 0, 1], [1, 0, 1, 1], [1, 1, 1, 0]], "solution": [[3, 2, 1, 2], [2, 1, 0, 1], [1, 0, 1, 1], [2, 1, 1, 0]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}} | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
0 1 0 1 1 1 1 0 ... | 0 1 0 1 1 2 1 0 1 2
1 2 1 0 0 1 0 1 2 3
1 2 1 0 1 2 1 0 1 2
0 1 2 1 2 2 1 0 1 2
1 0 1 2 2 3 2 1 0 1
1 1 2 2 1 2 1 0 0 0
0 1 2 1 0 1 1 1 1 0
1 2 2 1 0 1 0 1 2 1
2 2 1 2 1 0 1 1 2 2
2 1 0 1 1 0 1 0 1 2 | {"source_dataset": "binary_matrix", "source_index": 8, "matrix": [[0, 1, 0, 1, 1, 1, 1, 0, 1, 1], [1, 1, 1, 0, 0, 1, 0, 1, 1, 1], [1, 1, 1, 0, 1, 1, 1, 0, 1, 1], [0, 1, 1, 1, 1, 1, 1, 0, 1, 1], [1, 0, 1, 1, 1, 1, 1, 1, 0, 1], [1, 1, 1, 1, 1, 1, 1, 0, 0, 0], [0, 1, 1, 1, 0, 1, 1, 1, 1, 0], [1, 1, 1, 1, 0, 1, 0, 1, 1, 1]... | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1 1 1 1
1 0 ... | 2 1 2 2 2 3
1 0 1 1 1 2
1 0 1 0 0 1
1 1 1 1 0 1
0 1 0 0 0 1
0 1 1 1 1 2 | {"source_dataset": "binary_matrix", "source_index": 9, "matrix": [[1, 1, 1, 1, 1, 1], [1, 0, 1, 1, 1, 1], [1, 0, 1, 0, 0, 1], [1, 1, 1, 1, 0, 1], [0, 1, 0, 0, 0, 1], [0, 1, 1, 1, 1, 1]], "solution": [[2, 1, 2, 2, 2, 3], [1, 0, 1, 1, 1, 2], [1, 0, 1, 0, 0, 1], [1, 1, 1, 1, 0, 1], [0, 1, 0, 0, 0, 1], [0, 1, 1, 1, 1, 2]],... | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1 0 1 0 1
1 ... | 2 1 1 0 1 0 1
1 0 1 0 1 0 0
0 1 0 1 1 1 0
0 0 0 1 0 1 1
1 1 0 1 0 1 2
2 2 1 0 0 1 2
2 1 0 1 1 0 1 | {"source_dataset": "binary_matrix", "source_index": 10, "matrix": [[1, 1, 1, 0, 1, 0, 1], [1, 0, 1, 0, 1, 0, 0], [0, 1, 0, 1, 1, 1, 0], [0, 0, 0, 1, 0, 1, 1], [1, 1, 0, 1, 0, 1, 1], [1, 1, 1, 0, 0, 1, 1], [1, 1, 0, 1, 1, 0, 1]], "solution": [[2, 1, 1, 0, 1, 0, 1], [1, 0, 1, 0, 1, 0, 0], [0, 1, 0, 1, 1, 1, 0], [0, 0, 0,... | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 0 1 1 1
0 1 ... | 1 1 0 1 2 3
0 1 0 1 2 3
1 2 1 2 1 2
2 1 0 1 0 1
1 0 1 0 1 2
0 1 1 0 0 1 | {"source_dataset": "binary_matrix", "source_index": 11, "matrix": [[1, 1, 0, 1, 1, 1], [0, 1, 0, 1, 1, 1], [1, 1, 1, 1, 1, 1], [1, 1, 0, 1, 0, 1], [1, 0, 1, 0, 1, 1], [0, 1, 1, 0, 0, 1]], "solution": [[1, 1, 0, 1, 2, 3], [0, 1, 0, 1, 2, 3], [1, 2, 1, 2, 1, 2], [2, 1, 0, 1, 0, 1], [1, 0, 1, 0, 1, 2], [0, 1, 1, 0, 0, 1]]... | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
0 1 1 1 1
1 1 1 ... | 0 1 2 1 2
1 2 1 0 1
1 2 1 0 1
0 1 2 1 2
0 0 1 2 3 | {"source_dataset": "binary_matrix", "source_index": 12, "matrix": [[0, 1, 1, 1, 1], [1, 1, 1, 0, 1], [1, 1, 1, 0, 1], [0, 1, 1, 1, 1], [0, 0, 1, 1, 1]], "solution": [[0, 1, 2, 1, 2], [1, 2, 1, 0, 1], [1, 2, 1, 0, 1], [0, 1, 2, 1, 2], [0, 0, 1, 2, 3]], "n": 5, "difficulty": {"n": [3, 10], "p_zero": 0.25}} | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
0 1 0 0
1 1 1 1
... | 0 1 0 0
1 2 1 1
0 1 2 2
0 1 2 3 | {"source_dataset": "binary_matrix", "source_index": 13, "matrix": [[0, 1, 0, 0], [1, 1, 1, 1], [0, 1, 1, 1], [0, 1, 1, 1]], "solution": [[0, 1, 0, 0], [1, 2, 1, 1], [0, 1, 2, 2], [0, 1, 2, 3]], "n": 4, "difficulty": {"n": [3, 10], "p_zero": 0.25}} | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1
0 1 0
0 1 ... | 1 2 1
0 1 0
0 1 1 | {"source_dataset": "binary_matrix", "source_index": 14, "matrix": [[1, 1, 1], [0, 1, 0], [0, 1, 1]], "solution": [[1, 2, 1], [0, 1, 0], [0, 1, 1]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}} | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 0 1
1 1 1
1 0 ... | 1 0 1
2 1 2
1 0 1 | {"source_dataset": "binary_matrix", "source_index": 15, "matrix": [[1, 0, 1], [1, 1, 1], [1, 0, 1]], "solution": [[1, 0, 1], [2, 1, 2], [1, 0, 1]], "n": 3, "difficulty": {"n": [3, 10], "p_zero": 0.25}} | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 0 0 0 1 1
1 0 ... | 1 0 0 0 1 2
1 0 1 1 2 3
1 0 1 2 1 2
2 1 0 1 0 1
1 0 1 1 1 1
2 1 0 0 1 0 | {"source_dataset": "binary_matrix", "source_index": 16, "matrix": [[1, 0, 0, 0, 1, 1], [1, 0, 1, 1, 1, 1], [1, 0, 1, 1, 1, 1], [1, 1, 0, 1, 0, 1], [1, 0, 1, 1, 1, 1], [1, 1, 0, 0, 1, 0]], "solution": [[1, 0, 0, 0, 1, 2], [1, 0, 1, 1, 2, 3], [1, 0, 1, 2, 1, 2], [2, 1, 0, 1, 0, 1], [1, 0, 1, 1, 1, 1], [2, 1, 0, 0, 1, 0]]... | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 0 1 1 1 1
1 0 ... | 1 0 1 2 3 4
1 0 1 2 2 3
0 1 2 1 1 2
0 0 1 0 0 1
0 1 0 1 0 0
1 2 1 2 1 0 | {"source_dataset": "binary_matrix", "source_index": 17, "matrix": [[1, 0, 1, 1, 1, 1], [1, 0, 1, 1, 1, 1], [0, 1, 1, 1, 1, 1], [0, 0, 1, 0, 0, 1], [0, 1, 0, 1, 0, 0], [1, 1, 1, 1, 1, 0]], "solution": [[1, 0, 1, 2, 3, 4], [1, 0, 1, 2, 2, 3], [0, 1, 2, 1, 1, 2], [0, 0, 1, 0, 0, 1], [0, 1, 0, 1, 0, 0], [1, 2, 1, 2, 1, 0]]... | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1 1 0 1 0
1 ... | 3 2 2 1 0 1 0
2 1 1 0 1 0 1
1 0 0 1 1 1 2
0 0 0 1 0 1 2
0 1 0 1 0 1 2
0 1 1 2 1 2 3
0 0 0 1 0 1 2 | {"source_dataset": "binary_matrix", "source_index": 18, "matrix": [[1, 1, 1, 1, 0, 1, 0], [1, 1, 1, 0, 1, 0, 1], [1, 0, 0, 1, 1, 1, 1], [0, 0, 0, 1, 0, 1, 1], [0, 1, 0, 1, 0, 1, 1], [0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 1, 0, 1, 1]], "solution": [[3, 2, 2, 1, 0, 1, 0], [2, 1, 1, 0, 1, 0, 1], [1, 0, 0, 1, 1, 1, 2], [0, 0, 0,... | binary_matrix |
Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1 1 0 1 1 1 ... | 3 2 2 1 0 1 2 2 1 0
2 1 1 0 1 0 1 1 0 1
1 0 0 1 0 1 2 1 1 2
0 0 1 0 1 2 1 0 1 1
1 1 2 1 2 1 2 1 1 0
2 2 1 0 1 0 1 0 1 1
2 1 0 1 0 1 1 0 1 1
2 1 0 1 0 1 1 0 1 0
1 0 0 1 1 1 0 0 1 1
1 0 1 2 2 2 1 0 0 0 | {"source_dataset": "binary_matrix", "source_index": 19, "matrix": [[1, 1, 1, 1, 0, 1, 1, 1, 1, 0], [1, 1, 1, 0, 1, 0, 1, 1, 0, 1], [1, 0, 0, 1, 0, 1, 1, 1, 1, 1], [0, 0, 1, 0, 1, 1, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 0, 1, 0, 1, 0, 1, 1], [1, 1, 0, 1, 0, 1, 1, 0, 1, 1], [1, 1, 0, 1, 0, 1, 1, 0, 1, 0... | binary_matrix |
Decrypt this Caesar cipher text: JNJUBUF ZPVS BTTPDJBUF XIPN J XBT DPNQMJNFOUJOH B NPNFOU BHP. Provide only the decrypted text as your final answer. | IMITATE YOUR ASSOCIATE WHOM I WAS COMPLIMENTING A MOMENT AGO | {"source_dataset": "caesar_cipher", "source_index": 0, "rotation": 1, "cipher_text": "JNJUBUF ZPVS BTTPDJBUF XIPN J XBT DPNQMJNFOUJOH B NPNFOU BHP", "clear_text": "IMITATE YOUR ASSOCIATE WHOM I WAS COMPLIMENTING A MOMENT AGO", "num_words": 10, "difficulty": {"words": [3, 20], "rotation": [1, 25]}} | caesar_cipher |
Decrypt this Caesar cipher text: PBSDJ XKZYVOYX CWSDR LYEQRD SD PYB K WOBO KXN YBSQSXKDON DOVOZRYXSM TYEBXKVSCW. Provide only the decrypted text as your final answer. | FRITZ NAPOLEON SMITH BOUGHT IT FOR A MERE AND ORIGINATED TELEPHONIC JOURNALISM | {"source_dataset": "caesar_cipher", "source_index": 1, "rotation": 10, "cipher_text": "PBSDJ XKZYVOYX CWSDR LYEQRD SD PYB K WOBO KXN YBSQSXKDON DOVOZRYXSM TYEBXKVSCW", "clear_text": "FRITZ NAPOLEON SMITH BOUGHT IT FOR A MERE AND ORIGINATED TELEPHONIC JOURNALISM", "num_words": 12, "difficulty": {"words": [3, 20], "rotat... | caesar_cipher |
Decrypt this Caesar cipher text: ZW PFLI JKFDRTY ZJ FLK FW ZK DLJK SV DVEUVU. Provide only the decrypted text as your final answer. | IF YOUR STOMACH IS OUT OF IT MUST BE MENDED | {"source_dataset": "caesar_cipher", "source_index": 2, "rotation": 17, "cipher_text": "ZW PFLI JKFDRTY ZJ FLK FW ZK DLJK SV DVEUVU", "clear_text": "IF YOUR STOMACH IS OUT OF IT MUST BE MENDED", "num_words": 10, "difficulty": {"words": [3, 20], "rotation": [1, 25]}} | caesar_cipher |
Decrypt this Caesar cipher text: WG DFCUFSGG SJSFMKVSFS SLQSDH AIHHSFSR AF. Provide only the decrypted text as your final answer. | IS PROGRESS EVERYWHERE EXCEPT MUTTERED MR | {"source_dataset": "caesar_cipher", "source_index": 3, "rotation": 14, "cipher_text": "WG DFCUFSGG SJSFMKVSFS SLQSDH AIHHSFSR AF", "clear_text": "IS PROGRESS EVERYWHERE EXCEPT MUTTERED MR", "num_words": 6, "difficulty": {"words": [3, 20], "rotation": [1, 25]}} | caesar_cipher |
Decrypt this Caesar cipher text: FUR VF URE URNQ FHAX VA GUR CVYYBJF. Provide only the decrypted text as your final answer. | SHE IS HER HEAD SUNK IN THE PILLOWS | {"source_dataset": "caesar_cipher", "source_index": 4, "rotation": 13, "cipher_text": "FUR VF URE URNQ FHAX VA GUR CVYYBJF", "clear_text": "SHE IS HER HEAD SUNK IN THE PILLOWS", "num_words": 8, "difficulty": {"words": [3, 20], "rotation": [1, 25]}} | caesar_cipher |
Decrypt this Caesar cipher text: KLV VSHFLDO SURMHFW KDG WR GR ZLWK WKH FLWB RI DV HYHUBERGB VRPH ILIWHHQ PLOHV LQODQG. Provide only the decrypted text as your final answer. | HIS SPECIAL PROJECT HAD TO DO WITH THE CITY OF AS EVERYBODY SOME FIFTEEN MILES INLAND | {"source_dataset": "caesar_cipher", "source_index": 5, "rotation": 3, "cipher_text": "KLV VSHFLDO SURMHFW KDG WR GR ZLWK WKH FLWB RI DV HYHUBERGB VRPH ILIWHHQ PLOHV LQODQG", "clear_text": "HIS SPECIAL PROJECT HAD TO DO WITH THE CITY OF AS EVERYBODY SOME FIFTEEN MILES INLAND", "num_words": 16, "difficulty": {"words": [3... | caesar_cipher |
Decrypt this Caesar cipher text: ESP NZAJCTRSE WLHD ZQ ESP AWLNP HSPCP JZF LCP WZNLEPO LWDZ RZGPCY HSLE JZF NLY OZ HTES ESTD HZCV. Provide only the decrypted text as your final answer. | THE COPYRIGHT LAWS OF THE PLACE WHERE YOU ARE LOCATED ALSO GOVERN WHAT YOU CAN DO WITH THIS WORK | {"source_dataset": "caesar_cipher", "source_index": 6, "rotation": 11, "cipher_text": "ESP NZAJCTRSE WLHD ZQ ESP AWLNP HSPCP JZF LCP WZNLEPO LWDZ RZGPCY HSLE JZF NLY OZ HTES ESTD HZCV", "clear_text": "THE COPYRIGHT LAWS OF THE PLACE WHERE YOU ARE LOCATED ALSO GOVERN WHAT YOU CAN DO WITH THIS WORK", "num_words": 19, "di... | caesar_cipher |
Decrypt this Caesar cipher text: UZODQPUNXQ FTAGST UF UZ MXX FTQ FQZ KQMDE EUZOQ FTQUD FTUE UE FTQ RUDEF FUYQ FTMF YDE. Provide only the decrypted text as your final answer. | INCREDIBLE THOUGH IT IN ALL THE TEN YEARS SINCE THEIR THIS IS THE FIRST TIME THAT MRS | {"source_dataset": "caesar_cipher", "source_index": 7, "rotation": 12, "cipher_text": "UZODQPUNXQ FTAGST UF UZ MXX FTQ FQZ KQMDE EUZOQ FTQUD FTUE UE FTQ RUDEF FUYQ FTMF YDE", "clear_text": "INCREDIBLE THOUGH IT IN ALL THE TEN YEARS SINCE THEIR THIS IS THE FIRST TIME THAT MRS", "num_words": 17, "difficulty": {"words": [... | caesar_cipher |
Decrypt this Caesar cipher text: QXF UXWP QJB QN KNNW MA. Provide only the decrypted text as your final answer. | HOW LONG HAS HE BEEN DR | {"source_dataset": "caesar_cipher", "source_index": 8, "rotation": 9, "cipher_text": "QXF UXWP QJB QN KNNW MA", "clear_text": "HOW LONG HAS HE BEEN DR", "num_words": 6, "difficulty": {"words": [3, 20], "rotation": [1, 25]}} | caesar_cipher |
Decrypt this Caesar cipher text: RE ZEUVGVEUVEK XFMVIEDVEK. Provide only the decrypted text as your final answer. | AN INDEPENDENT GOVERNMENT | {"source_dataset": "caesar_cipher", "source_index": 9, "rotation": 17, "cipher_text": "RE ZEUVGVEUVEK XFMVIEDVEK", "clear_text": "AN INDEPENDENT GOVERNMENT", "num_words": 3, "difficulty": {"words": [3, 20], "rotation": [1, 25]}} | caesar_cipher |
Decrypt this Caesar cipher text: KV KU FGNKIJVHWN VJWU VQ VCMG DTGCMHCUV YKVJ QPG YJQ KU OKNGU QT UQ CYCA. Provide only the decrypted text as your final answer. | IT IS DELIGHTFUL THUS TO TAKE BREAKFAST WITH ONE WHO IS MILES OR SO AWAY | {"source_dataset": "caesar_cipher", "source_index": 10, "rotation": 2, "cipher_text": "KV KU FGNKIJVHWN VJWU VQ VCMG DTGCMHCUV YKVJ QPG YJQ KU OKNGU QT UQ CYCA", "clear_text": "IT IS DELIGHTFUL THUS TO TAKE BREAKFAST WITH ONE WHO IS MILES OR SO AWAY", "num_words": 15, "difficulty": {"words": [3, 20], "rotation": [1, 25... | caesar_cipher |
Decrypt this Caesar cipher text: MVY MVYAF OL WYVKBJLK HUK KPZAYPIBALK WYVQLJA LIVVRZ DPAO VUSF H SVVZL ULADVYR VM CVSBUALLY ZBWWVYA. Provide only the decrypted text as your final answer. | FOR FORTY HE PRODUCED AND DISTRIBUTED PROJECT EBOOKS WITH ONLY A LOOSE NETWORK OF VOLUNTEER SUPPORT | {"source_dataset": "caesar_cipher", "source_index": 11, "rotation": 7, "cipher_text": "MVY MVYAF OL WYVKBJLK HUK KPZAYPIBALK WYVQLJA LIVVRZ DPAO VUSF H SVVZL ULADVYR VM CVSBUALLY ZBWWVYA", "clear_text": "FOR FORTY HE PRODUCED AND DISTRIBUTED PROJECT EBOOKS WITH ONLY A LOOSE NETWORK OF VOLUNTEER SUPPORT", "num_words": 1... | caesar_cipher |
Decrypt this Caesar cipher text: LWPI DU PHZTS BG. Provide only the decrypted text as your final answer. | WHAT OF ASKED MR | {"source_dataset": "caesar_cipher", "source_index": 12, "rotation": 15, "cipher_text": "LWPI DU PHZTS BG", "clear_text": "WHAT OF ASKED MR", "num_words": 4, "difficulty": {"words": [3, 20], "rotation": [1, 25]}} | caesar_cipher |
Decrypt this Caesar cipher text: MPYZA OL LUALYZ AOL OHSS VM AOL H CHZA HWHYATLUA JYVDULK DPAO HU LUVYTVBZ AYHUZWHYLUA JBWVSH. Provide only the decrypted text as your final answer. | FIRST HE ENTERS THE HALL OF THE A VAST APARTMENT CROWNED WITH AN ENORMOUS TRANSPARENT CUPOLA | {"source_dataset": "caesar_cipher", "source_index": 13, "rotation": 7, "cipher_text": "MPYZA OL LUALYZ AOL OHSS VM AOL H CHZA HWHYATLUA JYVDULK DPAO HU LUVYTVBZ AYHUZWHYLUA JBWVSH", "clear_text": "FIRST HE ENTERS THE HALL OF THE A VAST APARTMENT CROWNED WITH AN ENORMOUS TRANSPARENT CUPOLA", "num_words": 16, "difficulty... | caesar_cipher |
Decrypt this Caesar cipher text: BOE BOZ BEEJUJPOBM UFSNT JNQPTFE CZ UIF DPQZSJHIU IPMEFS. Provide only the decrypted text as your final answer. | AND ANY ADDITIONAL TERMS IMPOSED BY THE COPYRIGHT HOLDER | {"source_dataset": "caesar_cipher", "source_index": 14, "rotation": 1, "cipher_text": "BOE BOZ BEEJUJPOBM UFSNT JNQPTFE CZ UIF DPQZSJHIU IPMEFS", "clear_text": "AND ANY ADDITIONAL TERMS IMPOSED BY THE COPYRIGHT HOLDER", "num_words": 9, "difficulty": {"words": [3, 20], "rotation": [1, 25]}} | caesar_cipher |
Decrypt this Caesar cipher text: DQOWAZ GB FTQ ZGYNQD AR EOUQZFUEFE MZP MDFUEFE FTMF TQ AR UZHQZFADE FTMF TQ TME GZPQD TUE BMK. Provide only the decrypted text as your final answer. | RECKON UP THE NUMBER OF SCIENTISTS AND ARTISTS THAT HE OF INVENTORS THAT HE HAS UNDER HIS PAY | {"source_dataset": "caesar_cipher", "source_index": 15, "rotation": 12, "cipher_text": "DQOWAZ GB FTQ ZGYNQD AR EOUQZFUEFE MZP MDFUEFE FTMF TQ AR UZHQZFADE FTMF TQ TME GZPQD TUE BMK", "clear_text": "RECKON UP THE NUMBER OF SCIENTISTS AND ARTISTS THAT HE OF INVENTORS THAT HE HAS UNDER HIS PAY", "num_words": 18, "difficu... | caesar_cipher |
Decrypt this Caesar cipher text: PM AOL ZLJVUK JVWF PZ HSZV FVB THF KLTHUK H YLMBUK PU DYPAPUN DPAOVBA MBYAOLY VWWVYABUPAPLZ AV MPE AOL WYVISLT. Provide only the decrypted text as your final answer. | IF THE SECOND COPY IS ALSO YOU MAY DEMAND A REFUND IN WRITING WITHOUT FURTHER OPPORTUNITIES TO FIX THE PROBLEM | {"source_dataset": "caesar_cipher", "source_index": 16, "rotation": 7, "cipher_text": "PM AOL ZLJVUK JVWF PZ HSZV FVB THF KLTHUK H YLMBUK PU DYPAPUN DPAOVBA MBYAOLY VWWVYABUPAPLZ AV MPE AOL WYVISLT", "clear_text": "IF THE SECOND COPY IS ALSO YOU MAY DEMAND A REFUND IN WRITING WITHOUT FURTHER OPPORTUNITIES TO FIX THE PR... | caesar_cipher |
Decrypt this Caesar cipher text: DW UHJXODU LQWHUYDOV WKHB DUH HYHU DGGUHVVLQJ WR WKH DPHULFDQ JRYHUQPHQW YDLQ FRPSODLQWV. Provide only the decrypted text as your final answer. | AT REGULAR INTERVALS THEY ARE EVER ADDRESSING TO THE AMERICAN GOVERNMENT VAIN COMPLAINTS | {"source_dataset": "caesar_cipher", "source_index": 17, "rotation": 3, "cipher_text": "DW UHJXODU LQWHUYDOV WKHB DUH HYHU DGGUHVVLQJ WR WKH DPHULFDQ JRYHUQPHQW YDLQ FRPSODLQWV", "clear_text": "AT REGULAR INTERVALS THEY ARE EVER ADDRESSING TO THE AMERICAN GOVERNMENT VAIN COMPLAINTS", "num_words": 13, "difficulty": {"wor... | caesar_cipher |
Decrypt this Caesar cipher text: DKUO WO DY WI KMMEWEVKDYB GYBUC KD XSKQKBK. Provide only the decrypted text as your final answer. | TAKE ME TO MY ACCUMULATOR WORKS AT NIAGARA | {"source_dataset": "caesar_cipher", "source_index": 18, "rotation": 10, "cipher_text": "DKUO WO DY WI KMMEWEVKDYB GYBUC KD XSKQKBK", "clear_text": "TAKE ME TO MY ACCUMULATOR WORKS AT NIAGARA", "num_words": 8, "difficulty": {"words": [3, 20], "rotation": [1, 25]}} | caesar_cipher |
Decrypt this Caesar cipher text: KDIRGOSY KBKXE UTK VXKYKTZ. Provide only the decrypted text as your final answer. | EXCLAIMS EVERY ONE PRESENT | {"source_dataset": "caesar_cipher", "source_index": 19, "rotation": 6, "cipher_text": "KDIRGOSY KBKXE UTK VXKYKTZ", "clear_text": "EXCLAIMS EVERY ONE PRESENT", "num_words": 4, "difficulty": {"words": [3, 20], "rotation": [1, 25]}} | caesar_cipher |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7