messages listlengths 1 1 | dataset stringclasses 1
value | type stringclasses 3
values | og_question stringclasses 3
values | new_question stringclasses 3
values | __index_level_0__ int64 5 9 |
|---|---|---|---|---|---|
[
{
"content": "For triangle with vertices A=(1, 1), B=(7, 1), and C=(4, 5), determine the centroid (intersection of medians). Provide the coordinates of the centroid in the form (x, y), and round your answer to 3 decimal places.",
"role": "user"
}
] | puzzle | advanced_geometry | For triangle with vertices A=(0, 8), B=(5, 0), and C=(4, 2), determine the orthocenter (intersection of altitudes). For all geometry problems:
1. Give coordinates in the form (x, y)
2. Round decimal answers to 3 decimal places
3. Use the degree symbol 掳 for angles
4. Return only the angle, coordinates, or radius as your answer.
| For triangle with vertices A=(1, 1), B=(7, 1), and C=(4, 5), determine the centroid (intersection of medians). Provide the coordinates of the centroid in the form (x, y), and round your answer to 3 decimal places. | 5 |
[
{
"content": "Given the list of words: Apple, banana, Cherry, eggplant, sort these words in ascending order using ASCII/Unicode ordering and return them as a comma-separated list.",
"role": "user"
}
] | puzzle | Alphabetical_sorting | Your task is to sort words in ascending or descending order using ASCII/Unicode ordering.
Your output should be a comma-separated list of words, e.g. word_1, word_2, word_3
Now, sort these words in descending order (using ASCII/Unicode ordering) and return them as a comma-separated list: Since, Dinner, BREACH, paper
| Given the list of words: Apple, banana, Cherry, eggplant, sort these words in ascending order using ASCII/Unicode ordering and return them as a comma-separated list. | 7 |
[
{
"content": "Given a binary string, determine the maximum length of a substring that can be made alternating with at most four character swaps. For example, for the string \"11000110\", the longest alternating substring you can form is of length 6. What is the longest length for the string \"0010010101110\"?",... | puzzle | 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, even if they are not adjacent.
Now, determine the minimum number of swaps to make the following binary string alternating: 10010101000111
| Given a binary string, determine the maximum length of a substring that can be made alternating with at most four character swaps. For example, for the string "11000110", the longest alternating substring you can form is of length 6. What is the longest length for the string "0010010101110"? | 9 |
README.md exists but content is empty.
- Downloads last month
- 5