question stringclasses 10 values | answer stringclasses 10 values | metadata dict | difficulty int64 2 4 |
|---|---|---|---|
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 0
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 1
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 2
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 3
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 4
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 5
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 6
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 7
} | 2 |
Solve the cryptarithmetic puzzle: ONE + ONE = TWO. Each letter represents a unique digit (0-9), and leading letters (O, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6} | {
"difficulty": {
"num_letters": 5,
"value": [
1,
100
]
},
"puzzle": "ONE + ONE = TWO",
"solution": "{'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6}",
"source_dataset": "cryptarithm",
"source_index": 8
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 9
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 10
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 11
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 12
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 13
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 14
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 15
} | 2 |
Solve the cryptarithmetic puzzle: ONE + ONE = TWO. Each letter represents a unique digit (0-9), and leading letters (O, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6} | {
"difficulty": {
"num_letters": 5,
"value": [
1,
100
]
},
"puzzle": "ONE + ONE = TWO",
"solution": "{'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6}",
"source_dataset": "cryptarithm",
"source_index": 16
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 17
} | 2 |
Solve the cryptarithmetic puzzle: ONE + ONE = TWO. Each letter represents a unique digit (0-9), and leading letters (O, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6} | {
"difficulty": {
"num_letters": 5,
"value": [
1,
100
]
},
"puzzle": "ONE + ONE = TWO",
"solution": "{'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6}",
"source_dataset": "cryptarithm",
"source_index": 18
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 19
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 20
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 21
} | 2 |
Solve the cryptarithmetic puzzle: ONE + ONE = TWO. Each letter represents a unique digit (0-9), and leading letters (O, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6} | {
"difficulty": {
"num_letters": 5,
"value": [
1,
100
]
},
"puzzle": "ONE + ONE = TWO",
"solution": "{'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6}",
"source_dataset": "cryptarithm",
"source_index": 22
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 23
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 24
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 25
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 26
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 27
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 28
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 29
} | 2 |
Solve the cryptarithmetic puzzle: ONE + ONE = TWO. Each letter represents a unique digit (0-9), and leading letters (O, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6} | {
"difficulty": {
"num_letters": 5,
"value": [
1,
100
]
},
"puzzle": "ONE + ONE = TWO",
"solution": "{'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6}",
"source_dataset": "cryptarithm",
"source_index": 30
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 31
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 32
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 33
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 34
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 35
} | 2 |
Solve the cryptarithmetic puzzle: ONE + ONE = TWO. Each letter represents a unique digit (0-9), and leading letters (O, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6} | {
"difficulty": {
"num_letters": 5,
"value": [
1,
100
]
},
"puzzle": "ONE + ONE = TWO",
"solution": "{'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6}",
"source_dataset": "cryptarithm",
"source_index": 36
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 37
} | 2 |
Solve the cryptarithmetic puzzle: ONE + ONE = TWO. Each letter represents a unique digit (0-9), and leading letters (O, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6} | {
"difficulty": {
"num_letters": 5,
"value": [
1,
100
]
},
"puzzle": "ONE + ONE = TWO",
"solution": "{'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6}",
"source_dataset": "cryptarithm",
"source_index": 38
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 39
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 40
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 41
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 42
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 43
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 44
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 45
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 46
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 47
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 48
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 49
} | 2 |
Solve the cryptarithmetic puzzle: ONE + ONE = TWO. Each letter represents a unique digit (0-9), and leading letters (O, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6} | {
"difficulty": {
"num_letters": 5,
"value": [
1,
100
]
},
"puzzle": "ONE + ONE = TWO",
"solution": "{'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6}",
"source_dataset": "cryptarithm",
"source_index": 50
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 51
} | 2 |
Solve the cryptarithmetic puzzle: ONE + ONE = TWO. Each letter represents a unique digit (0-9), and leading letters (O, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6} | {
"difficulty": {
"num_letters": 5,
"value": [
1,
100
]
},
"puzzle": "ONE + ONE = TWO",
"solution": "{'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6}",
"source_dataset": "cryptarithm",
"source_index": 52
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 53
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 54
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 55
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 56
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 57
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 58
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 59
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 60
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 61
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 62
} | 2 |
Solve the cryptarithmetic puzzle: ONE + ONE = TWO. Each letter represents a unique digit (0-9), and leading letters (O, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6} | {
"difficulty": {
"num_letters": 5,
"value": [
1,
100
]
},
"puzzle": "ONE + ONE = TWO",
"solution": "{'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6}",
"source_dataset": "cryptarithm",
"source_index": 63
} | 2 |
Solve the cryptarithmetic puzzle: ONE + ONE = TWO. Each letter represents a unique digit (0-9), and leading letters (O, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6} | {
"difficulty": {
"num_letters": 5,
"value": [
1,
100
]
},
"puzzle": "ONE + ONE = TWO",
"solution": "{'O': 5, 'N': 3, 'E': 7, 'T': 1, 'W': 6}",
"source_dataset": "cryptarithm",
"source_index": 64
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 65
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 66
} | 2 |
Solve the cryptarithmetic puzzle: COCA + COLA = OASIS. Each letter represents a unique digit (0-9), and leading letters (C, O) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "COCA + COLA = OASIS",
"solution": "{'C': 9, 'O': 5, 'A': 2, 'L': 8, 'S': 3, 'I': 1}",
"source_dataset": "cryptarithm",
"source_index": 67
} | 2 |
Solve the cryptarithmetic puzzle: TWO + TWO = FOUR. Each letter represents a unique digit (0-9), and leading letters (F, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "TWO + TWO = FOUR",
"solution": "{'T': 7, 'W': 6, 'O': 5, 'F': 1, 'U': 3, 'R': 0}",
"source_dataset": "cryptarithm",
"source_index": 68
} | 2 |
Solve the cryptarithmetic puzzle: EAT + THAT = APPLE. Each letter represents a unique digit (0-9), and leading letters (A, E, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2} | {
"difficulty": {
"num_letters": 6,
"value": [
1,
100
]
},
"puzzle": "EAT + THAT = APPLE",
"solution": "{'E': 9, 'A': 8, 'T': 7, 'H': 6, 'P': 3, 'L': 2}",
"source_dataset": "cryptarithm",
"source_index": 69
} | 2 |
Solve the cryptarithmetic puzzle: SEND + MORE = MONEY. Each letter represents a unique digit (0-9), and leading letters (M, S) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'S': 9, 'E': 5, 'N': 6, 'D': 7, 'M': 1, 'O': 0, 'R': 8, 'Y': 2} | {
"difficulty": {
"num_letters": 8,
"value": [
1,
100
]
},
"puzzle": "SEND + MORE = MONEY",
"solution": "{'S': 9, 'E': 5, 'N': 6, 'D': 7, 'M': 1, 'O': 0, 'R': 8, 'Y': 2}",
"source_dataset": "cryptarithm",
"source_index": 70
} | 3 |
Solve the cryptarithmetic puzzle: BASE + BALL = GAMES. Each letter represents a unique digit (0-9), and leading letters (B, G) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "BASE + BALL = GAMES",
"solution": "{'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0}",
"source_dataset": "cryptarithm",
"source_index": 71
} | 3 |
Solve the cryptarithmetic puzzle: USA + USSR = PEACE. Each letter represents a unique digit (0-9), and leading letters (P, U) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "USA + USSR = PEACE",
"solution": "{'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4}",
"source_dataset": "cryptarithm",
"source_index": 72
} | 3 |
Solve the cryptarithmetic puzzle: BASE + BALL = GAMES. Each letter represents a unique digit (0-9), and leading letters (B, G) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "BASE + BALL = GAMES",
"solution": "{'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0}",
"source_dataset": "cryptarithm",
"source_index": 73
} | 3 |
Solve the cryptarithmetic puzzle: SEND + MORE = MONEY. Each letter represents a unique digit (0-9), and leading letters (M, S) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'S': 9, 'E': 5, 'N': 6, 'D': 7, 'M': 1, 'O': 0, 'R': 8, 'Y': 2} | {
"difficulty": {
"num_letters": 8,
"value": [
1,
100
]
},
"puzzle": "SEND + MORE = MONEY",
"solution": "{'S': 9, 'E': 5, 'N': 6, 'D': 7, 'M': 1, 'O': 0, 'R': 8, 'Y': 2}",
"source_dataset": "cryptarithm",
"source_index": 74
} | 3 |
Solve the cryptarithmetic puzzle: HALF + HALF = WHOLE. Each letter represents a unique digit (0-9), and leading letters (H, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "HALF + HALF = WHOLE",
"solution": "{'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2}",
"source_dataset": "cryptarithm",
"source_index": 75
} | 3 |
Solve the cryptarithmetic puzzle: EARTH + AIR = WATER. Each letter represents a unique digit (0-9), and leading letters (A, E, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "EARTH + AIR = WATER",
"solution": "{'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1}",
"source_dataset": "cryptarithm",
"source_index": 76
} | 3 |
Solve the cryptarithmetic puzzle: BASE + BALL = GAMES. Each letter represents a unique digit (0-9), and leading letters (B, G) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "BASE + BALL = GAMES",
"solution": "{'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0}",
"source_dataset": "cryptarithm",
"source_index": 77
} | 3 |
Solve the cryptarithmetic puzzle: HALF + HALF = WHOLE. Each letter represents a unique digit (0-9), and leading letters (H, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "HALF + HALF = WHOLE",
"solution": "{'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2}",
"source_dataset": "cryptarithm",
"source_index": 78
} | 3 |
Solve the cryptarithmetic puzzle: USA + USSR = PEACE. Each letter represents a unique digit (0-9), and leading letters (P, U) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "USA + USSR = PEACE",
"solution": "{'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4}",
"source_dataset": "cryptarithm",
"source_index": 79
} | 3 |
Solve the cryptarithmetic puzzle: USA + USSR = PEACE. Each letter represents a unique digit (0-9), and leading letters (P, U) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "USA + USSR = PEACE",
"solution": "{'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4}",
"source_dataset": "cryptarithm",
"source_index": 80
} | 3 |
Solve the cryptarithmetic puzzle: USA + USSR = PEACE. Each letter represents a unique digit (0-9), and leading letters (P, U) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "USA + USSR = PEACE",
"solution": "{'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4}",
"source_dataset": "cryptarithm",
"source_index": 81
} | 3 |
Solve the cryptarithmetic puzzle: HALF + HALF = WHOLE. Each letter represents a unique digit (0-9), and leading letters (H, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "HALF + HALF = WHOLE",
"solution": "{'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2}",
"source_dataset": "cryptarithm",
"source_index": 82
} | 3 |
Solve the cryptarithmetic puzzle: BASE + BALL = GAMES. Each letter represents a unique digit (0-9), and leading letters (B, G) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "BASE + BALL = GAMES",
"solution": "{'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0}",
"source_dataset": "cryptarithm",
"source_index": 83
} | 3 |
Solve the cryptarithmetic puzzle: HALF + HALF = WHOLE. Each letter represents a unique digit (0-9), and leading letters (H, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "HALF + HALF = WHOLE",
"solution": "{'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2}",
"source_dataset": "cryptarithm",
"source_index": 84
} | 3 |
Solve the cryptarithmetic puzzle: HALF + HALF = WHOLE. Each letter represents a unique digit (0-9), and leading letters (H, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "HALF + HALF = WHOLE",
"solution": "{'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2}",
"source_dataset": "cryptarithm",
"source_index": 85
} | 3 |
Solve the cryptarithmetic puzzle: EARTH + AIR = WATER. Each letter represents a unique digit (0-9), and leading letters (A, E, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "EARTH + AIR = WATER",
"solution": "{'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1}",
"source_dataset": "cryptarithm",
"source_index": 86
} | 3 |
Solve the cryptarithmetic puzzle: EARTH + AIR = WATER. Each letter represents a unique digit (0-9), and leading letters (A, E, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "EARTH + AIR = WATER",
"solution": "{'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1}",
"source_dataset": "cryptarithm",
"source_index": 87
} | 3 |
Solve the cryptarithmetic puzzle: BASE + BALL = GAMES. Each letter represents a unique digit (0-9), and leading letters (B, G) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "BASE + BALL = GAMES",
"solution": "{'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0}",
"source_dataset": "cryptarithm",
"source_index": 88
} | 3 |
Solve the cryptarithmetic puzzle: EARTH + AIR = WATER. Each letter represents a unique digit (0-9), and leading letters (A, E, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "EARTH + AIR = WATER",
"solution": "{'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1}",
"source_dataset": "cryptarithm",
"source_index": 89
} | 3 |
Solve the cryptarithmetic puzzle: USA + USSR = PEACE. Each letter represents a unique digit (0-9), and leading letters (P, U) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "USA + USSR = PEACE",
"solution": "{'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4}",
"source_dataset": "cryptarithm",
"source_index": 90
} | 3 |
Solve the cryptarithmetic puzzle: EARTH + AIR = WATER. Each letter represents a unique digit (0-9), and leading letters (A, E, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "EARTH + AIR = WATER",
"solution": "{'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1}",
"source_dataset": "cryptarithm",
"source_index": 91
} | 3 |
Solve the cryptarithmetic puzzle: USA + USSR = PEACE. Each letter represents a unique digit (0-9), and leading letters (P, U) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "USA + USSR = PEACE",
"solution": "{'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4}",
"source_dataset": "cryptarithm",
"source_index": 92
} | 3 |
Solve the cryptarithmetic puzzle: BASE + BALL = GAMES. Each letter represents a unique digit (0-9), and leading letters (B, G) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "BASE + BALL = GAMES",
"solution": "{'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0}",
"source_dataset": "cryptarithm",
"source_index": 93
} | 3 |
Solve the cryptarithmetic puzzle: HALF + HALF = WHOLE. Each letter represents a unique digit (0-9), and leading letters (H, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "HALF + HALF = WHOLE",
"solution": "{'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2}",
"source_dataset": "cryptarithm",
"source_index": 94
} | 3 |
Solve the cryptarithmetic puzzle: HALF + HALF = WHOLE. Each letter represents a unique digit (0-9), and leading letters (H, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "HALF + HALF = WHOLE",
"solution": "{'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2}",
"source_dataset": "cryptarithm",
"source_index": 95
} | 3 |
Solve the cryptarithmetic puzzle: EARTH + AIR = WATER. Each letter represents a unique digit (0-9), and leading letters (A, E, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "EARTH + AIR = WATER",
"solution": "{'E': 6, 'A': 8, 'R': 9, 'T': 7, 'H': 5, 'I': 2, 'W': 1}",
"source_dataset": "cryptarithm",
"source_index": 96
} | 3 |
Solve the cryptarithmetic puzzle: USA + USSR = PEACE. Each letter represents a unique digit (0-9), and leading letters (P, U) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4} | {
"difficulty": {
"num_letters": 7,
"value": [
1,
100
]
},
"puzzle": "USA + USSR = PEACE",
"solution": "{'U': 3, 'S': 7, 'A': 2, 'R': 8, 'P': 1, 'E': 0, 'C': 4}",
"source_dataset": "cryptarithm",
"source_index": 97
} | 3 |
Solve the cryptarithmetic puzzle: SEND + MORE = MONEY. Each letter represents a unique digit (0-9), and leading letters (M, S) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'S': 9, 'E': 5, 'N': 6, 'D': 7, 'M': 1, 'O': 0, 'R': 8, 'Y': 2} | {
"difficulty": {
"num_letters": 8,
"value": [
1,
100
]
},
"puzzle": "SEND + MORE = MONEY",
"solution": "{'S': 9, 'E': 5, 'N': 6, 'D': 7, 'M': 1, 'O': 0, 'R': 8, 'Y': 2}",
"source_dataset": "cryptarithm",
"source_index": 98
} | 3 |
Solve the cryptarithmetic puzzle: SEND + MORE = MONEY. Each letter represents a unique digit (0-9), and leading letters (M, S) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'S': 9, 'E': 5, 'N': 6, 'D': 7, 'M': 1, 'O': 0, 'R': 8, 'Y': 2} | {
"difficulty": {
"num_letters": 8,
"value": [
1,
100
]
},
"puzzle": "SEND + MORE = MONEY",
"solution": "{'S': 9, 'E': 5, 'N': 6, 'D': 7, 'M': 1, 'O': 0, 'R': 8, 'Y': 2}",
"source_dataset": "cryptarithm",
"source_index": 99
} | 3 |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 22