task_name stringclasses 6
values | strategy_id stringclasses 20
values | input_text stringlengths 6 26 | reasoning_trace stringlengths 11 152 |
|---|---|---|---|
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,1) ; G=(5,4) | R:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) |
sorting_algorithms | sorting_algorithms:heap-sort | 5, 4, 0, 7, 9 | [5,9,0,7,4] ; [9,5,0,7,4] ; [9,7,0,5,4] ; [4,7,0,5,9] ; [7,4,0,5,9] ; [7,5,0,4,9] ; [4,5,0,7,9] ; [5,4,0,7,9] ; [0,4,5,7,9] ; [4,0,5,7,9] ; [0,4,5,7,9] |
list_summation | list_summation:left-to-right | 6, 3, 5, 4 | 6+3=9 ; 9+5=14 ; 14+4=18 |
list_summation | list_summation:pairwise | 6, 8, 6, 0 | 6+8=14 ; 6+0=6 ; 14+6=20 |
sorting_algorithms | sorting_algorithms:insertion-sort | 2, 3, 6, 8, 0 | [2,3,6,8,0] ; [2,3,6,8,0] ; [2,3,6,8,0] ; [0,2,3,6,8] |
list_summation | list_summation:right-to-left | 5, 5, 1, 1 | 1+1=2 ; 5+2=7 ; 5+7=12 |
list_summation | list_summation:right-to-left | 6, 6, 5, 6 | 5+6=11 ; 6+11=17 ; 6+17=23 |
multidigit_addition | multidigit_addition:rounding-decomposition | 410+343 | round:410+343=753 ; adjust:753-0=753 ; sum=753 |
base_conversion | base_conversion:decomposition | n=163,base=4 | TERM:2*4^3=128 ; TERM:2*4^2=32 ; TERM:0*4^1=0 ; TERM:3*4^0=3 ; OUT:2203 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,4) ; G=(5,5) | D:(3,4) ; D:(4,4) ; D:(5,4) ; R:(5,5) |
multidigit_addition | multidigit_addition:left-to-right-partials | 658+789 | p100:600+700=1300 ; p10:50+80=130 ; p1:8+9=17 ; sum=1300+130+17=1447 |
multidigit_addition | multidigit_addition:left-to-right-partials | 540+658 | p100:500+600=1100 ; p10:40+50=90 ; p1:0+8=8 ; sum=1100+90+8=1198 |
sorting_algorithms | sorting_algorithms:selection-sort | 9, 4, 3, 6, 0 | [0,4,3,6,9] ; [0,3,4,6,9] ; [0,3,4,6,9] ; [0,3,4,6,9] |
linear_equation_solving | linear_equation_solving:inverse-ops | 6x-6=36 | 6x-6=36 ; x=(36--6)/6 ; x=42/6 ; x=7 |
linear_equation_solving | linear_equation_solving:inverse-ops | 3x-9=6 | 3x-9=6 ; x=(6--9)/3 ; x=15/3 ; x=5 |
base_conversion | base_conversion:repeated-division | n=132,base=4 | DIV:132/4=33,r:0 ; DIV:33/4=8,r:1 ; DIV:8/4=2,r:0 ; DIV:2/4=0,r:2 ; OUT:2010 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 6x+18=18 | 6x+18=18 ; x+3=3 ; x=3-3 ; x=0 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 6x-42=-54 | 6x-42=-54 ; 6x=-12 ; x=-2 |
sorting_algorithms | sorting_algorithms:insertion-sort | 2, 5, 8, 4, 7 | [2,5,8,4,7] ; [2,5,8,4,7] ; [2,4,5,8,7] ; [2,4,5,7,8] |
multidigit_addition | multidigit_addition:right-to-left-carry | 899+713 | d2:9+3+0=12→w2,c1 ; d1:9+1+1=11→w1,c1 ; d0:8+7+1=16→w6,c1 ; sum=1612 |
list_summation | list_summation:right-to-left | 3, 7, 2, 7 | 2+7=9 ; 7+9=16 ; 3+16=19 |
sorting_algorithms | sorting_algorithms:bubble-sort | 3, 2, 4, 1, 7 | [2,3,4,1,7] ; [2,3,1,4,7] ; [2,1,3,4,7] ; [1,2,3,4,7] |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,0) ; G=(3,2) | D:(3,0) ; R:(3,1) ; R:(3,2) |
multidigit_addition | multidigit_addition:right-to-left-carry | 755+973 | d2:5+3+0=8→w8,c0 ; d1:5+7+0=12→w2,c1 ; d0:7+9+1=17→w7,c1 ; sum=1728 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,1) ; G=(4,5) | R:(0,2) ; R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) |
list_summation | list_summation:right-to-left | 4, 6, 9, 6 | 9+6=15 ; 6+15=21 ; 4+21=25 |
base_conversion | base_conversion:repeated-division | n=93,base=4 | DIV:93/4=23,r:1 ; DIV:23/4=5,r:3 ; DIV:5/4=1,r:1 ; DIV:1/4=0,r:1 ; OUT:1131 |
base_conversion | base_conversion:via-binary | n=215,base=4 | BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:3 ; OUT:3113 |
multidigit_addition | multidigit_addition:left-to-right-partials | 326+145 | p100:300+100=400 ; p10:20+40=60 ; p1:6+5=11 ; sum=400+60+11=471 |
base_conversion | base_conversion:via-binary | n=100,base=4 | BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:2 ; CHUNK:2:1 ; CHUNK:3:0 ; OUT:1210 |
sorting_algorithms | sorting_algorithms:insertion-sort | 2, 9, 0, 5, 4 | [2,9,0,5,4] ; [0,2,9,5,4] ; [0,2,5,9,4] ; [0,2,4,5,9] |
list_summation | list_summation:left-to-right | 5, 3, 0, 4 | 5+3=8 ; 8+0=8 ; 8+4=12 |
sorting_algorithms | sorting_algorithms:bubble-sort | 6, 5, 0, 7, 9 | [5,6,0,7,9] ; [5,0,6,7,9] ; [0,5,6,7,9] |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,3) ; G=(4,4) | D:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; R:(4,4) |
base_conversion | base_conversion:repeated-division | n=142,base=16 | DIV:142/16=8,r:14 ; DIV:8/16=0,r:8 ; OUT:8E |
base_conversion | base_conversion:repeated-division | n=213,base=8 | DIV:213/8=26,r:5 ; DIV:26/8=3,r:2 ; DIV:3/8=0,r:3 ; OUT:325 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 5x+15=-30 | 5x+15=-30 ; 5x=-45 ; x=-9 |
multidigit_addition | multidigit_addition:left-to-right-partials | 301+950 | p100:300+900=1200 ; p10:0+50=50 ; p1:1+0=1 ; sum=1200+50+1=1251 |
list_summation | list_summation:left-to-right | 3, 8, 2, 5 | 3+8=11 ; 11+2=13 ; 13+5=18 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,2) ; G=(5,5) | R:(4,3) ; R:(4,4) ; R:(4,5) ; D:(5,5) |
list_summation | list_summation:left-to-right | 9, 0, 2, 8 | 9+0=9 ; 9+2=11 ; 11+8=19 |
sorting_algorithms | sorting_algorithms:merge-sort | 5, 1, 4, 2, 9 | [1,5,4,2,9] ; [1,5,2,4,9] ; [1,2,4,5,9] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,3) ; G=(2,5) | R:(1,4) ; R:(1,5) ; D:(2,5) |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,1) ; G=(3,4) | D:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 7x+7=56 | 7x+7=56 ; 7x=49 ; x=7 |
base_conversion | base_conversion:repeated-division | n=212,base=8 | DIV:212/8=26,r:4 ; DIV:26/8=3,r:2 ; DIV:3/8=0,r:3 ; OUT:324 |
list_summation | list_summation:right-to-left | 2, 4, 7, 2 | 7+2=9 ; 4+9=13 ; 2+13=15 |
base_conversion | base_conversion:decomposition | n=101,base=8 | TERM:1*8^2=64 ; TERM:4*8^1=32 ; TERM:5*8^0=5 ; OUT:145 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,2) ; G=(5,3) | R:(4,3) ; D:(5,3) |
list_summation | list_summation:left-to-right | 3, 2, 2, 6 | 3+2=5 ; 5+2=7 ; 7+6=13 |
multidigit_addition | multidigit_addition:left-to-right-partials | 876+772 | p100:800+700=1500 ; p10:70+70=140 ; p1:6+2=8 ; sum=1500+140+8=1648 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 4x+8=36 | 4x+8=36 ; 4x=28 ; x=7 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,1) ; G=(5,5) | R:(1,2) ; R:(1,3) ; R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5) |
linear_equation_solving | linear_equation_solving:inverse-ops | 2x-4=12 | 2x-4=12 ; x=(12--4)/2 ; x=16/2 ; x=8 |
list_summation | list_summation:pairwise | 4, 9, 3, 4 | 4+9=13 ; 3+4=7 ; 13+7=20 |
list_summation | list_summation:right-to-left | 1, 0, 0, 5 | 0+5=5 ; 0+5=5 ; 1+5=6 |
sorting_algorithms | sorting_algorithms:merge-sort | 1, 6, 2, 0, 7 | [1,6,0,2,7] ; [0,1,2,6,7] |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 8x-16=-64 | 8x-16=-64 ; x+-2=-8 ; x=-8--2 ; x=-6 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,3) ; G=(2,5) | R:(1,4) ; D:(2,4) ; R:(2,5) |
multidigit_addition | multidigit_addition:rounding-decomposition | 691+783 | round:700+783=1483 ; adjust:1483-9=1474 ; sum=1474 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 3x-6=3 | 3x-6=3 ; x+-2=1 ; x=1--2 ; x=3 |
linear_equation_solving | linear_equation_solving:inverse-ops | 8x-16=40 | 8x-16=40 ; x=(40--16)/8 ; x=56/8 ; x=7 |
multidigit_addition | multidigit_addition:left-to-right-partials | 922+843 | p100:900+800=1700 ; p10:20+40=60 ; p1:2+3=5 ; sum=1700+60+5=1765 |
base_conversion | base_conversion:repeated-division | n=5,base=4 | DIV:5/4=1,r:1 ; DIV:1/4=0,r:1 ; OUT:11 |
sorting_algorithms | sorting_algorithms:selection-sort | 2, 9, 4, 8, 3 | [2,9,4,8,3] ; [2,3,4,8,9] ; [2,3,4,8,9] ; [2,3,4,8,9] |
sorting_algorithms | sorting_algorithms:merge-sort | 8, 6, 0, 4, 7 | [6,8,0,4,7] ; [0,4,6,8,7] ; [0,4,6,7,8] |
multidigit_addition | multidigit_addition:right-to-left-carry | 249+708 | d2:9+8+0=17→w7,c1 ; d1:4+0+1=5→w5,c0 ; d0:2+7+0=9→w9,c0 ; sum=957 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,3) ; G=(3,4) | R:(2,4) ; D:(3,4) |
multidigit_addition | multidigit_addition:left-to-right-partials | 241+361 | p100:200+300=500 ; p10:40+60=100 ; p1:1+1=2 ; sum=500+100+2=602 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,4) ; G=(3,5) | R:(2,5) ; D:(3,5) |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 4x+4=20 | 4x+4=20 ; x+1=5 ; x=5-1 ; x=4 |
sorting_algorithms | sorting_algorithms:heap-sort | 1, 7, 8, 0, 9 | [1,9,8,0,7] ; [9,1,8,0,7] ; [9,7,8,0,1] ; [1,7,8,0,9] ; [8,7,1,0,9] ; [0,7,1,8,9] ; [7,0,1,8,9] ; [1,0,7,8,9] ; [0,1,7,8,9] |
multidigit_addition | multidigit_addition:right-to-left-carry | 673+466 | d2:3+6+0=9→w9,c0 ; d1:7+6+0=13→w3,c1 ; d0:6+4+1=11→w1,c1 ; sum=1139 |
list_summation | list_summation:right-to-left | 0, 0, 7, 7 | 7+7=14 ; 0+14=14 ; 0+14=14 |
multidigit_addition | multidigit_addition:left-to-right-partials | 985+738 | p100:900+700=1600 ; p10:80+30=110 ; p1:5+8=13 ; sum=1600+110+13=1723 |
base_conversion | base_conversion:via-binary | n=116,base=8 | BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:6 ; CHUNK:2:4 ; OUT:164 |
sorting_algorithms | sorting_algorithms:heap-sort | 8, 6, 0, 2, 4 | [4,6,0,2,8] ; [6,4,0,2,8] ; [2,4,0,6,8] ; [4,2,0,6,8] ; [0,2,4,6,8] ; [2,0,4,6,8] ; [0,2,4,6,8] |
list_summation | list_summation:right-to-left | 7, 1, 1, 8 | 1+8=9 ; 1+9=10 ; 7+10=17 |
multidigit_addition | multidigit_addition:left-to-right-partials | 884+261 | p100:800+200=1000 ; p10:80+60=140 ; p1:4+1=5 ; sum=1000+140+5=1145 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,1) ; G=(3,3) | R:(2,2) ; D:(3,2) ; R:(3,3) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,1) ; G=(5,4) | R:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) |
base_conversion | base_conversion:repeated-division | n=25,base=4 | DIV:25/4=6,r:1 ; DIV:6/4=1,r:2 ; DIV:1/4=0,r:1 ; OUT:121 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 4x+24=48 | 4x+24=48 ; x+6=12 ; x=12-6 ; x=6 |
list_summation | list_summation:pairwise | 1, 6, 8, 9 | 1+6=7 ; 8+9=17 ; 7+17=24 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(2,0) ; G=(3,2) | D:(3,0) ; R:(3,1) ; R:(3,2) |
list_summation | list_summation:pairwise | 2, 7, 1, 3 | 2+7=9 ; 1+3=4 ; 9+4=13 |
linear_equation_solving | linear_equation_solving:inverse-ops | 9x-27=-27 | 9x-27=-27 ; x=(-27--27)/9 ; x=0/9 ; x=0 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(1,4) ; G=(4,5) | R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) |
base_conversion | base_conversion:repeated-division | n=108,base=2 | DIV:108/2=54,r:0 ; DIV:54/2=27,r:0 ; DIV:27/2=13,r:1 ; DIV:13/2=6,r:1 ; DIV:6/2=3,r:0 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:1101100 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,1) ; G=(5,3) | R:(4,2) ; D:(5,2) ; R:(5,3) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,3) ; G=(5,5) | R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(1,0) ; G=(2,3) | R:(1,1) ; R:(1,2) ; R:(1,3) ; D:(2,3) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(0,2) ; G=(1,5) | R:(0,3) ; D:(1,3) ; R:(1,4) ; R:(1,5) |
base_conversion | base_conversion:repeated-division | n=160,base=8 | DIV:160/8=20,r:0 ; DIV:20/8=2,r:4 ; DIV:2/8=0,r:2 ; OUT:240 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 5x-35=-55 | 5x-35=-55 ; x+-7=-11 ; x=-11--7 ; x=-4 |
list_summation | list_summation:left-to-right | 5, 8, 3, 5 | 5+8=13 ; 13+3=16 ; 16+5=21 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 3x-24=-24 | 3x-24=-24 ; 3x=0 ; x=0 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 8x+32=-40 | 8x+32=-40 ; 8x=-72 ; x=-9 |
sorting_algorithms | sorting_algorithms:insertion-sort | 2, 4, 1, 7, 0 | [2,4,1,7,0] ; [1,2,4,7,0] ; [1,2,4,7,0] ; [0,1,2,4,7] |
sorting_algorithms | sorting_algorithms:merge-sort | 4, 7, 1, 8, 5 | [1,4,7,8,5] ; [1,4,5,7,8] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.