task_name stringclasses 6
values | strategy_id stringclasses 20
values | input_text stringlengths 6 26 | reasoning_trace stringlengths 11 152 |
|---|---|---|---|
multidigit_addition | multidigit_addition:right-to-left-carry | 427+933 | d2:7+3+0=10→w0,c1 ; d1:2+3+1=6→w6,c0 ; d0:4+9+0=13→w3,c1 ; sum=1360 |
multidigit_addition | multidigit_addition:left-to-right-partials | 159+296 | p100:100+200=300 ; p10:50+90=140 ; p1:9+6=15 ; sum=300+140+15=455 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(4,4) ; G=(5,5) | D:(5,4) ; R:(5,5) |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(0,0) ; G=(1,5) | R:(0,1) ; R:(0,2) ; R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(4,4) ; G=(5,5) | R:(4,5) ; D:(5,5) |
sorting_algorithms | sorting_algorithms:bubble-sort | 6, 3, 4, 7, 9 | [3,6,4,7,9] ; [3,4,6,7,9] |
list_summation | list_summation:right-to-left | 3, 5, 2, 4 | 2+4=6 ; 5+6=11 ; 3+11=14 |
linear_equation_solving | linear_equation_solving:inverse-ops | 6x-24=-24 | 6x-24=-24 ; x=(-24--24)/6 ; x=0/6 ; x=0 |
base_conversion | base_conversion:via-binary | n=28,base=8 | BINLEN:5 ; CHUNK:0:3 ; CHUNK:1:4 ; OUT:34 |
linear_equation_solving | linear_equation_solving:inverse-ops | 8x+40=24 | 8x+40=24 ; x=(24-40)/8 ; x=-16/8 ; x=-2 |
multidigit_addition | multidigit_addition:right-to-left-carry | 182+134 | d2:2+4+0=6→w6,c0 ; d1:8+3+0=11→w1,c1 ; d0:1+1+1=3→w3,c0 ; sum=316 |
base_conversion | base_conversion:repeated-division | n=184,base=8 | DIV:184/8=23,r:0 ; DIV:23/8=2,r:7 ; DIV:2/8=0,r:2 ; OUT:270 |
sorting_algorithms | sorting_algorithms:bubble-sort | 8, 6, 1, 2, 7 | [6,8,1,2,7] ; [6,1,8,2,7] ; [6,1,2,8,7] ; [6,1,2,7,8] ; [1,6,2,7,8] ; [1,2,6,7,8] |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,1) ; G=(5,2) | R:(3,2) ; D:(4,2) ; D:(5,2) |
base_conversion | base_conversion:repeated-division | n=200,base=4 | DIV:200/4=50,r:0 ; DIV:50/4=12,r:2 ; DIV:12/4=3,r:0 ; DIV:3/4=0,r:3 ; OUT:3020 |
multidigit_addition | multidigit_addition:right-to-left-carry | 453+693 | d2:3+3+0=6→w6,c0 ; d1:5+9+0=14→w4,c1 ; d0:4+6+1=11→w1,c1 ; sum=1146 |
sorting_algorithms | sorting_algorithms:merge-sort | 3, 5, 4, 1, 8 | [3,5,1,4,8] ; [1,3,4,5,8] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,3) ; G=(4,4) | R:(2,4) ; D:(3,4) ; D:(4,4) |
base_conversion | base_conversion:repeated-division | n=228,base=2 | DIV:228/2=114,r:0 ; DIV:114/2=57,r:0 ; DIV:57/2=28,r:1 ; DIV:28/2=14,r:0 ; DIV:14/2=7,r:0 ; DIV:7/2=3,r:1 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11100100 |
sorting_algorithms | sorting_algorithms:merge-sort | 1, 4, 9, 5, 7 | [1,4,5,9,7] ; [1,4,5,7,9] |
sorting_algorithms | sorting_algorithms:selection-sort | 6, 3, 1, 4, 8 | [1,3,6,4,8] ; [1,3,6,4,8] ; [1,3,4,6,8] ; [1,3,4,6,8] |
list_summation | list_summation:left-to-right | 8, 4, 8, 4 | 8+4=12 ; 12+8=20 ; 20+4=24 |
sorting_algorithms | sorting_algorithms:insertion-sort | 6, 7, 9, 1, 4 | [6,7,9,1,4] ; [6,7,9,1,4] ; [1,6,7,9,4] ; [1,4,6,7,9] |
base_conversion | base_conversion:repeated-division | n=111,base=8 | DIV:111/8=13,r:7 ; DIV:13/8=1,r:5 ; DIV:1/8=0,r:1 ; OUT:157 |
list_summation | list_summation:left-to-right | 2, 1, 6, 7 | 2+1=3 ; 3+6=9 ; 9+7=16 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(0,4) ; G=(4,5) | D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; R:(4,5) |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,3) ; G=(4,5) | D:(4,3) ; R:(4,4) ; R:(4,5) |
linear_equation_solving | linear_equation_solving:inverse-ops | 8x+48=40 | 8x+48=40 ; x=(40-48)/8 ; x=-8/8 ; x=-1 |
sorting_algorithms | sorting_algorithms:heap-sort | 2, 4, 9, 1, 5 | [2,5,9,1,4] ; [9,5,2,1,4] ; [4,5,2,1,9] ; [5,4,2,1,9] ; [1,4,2,5,9] ; [4,1,2,5,9] ; [2,1,4,5,9] ; [1,2,4,5,9] |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 7x-49=-35 | 7x-49=-35 ; x+-7=-5 ; x=-5--7 ; x=2 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 7x-49=-77 | 7x-49=-77 ; x+-7=-11 ; x=-11--7 ; x=-4 |
list_summation | list_summation:pairwise | 1, 0, 5, 1 | 1+0=1 ; 5+1=6 ; 1+6=7 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,2) ; G=(5,4) | R:(2,3) ; D:(3,3) ; R:(3,4) ; D:(4,4) ; D:(5,4) |
base_conversion | base_conversion:via-binary | n=190,base=8 | BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:7 ; CHUNK:2:6 ; OUT:276 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 6x+24=24 | 6x+24=24 ; x+4=4 ; x=4-4 ; x=0 |
sorting_algorithms | sorting_algorithms:bubble-sort | 2, 1, 8, 0, 5 | [1,2,8,0,5] ; [1,2,0,8,5] ; [1,2,0,5,8] ; [1,0,2,5,8] ; [0,1,2,5,8] |
list_summation | list_summation:left-to-right | 5, 1, 1, 5 | 5+1=6 ; 6+1=7 ; 7+5=12 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(4,0) ; G=(5,5) | R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5) ; D:(5,5) |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,0) ; G=(4,4) | R:(2,1) ; D:(3,1) ; R:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4) |
sorting_algorithms | sorting_algorithms:bubble-sort | 3, 7, 4, 1, 6 | [3,4,7,1,6] ; [3,4,1,7,6] ; [3,4,1,6,7] ; [3,1,4,6,7] ; [1,3,4,6,7] |
base_conversion | base_conversion:repeated-division | n=239,base=16 | DIV:239/16=14,r:15 ; DIV:14/16=0,r:14 ; OUT:EF |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 6x+48=90 | 6x+48=90 ; x+8=15 ; x=15-8 ; x=7 |
base_conversion | base_conversion:repeated-division | n=40,base=2 | DIV:40/2=20,r:0 ; DIV:20/2=10,r:0 ; DIV:10/2=5,r:0 ; DIV:5/2=2,r:1 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:101000 |
multidigit_addition | multidigit_addition:right-to-left-carry | 890+682 | d2:0+2+0=2→w2,c0 ; d1:9+8+0=17→w7,c1 ; d0:8+6+1=15→w5,c1 ; sum=1572 |
multidigit_addition | multidigit_addition:rounding-decomposition | 160+527 | round:160+527=687 ; adjust:687-0=687 ; sum=687 |
list_summation | list_summation:pairwise | 3, 4, 1, 6 | 3+4=7 ; 1+6=7 ; 7+7=14 |
sorting_algorithms | sorting_algorithms:bubble-sort | 6, 5, 2, 9, 1 | [5,6,2,9,1] ; [5,2,6,9,1] ; [5,2,6,1,9] ; [2,5,6,1,9] ; [2,5,1,6,9] ; [2,1,5,6,9] ; [1,2,5,6,9] |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 2x-4=-18 | 2x-4=-18 ; 2x=-14 ; x=-7 |
list_summation | list_summation:right-to-left | 5, 0, 7, 1 | 7+1=8 ; 0+8=8 ; 5+8=13 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 6x+12=-6 | 6x+12=-6 ; x+2=-1 ; x=-1-2 ; x=-3 |
multidigit_addition | multidigit_addition:rounding-decomposition | 302+453 | round:310+453=763 ; adjust:763-8=755 ; sum=755 |
base_conversion | base_conversion:repeated-division | n=23,base=8 | DIV:23/8=2,r:7 ; DIV:2/8=0,r:2 ; OUT:27 |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(2,4) ; G=(4,5) | R:(2,5) ; D:(3,5) ; D:(4,5) |
multidigit_addition | multidigit_addition:right-to-left-carry | 709+936 | d2:9+6+0=15→w5,c1 ; d1:0+3+1=4→w4,c0 ; d0:7+9+0=16→w6,c1 ; sum=1645 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 3x-18=-45 | 3x-18=-45 ; x+-6=-15 ; x=-15--6 ; x=-9 |
linear_equation_solving | linear_equation_solving:subtract-then-divide | 2x+16=18 | 2x+16=18 ; 2x=2 ; x=1 |
sorting_algorithms | sorting_algorithms:bubble-sort | 2, 5, 1, 4, 0 | [2,1,5,4,0] ; [2,1,4,5,0] ; [2,1,4,0,5] ; [1,2,4,0,5] ; [1,2,0,4,5] ; [1,0,2,4,5] ; [0,1,2,4,5] |
multidigit_addition | multidigit_addition:rounding-decomposition | 119+517 | round:120+517=637 ; adjust:637-1=636 ; sum=636 |
multidigit_addition | multidigit_addition:right-to-left-carry | 697+789 | d2:7+9+0=16→w6,c1 ; d1:9+8+1=18→w8,c1 ; d0:6+7+1=14→w4,c1 ; sum=1486 |
sorting_algorithms | sorting_algorithms:heap-sort | 6, 8, 9, 1, 4 | [9,8,6,1,4] ; [4,8,6,1,9] ; [8,4,6,1,9] ; [1,4,6,8,9] ; [6,4,1,8,9] ; [1,4,6,8,9] ; [4,1,6,8,9] ; [1,4,6,8,9] |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(1,0) ; G=(2,4) | D:(2,0) ; R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 8x+48=16 | 8x+48=16 ; x+6=2 ; x=2-6 ; x=-4 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,3) ; G=(5,4) | R:(3,4) ; D:(4,4) ; D:(5,4) |
sorting_algorithms | sorting_algorithms:insertion-sort | 2, 9, 1, 0, 5 | [2,9,1,0,5] ; [1,2,9,0,5] ; [0,1,2,9,5] ; [0,1,2,5,9] |
sorting_algorithms | sorting_algorithms:insertion-sort | 1, 5, 2, 8, 7 | [1,5,2,8,7] ; [1,2,5,8,7] ; [1,2,5,8,7] ; [1,2,5,7,8] |
sorting_algorithms | sorting_algorithms:merge-sort | 7, 4, 6, 9, 1 | [4,7,6,9,1] ; [4,6,7,9,1] ; [1,4,6,7,9] |
base_conversion | base_conversion:decomposition | n=87,base=2 | TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:1010111 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(0,3) ; G=(1,4) | R:(0,4) ; D:(1,4) |
list_summation | list_summation:pairwise | 1, 7, 7, 7 | 1+7=8 ; 7+7=14 ; 8+14=22 |
multidigit_addition | multidigit_addition:rounding-decomposition | 165+265 | round:170+265=435 ; adjust:435-5=430 ; sum=430 |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(3,3) ; G=(5,4) | R:(3,4) ; D:(4,4) ; D:(5,4) |
sorting_algorithms | sorting_algorithms:merge-sort | 8, 6, 1, 5, 9 | [6,8,1,5,9] ; [1,5,6,8,9] |
sorting_algorithms | sorting_algorithms:merge-sort | 6, 2, 4, 9, 7 | [2,6,4,9,7] ; [2,4,6,9,7] ; [2,4,6,7,9] |
linear_equation_solving | linear_equation_solving:inverse-ops | 9x+0=9 | 9x+0=9 ; x=(9-0)/9 ; x=9/9 ; x=1 |
grid_pathfinding | grid_pathfinding:down-first | grid=6 ; S=(3,0) ; G=(5,5) | D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5) |
multidigit_addition | multidigit_addition:rounding-decomposition | 168+774 | round:170+774=944 ; adjust:944-2=942 ; sum=942 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 5x-30=-35 | 5x-30=-35 ; x+-6=-7 ; x=-7--6 ; x=-1 |
sorting_algorithms | sorting_algorithms:insertion-sort | 2, 6, 0, 1, 7 | [2,6,0,1,7] ; [0,2,6,1,7] ; [0,1,2,6,7] ; [0,1,2,6,7] |
grid_pathfinding | grid_pathfinding:right-first | grid=6 ; S=(3,0) ; G=(5,3) | R:(3,1) ; R:(3,2) ; R:(3,3) ; D:(4,3) ; D:(5,3) |
base_conversion | base_conversion:decomposition | n=57,base=4 | TERM:3*4^2=48 ; TERM:2*4^1=8 ; TERM:1*4^0=1 ; OUT:321 |
list_summation | list_summation:left-to-right | 2, 2, 8, 6 | 2+2=4 ; 4+8=12 ; 12+6=18 |
sorting_algorithms | sorting_algorithms:heap-sort | 9, 6, 8, 4, 1 | [1,6,8,4,9] ; [8,6,1,4,9] ; [4,6,1,8,9] ; [6,4,1,8,9] ; [1,4,6,8,9] ; [4,1,6,8,9] ; [1,4,6,8,9] |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 5x-30=-75 | 5x-30=-75 ; x+-6=-15 ; x=-15--6 ; x=-9 |
sorting_algorithms | sorting_algorithms:heap-sort | 2, 6, 4, 9, 7 | [2,9,4,6,7] ; [9,2,4,6,7] ; [9,7,4,6,2] ; [2,7,4,6,9] ; [7,2,4,6,9] ; [7,6,4,2,9] ; [2,6,4,7,9] ; [6,2,4,7,9] ; [4,2,6,7,9] ; [2,4,6,7,9] |
multidigit_addition | multidigit_addition:right-to-left-carry | 844+188 | d2:4+8+0=12→w2,c1 ; d1:4+8+1=13→w3,c1 ; d0:8+1+1=10→w0,c1 ; sum=1032 |
base_conversion | base_conversion:repeated-division | n=166,base=4 | DIV:166/4=41,r:2 ; DIV:41/4=10,r:1 ; DIV:10/4=2,r:2 ; DIV:2/4=0,r:2 ; OUT:2212 |
list_summation | list_summation:pairwise | 2, 2, 5, 7 | 2+2=4 ; 5+7=12 ; 4+12=16 |
multidigit_addition | multidigit_addition:rounding-decomposition | 667+993 | round:670+993=1663 ; adjust:1663-3=1660 ; sum=1660 |
linear_equation_solving | linear_equation_solving:divide-then-subtract | 5x+30=50 | 5x+30=50 ; x+6=10 ; x=10-6 ; x=4 |
list_summation | list_summation:right-to-left | 2, 9, 8, 5 | 8+5=13 ; 9+13=22 ; 2+22=24 |
list_summation | list_summation:left-to-right | 1, 0, 1, 3 | 1+0=1 ; 1+1=2 ; 2+3=5 |
base_conversion | base_conversion:decomposition | n=50,base=2 | TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:110010 |
sorting_algorithms | sorting_algorithms:merge-sort | 1, 8, 2, 5, 9 | [1,2,5,8,9] |
sorting_algorithms | sorting_algorithms:heap-sort | 4, 9, 6, 7, 8 | [9,4,6,7,8] ; [9,8,6,7,4] ; [4,8,6,7,9] ; [8,4,6,7,9] ; [8,7,6,4,9] ; [4,7,6,8,9] ; [7,4,6,8,9] ; [6,4,7,8,9] ; [4,6,7,8,9] |
grid_pathfinding | grid_pathfinding:alternating | grid=6 ; S=(2,4) ; G=(5,5) | R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5) |
list_summation | list_summation:pairwise | 0, 6, 4, 9 | 0+6=6 ; 4+9=13 ; 6+13=19 |
list_summation | list_summation:right-to-left | 4, 1, 2, 6 | 2+6=8 ; 1+8=9 ; 4+9=13 |
base_conversion | base_conversion:via-binary | n=224,base=2 | BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:0 ; OUT:11100000 |
list_summation | list_summation:left-to-right | 4, 9, 0, 8 | 4+9=13 ; 13+0=13 ; 13+8=21 |
list_summation | list_summation:left-to-right | 3, 2, 3, 0 | 3+2=5 ; 5+3=8 ; 8+0=8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.