problem stringlengths 54 3.79k | solution stringlengths 3 7.27k | answer stringlengths 1 91 | problem_type stringclasses 1
value | question_type stringclasses 3
values | source stringclasses 7
values | uuid stringlengths 3 36 | is_reasoning_complete sequencelengths 2 6 | generations sequencelengths 2 6 | correctness_math_verify sequencelengths 2 6 | correctness_llama sequencelengths | finish_reasons sequencelengths 2 6 ⌀ | correctness_count int64 1 6 | messages listlengths 2 2 | longest_correct_generation stringlengths 24.5k 77.5k | length int64 24.5k 77.5k | text stringlengths 24.7k 78.3k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"Diding M.\n\nIn a country of knights (who always tell the truth) and liars (who always lie), 10 peo(...TRUNCATED) | "Example. The first question is asked from an arbitrary point. If all answers to it are the same, th(...TRUNCATED) | 2 | Logic and Puzzles | math-word-problem | olympiads | 258ff263-952e-5019-90d2-f5aef2368382 | [
true,
true
] | ["<think>\nOkay, so I'm trying to solve this logic puzzle about knights and liars sitting around a d(...TRUNCATED) | [
false,
true
] | null | null | 1 | [{"content":"Diding M.\n\nIn a country of knights (who always tell the truth) and liars (who always (...TRUNCATED) | "<think>\nOkay, so there's this problem about knights and liars sitting around a decagon-shaped tabl(...TRUNCATED) | 77,466 | "<|im_start|>system\nYou are Qwen, created by Alibaba Cloud. You are a helpful assistant.<|im_end|>\(...TRUNCATED) |
"Authors: Dumanov I., Krotovsky R.\n\nDiscussing winter holidays in class, Sasha said: \"Now, after (...TRUNCATED) | "Evaluation. Suppose three points were enough. They define a plane. If it passes through the center (...TRUNCATED) | 4 | Logic and Puzzles | math-word-problem | olympiads | ce373a17-5997-5652-a0be-e2188efe2623 | [
true,
true
] | ["<think>\nOkay, let's try to figure out this problem. So Sasha said that after flying to Addis Abab(...TRUNCATED) | [
true,
true
] | null | null | 2 | [{"content":"Authors: Dumanov I., Krotovsky R.\n\nDiscussing winter holidays in class, Sasha said: \(...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. So Sasha said that after flying to Addis Ababa(...TRUNCATED) | 72,718 | "<|im_start|>system\nYou are Qwen, created by Alibaba Cloud. You are a helpful assistant.<|im_end|>\(...TRUNCATED) |
"Let $A_1$, $\\ldots$, $A_{2022}$ be the vertices of a regular $2022$-gon in the plane. Alice and Bo(...TRUNCATED) | "1. **Understanding the Problem:**\n - Alice colors the plane with a line, dividing it into two re(...TRUNCATED) | 22 | Logic and Puzzles | math-word-problem | aops_forum | af7bb416-ed72-5d7f-8226-0667b83149fe | [
true,
true
] | ["<think>\nAlright, so I have this problem here where Alice and Bob are playing a game involving a r(...TRUNCATED) | [
true,
true
] | null | [
"stop",
"stop"
] | 2 | [{"content":"Let $A_1$, $\\ldots$, $A_{2022}$ be the vertices of a regular $2022$-gon in the plane. (...TRUNCATED) | "<think>\nOkay, so Alice and Bob are playing this game with a regular 2022-gon. Alice picks a line a(...TRUNCATED) | 70,046 | "<|im_start|>system\nYou are Qwen, created by Alibaba Cloud. You are a helpful assistant.<|im_end|>\(...TRUNCATED) |
"5. In the cash register of the commercial director Vasily, money appeared for the first time in a l(...TRUNCATED) | "Solution. Answer: no. If each weighing results in equality, then all the coins used in it are genui(...TRUNCATED) | no | Logic and Puzzles | math-word-problem | olympiads | 30a77819-14bc-5e9b-ac45-509393221997 | [
true,
true
] | ["<think>\nOkay, so the problem is about Vasily who has 2019 coins in his cash register, and one of (...TRUNCATED) | [
true,
true
] | null | [
"stop",
"stop"
] | 2 | [{"content":"5. In the cash register of the commercial director Vasily, money appeared for the first(...TRUNCATED) | "<think>\nOkay, so Vasily has 2019 coins in the cash register, and one of them is counterfeit. The c(...TRUNCATED) | 69,697 | "<|im_start|>system\nYou are Qwen, created by Alibaba Cloud. You are a helpful assistant.<|im_end|>\(...TRUNCATED) |
"A hydra consists of several heads and several necks, where each neck joins two heads. When a hydra(...TRUNCATED) | "1. **Restate the problem in graph theory terms:**\n - Each head of the hydra is a vertex.\n - E(...TRUNCATED) | 10 | Logic and Puzzles | math-word-problem | aops_forum | 6a194fee-4491-5314-8ebd-84f8865bcfca | [
true,
false
] | ["<think>\nOkay, so I need to figure out the minimum number N such that Heracle can defeat any hydra(...TRUNCATED) | [
true,
true
] | null | null | 2 | [{"content":"A hydra consists of several heads and several necks, where each neck joins two heads. (...TRUNCATED) | "<think>\nOkay, so I need to figure out the minimum number N such that Heracle can defeat any hydra (...TRUNCATED) | 67,629 | "<|im_start|>system\nYou are Qwen, created by Alibaba Cloud. You are a helpful assistant.<|im_end|>\(...TRUNCATED) |
"8. A coin collector has 100 coins that look the same. The collector knows that 30 of them are genui(...TRUNCATED) | "8. First, it is clear that 70 weighings can certainly find at least one genuine coin.\n\nIn fact, e(...TRUNCATED) | 70 | Logic and Puzzles | math-word-problem | cn_contest | 24ed9e3e-944e-5c11-bbcc-84b711fb61a4 | [
true,
false
] | ["<think>\nOkay, so there's this coin collector who has 100 coins. Out of these, 30 are genuine and (...TRUNCATED) | [
true,
false
] | null | null | 1 | [{"content":"8. A coin collector has 100 coins that look the same. The collector knows that 30 of th(...TRUNCATED) | "<think>\nOkay, so there's this coin collector who has 100 coins. Out of these, 30 are genuine and 7(...TRUNCATED) | 66,599 | "<|im_start|>system\nYou are Qwen, created by Alibaba Cloud. You are a helpful assistant.<|im_end|>\(...TRUNCATED) |
"$:$ Folkiore\n\nIt is known that among 63 coins there are 7 counterfeit ones. All counterfeit coins(...TRUNCATED) | "1) Let's set aside one coin and put 31 coins on each pan of the scales. If the pans balance, then w(...TRUNCATED) | 7 | Logic and Puzzles | math-word-problem | olympiads | 047408c4-d50c-54d0-8f0a-8baf58b44f19 | [
true,
true
] | ["<think>\nOkay, so I need to figure out how to determine 7 genuine coins out of 63 using only three(...TRUNCATED) | [
true,
false
] | null | null | 1 | [{"content":"$:$ Folkiore\n\nIt is known that among 63 coins there are 7 counterfeit ones. All count(...TRUNCATED) | "<think>\nOkay, so I need to figure out how to determine 7 genuine coins out of 63 using only three (...TRUNCATED) | 66,023 | "<|im_start|>system\nYou are Qwen, created by Alibaba Cloud. You are a helpful assistant.<|im_end|>\(...TRUNCATED) |
"6. To guard the object, the client agreed with the guards on the following: all of them will indica(...TRUNCATED) | 6. $\frac{90000}{2 \cdot 300}=150 \text{h}$. | 150 | Logic and Puzzles | math-word-problem | olympiads | 71dacc25-d06b-54d2-873b-7c4251872212 | [
true,
true
] | ["<think>\nOkay, let me try to figure out this problem step by step. So, the client needs to set a t(...TRUNCATED) | [
true,
true
] | null | null | 2 | [{"content":"6. To guard the object, the client agreed with the guards on the following: all of them(...TRUNCATED) | "<think>\nOkay, let me try to figure out this problem step by step. So, the client needs to set a ti(...TRUNCATED) | 65,737 | "<|im_start|>system\nYou are Qwen, created by Alibaba Cloud. You are a helpful assistant.<|im_end|>\(...TRUNCATED) |
"Arutyun and Amayak show another effective trick. A spectator writes down on a board a sequence of $(...TRUNCATED) | "1. **Establishing the minimum value of \\( N \\):**\n\n We need to determine the minimum number \(...TRUNCATED) | 101 | Logic and Puzzles | math-word-problem | aops_forum | 76188c5f-09e9-53a6-8095-1f16439fdc25 | [
true,
false
] | ["<think>\nOkay, so here's this problem about Arutyun and Amayak performing a trick with a sequence (...TRUNCATED) | [
true,
false
] | null | null | 1 | [{"content":"Arutyun and Amayak show another effective trick. A spectator writes down on a board a s(...TRUNCATED) | "<think>\nOkay, so here's this problem about Arutyun and Amayak performing a trick with a sequence o(...TRUNCATED) | 65,628 | "<|im_start|>system\nYou are Qwen, created by Alibaba Cloud. You are a helpful assistant.<|im_end|>\(...TRUNCATED) |
"4. There are two fleas at the two endpoints of the line segment $[0, 1]$. Some points are marked wi(...TRUNCATED) | "4. The segment [0, 1] is divided into smaller segments by certain fixed points, with lengths $\\fra(...TRUNCATED) | 2 | Logic and Puzzles | math-word-problem | cn_contest | b1d2ce80-2fe4-59d8-b88d-738bcde70515 | [
true,
true
] | ["<think>\nOkay, let me try to figure out this flea jumping problem. So, we have two fleas at the en(...TRUNCATED) | [
true,
true
] | null | null | 2 | [{"content":"4. There are two fleas at the two endpoints of the line segment $[0, 1]$. Some points a(...TRUNCATED) | "<think>\nOkay, let me try to figure out this flea jumping problem. So, we have two fleas at the end(...TRUNCATED) | 65,296 | "<|im_start|>system\nYou are Qwen, created by Alibaba Cloud. You are a helpful assistant.<|im_end|>\(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 9