mirror of
https://github.com/open-thought/reasoning-gym.git
synced 2026-04-23 16:55:05 +00:00
fix: Unify Prompts (#254)
* remove cot * fix prompt template * fix pool matrix * spiral matrix fixed
This commit is contained in:
parent
49db4ed761
commit
01e1c8f9af
31 changed files with 65 additions and 354 deletions
|
|
@ -23,17 +23,6 @@ After you make use of a rule, you should update the counts of each machine and p
|
|||
The output should be the count of each machine and part type after the rules have been exhaustively applied in the following order: A B C X Y Z.
|
||||
For example 1 0 1 5 4 3 means that you have 1 machine A, 0 machine B, 1 machine C, 5 part X, 4 part Y, and 3 part Z.
|
||||
|
||||
Example:
|
||||
- Input: You have 2 machines A, 0 machines B, and 1 machine C.
|
||||
- Output: 0 0 1 2 0 2
|
||||
- Explanation
|
||||
0. Initial state: 2 0 1 0 0 0
|
||||
1. We can apply rule 1 and trade 1 machine A for 2 part X and 1 part Y: 1 0 1 2 1 0
|
||||
2. Starting over, we can apply rule 1 again: 0 0 1 4 2 0
|
||||
3. In the next iteration, we can apply rule 5 and trade 1 part X and 1 part Y for 1 part Z: 0 0 1 3 1 1
|
||||
4. In the next iteration, we can apply rule 5 again: 0 0 1 2 0 2
|
||||
5. We can't apply any more rules, so the final answer is 0 0 1 2 0 2
|
||||
|
||||
Now, you have {A_machine} machine A, {B_machine} machine B, and {C_machine} machine C. Provide the count of each machine and part type after applying the above rules.
|
||||
"""
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue