question stringclasses 10 values | answer stringclasses 10 values | metadata dict | difficulty int64 2 4 |
|---|---|---|---|
Solve the cryptarithmetic puzzle: FORTY + TEN + TEN = SIXTY. Each letter represents a unique digit (0-9), and leading letters (F, S, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4} | {
"difficulty": {
"num_letters": 10,
"value": [
1,
100
]
},
"puzzle": "FORTY + TEN + TEN = SIXTY",
"solution": "{'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4}",
"source_dataset": "cryptarithm",
"source_index": 200
} | 4 |
Solve the cryptarithmetic puzzle: FORTY + TEN + TEN = SIXTY. Each letter represents a unique digit (0-9), and leading letters (F, S, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4} | {
"difficulty": {
"num_letters": 10,
"value": [
1,
100
]
},
"puzzle": "FORTY + TEN + TEN = SIXTY",
"solution": "{'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4}",
"source_dataset": "cryptarithm",
"source_index": 201
} | 4 |
Solve the cryptarithmetic puzzle: FORTY + TEN + TEN = SIXTY. Each letter represents a unique digit (0-9), and leading letters (F, S, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4} | {
"difficulty": {
"num_letters": 10,
"value": [
1,
100
]
},
"puzzle": "FORTY + TEN + TEN = SIXTY",
"solution": "{'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4}",
"source_dataset": "cryptarithm",
"source_index": 202
} | 4 |
Solve the cryptarithmetic puzzle: FORTY + TEN + TEN = SIXTY. Each letter represents a unique digit (0-9), and leading letters (F, S, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4} | {
"difficulty": {
"num_letters": 10,
"value": [
1,
100
]
},
"puzzle": "FORTY + TEN + TEN = SIXTY",
"solution": "{'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4}",
"source_dataset": "cryptarithm",
"source_index": 203
} | 4 |
Solve the cryptarithmetic puzzle: FORTY + TEN + TEN = SIXTY. Each letter represents a unique digit (0-9), and leading letters (F, S, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4} | {
"difficulty": {
"num_letters": 10,
"value": [
1,
100
]
},
"puzzle": "FORTY + TEN + TEN = SIXTY",
"solution": "{'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4}",
"source_dataset": "cryptarithm",
"source_index": 204
} | 4 |
Solve the cryptarithmetic puzzle: FORTY + TEN + TEN = SIXTY. Each letter represents a unique digit (0-9), and leading letters (F, S, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4} | {
"difficulty": {
"num_letters": 10,
"value": [
1,
100
]
},
"puzzle": "FORTY + TEN + TEN = SIXTY",
"solution": "{'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4}",
"source_dataset": "cryptarithm",
"source_index": 205
} | 4 |
Solve the cryptarithmetic puzzle: FORTY + TEN + TEN = SIXTY. Each letter represents a unique digit (0-9), and leading letters (F, S, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4} | {
"difficulty": {
"num_letters": 10,
"value": [
1,
100
]
},
"puzzle": "FORTY + TEN + TEN = SIXTY",
"solution": "{'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4}",
"source_dataset": "cryptarithm",
"source_index": 206
} | 4 |
Solve the cryptarithmetic puzzle: FORTY + TEN + TEN = SIXTY. Each letter represents a unique digit (0-9), and leading letters (F, S, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4} | {
"difficulty": {
"num_letters": 10,
"value": [
1,
100
]
},
"puzzle": "FORTY + TEN + TEN = SIXTY",
"solution": "{'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4}",
"source_dataset": "cryptarithm",
"source_index": 207
} | 4 |
Solve the cryptarithmetic puzzle: FORTY + TEN + TEN = SIXTY. Each letter represents a unique digit (0-9), and leading letters (F, S, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4} | {
"difficulty": {
"num_letters": 10,
"value": [
1,
100
]
},
"puzzle": "FORTY + TEN + TEN = SIXTY",
"solution": "{'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4}",
"source_dataset": "cryptarithm",
"source_index": 208
} | 4 |
Solve the cryptarithmetic puzzle: FORTY + TEN + TEN = SIXTY. Each letter represents a unique digit (0-9), and leading letters (F, S, T) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A': 1, 'B': 2, ...} | {'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4} | {
"difficulty": {
"num_letters": 10,
"value": [
1,
100
]
},
"puzzle": "FORTY + TEN + TEN = SIXTY",
"solution": "{'F': 2, 'O': 9, 'R': 7, 'T': 8, 'Y': 0, 'E': 5, 'N': 6, 'S': 3, 'I': 1, 'X': 4}",
"source_dataset": "cryptarithm",
"source_index": 209
} | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.