Datasets:
awni00
/
multi-strategy-algorithmic-tasks

Dataset card Data Studio Files
xet
 Community
1
task_name
stringclasses
6 values
strategy_id
stringclasses
20 values
input_text
stringlengths
6
26
reasoning_trace
stringlengths
11
152
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(4,5)
R:(3,4) ; R:(3,5) ; D:(4,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
list_summation
list_summation:pairwise
3, 2, 7, 9
3+2=5 ; 7+9=16 ; 5+16=21
base_conversion
base_conversion:repeated-division
n=4,base=4
DIV:4/4=1,r:0 ; DIV:1/4=0,r:1 ; OUT:10
sorting_algorithms
sorting_algorithms:selection-sort
0, 7, 1, 6, 5
[0,7,1,6,5] ; [0,1,7,6,5] ; [0,1,5,6,7] ; [0,1,5,6,7]
sorting_algorithms
sorting_algorithms:merge-sort
0, 3, 1, 5, 7
[0,1,3,5,7]
base_conversion
base_conversion:repeated-division
n=210,base=8
DIV:210/8=26,r:2 ; DIV:26/8=3,r:2 ; DIV:3/8=0,r:3 ; OUT:322
sorting_algorithms
sorting_algorithms:insertion-sort
7, 5, 1, 8, 4
[5,7,1,8,4] ; [1,5,7,8,4] ; [1,5,7,8,4] ; [1,4,5,7,8]
multidigit_addition
multidigit_addition:right-to-left-carry
517+248
d2:7+8+0=15→w5,c1 ; d1:1+4+1=6→w6,c0 ; d0:5+2+0=7→w7,c0 ; sum=765
list_summation
list_summation:right-to-left
1, 1, 5, 6
5+6=11 ; 1+11=12 ; 1+12=13
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(5,5)
D:(4,4) ; D:(5,4) ; R:(5,5)
linear_equation_solving
linear_equation_solving:inverse-ops
5x+15=-10
5x+15=-10 ; x=(-10-15)/5 ; x=-25/5 ; x=-5
list_summation
list_summation:pairwise
2, 8, 4, 7
2+8=10 ; 4+7=11 ; 10+11=21
linear_equation_solving
linear_equation_solving:inverse-ops
3x+12=27
3x+12=27 ; x=(27-12)/3 ; x=15/3 ; x=5
base_conversion
base_conversion:decomposition
n=183,base=16
TERM:11*16^1=176 ; TERM:7*16^0=7 ; OUT:B7
linear_equation_solving
linear_equation_solving:inverse-ops
3x+9=15
3x+9=15 ; x=(15-9)/3 ; x=6/3 ; x=2
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,0) ; G=(3,5)
R:(0,1) ; R:(0,2) ; R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-42=-24
6x-42=-24 ; 6x=18 ; x=3
base_conversion
base_conversion:repeated-division
n=54,base=8
DIV:54/8=6,r:6 ; DIV:6/8=0,r:6 ; OUT:66
sorting_algorithms
sorting_algorithms:bubble-sort
4, 5, 1, 2, 6
[4,1,5,2,6] ; [4,1,2,5,6] ; [1,4,2,5,6] ; [1,2,4,5,6]
sorting_algorithms
sorting_algorithms:heap-sort
9, 7, 6, 0, 8
[9,8,6,0,7] ; [7,8,6,0,9] ; [8,7,6,0,9] ; [0,7,6,8,9] ; [7,0,6,8,9] ; [6,0,7,8,9] ; [0,6,7,8,9]
base_conversion
base_conversion:repeated-division
n=240,base=4
DIV:240/4=60,r:0 ; DIV:60/4=15,r:0 ; DIV:15/4=3,r:3 ; DIV:3/4=0,r:3 ; OUT:3300
linear_equation_solving
linear_equation_solving:inverse-ops
8x+24=-40
8x+24=-40 ; x=(-40-24)/8 ; x=-64/8 ; x=-8
base_conversion
base_conversion:repeated-division
n=112,base=4
DIV:112/4=28,r:0 ; DIV:28/4=7,r:0 ; DIV:7/4=1,r:3 ; DIV:1/4=0,r:1 ; OUT:1300
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,0) ; G=(5,3)
R:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,0) ; G=(4,2)
D:(3,0) ; D:(4,0) ; R:(4,1) ; R:(4,2)
linear_equation_solving
linear_equation_solving:inverse-ops
5x-15=-35
5x-15=-35 ; x=(-35--15)/5 ; x=-20/5 ; x=-4
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,3) ; G=(1,4)
R:(0,4) ; D:(1,4)
base_conversion
base_conversion:decomposition
n=22,base=8
TERM:2*8^1=16 ; TERM:6*8^0=6 ; OUT:26
linear_equation_solving
linear_equation_solving:inverse-ops
2x+4=-8
2x+4=-8 ; x=(-8-4)/2 ; x=-12/2 ; x=-6
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,2) ; G=(5,4)
R:(4,3) ; R:(4,4) ; D:(5,4)
linear_equation_solving
linear_equation_solving:inverse-ops
5x-40=-25
5x-40=-25 ; x=(-25--40)/5 ; x=15/5 ; x=3
list_summation
list_summation:left-to-right
4, 9, 7, 4
4+9=13 ; 13+7=20 ; 20+4=24
multidigit_addition
multidigit_addition:right-to-left-carry
964+831
d2:4+1+0=5→w5,c0 ; d1:6+3+0=9→w9,c0 ; d0:9+8+0=17→w7,c1 ; sum=1795
multidigit_addition
multidigit_addition:left-to-right-partials
812+184
p100:800+100=900 ; p10:10+80=90 ; p1:2+4=6 ; sum=900+90+6=996
multidigit_addition
multidigit_addition:right-to-left-carry
281+960
d2:1+0+0=1→w1,c0 ; d1:8+6+0=14→w4,c1 ; d0:2+9+1=12→w2,c1 ; sum=1241
list_summation
list_summation:left-to-right
4, 6, 2, 6
4+6=10 ; 10+2=12 ; 12+6=18
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; D:(5,4) ; R:(5,5)
multidigit_addition
multidigit_addition:rounding-decomposition
821+299
round:830+299=1129 ; adjust:1129-9=1120 ; sum=1120
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+63=0
7x+63=0 ; 7x=-63 ; x=-9
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,2) ; G=(5,3)
R:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3)
base_conversion
base_conversion:via-binary
n=33,base=2
BINLEN:6 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:1 ; OUT:100001
multidigit_addition
multidigit_addition:left-to-right-partials
291+408
p100:200+400=600 ; p10:90+0=90 ; p1:1+8=9 ; sum=600+90+9=699
sorting_algorithms
sorting_algorithms:merge-sort
5, 3, 4, 6, 7
[3,5,4,6,7] ; [3,4,5,6,7]
multidigit_addition
multidigit_addition:right-to-left-carry
741+749
d2:1+9+0=10→w0,c1 ; d1:4+4+1=9→w9,c0 ; d0:7+7+0=14→w4,c1 ; sum=1490
sorting_algorithms
sorting_algorithms:insertion-sort
6, 4, 1, 2, 9
[4,6,1,2,9] ; [1,4,6,2,9] ; [1,2,4,6,9] ; [1,2,4,6,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,4)
D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4)
multidigit_addition
multidigit_addition:left-to-right-partials
130+815
p100:100+800=900 ; p10:30+10=40 ; p1:0+5=5 ; sum=900+40+5=945
base_conversion
base_conversion:via-binary
n=64,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:0 ; CHUNK:6:0 ; OUT:1000000
sorting_algorithms
sorting_algorithms:selection-sort
9, 1, 3, 8, 5
[1,9,3,8,5] ; [1,3,9,8,5] ; [1,3,5,8,9] ; [1,3,5,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
311+521
d2:1+1+0=2→w2,c0 ; d1:1+2+0=3→w3,c0 ; d0:3+5+0=8→w8,c0 ; sum=832
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,0) ; G=(5,2)
R:(4,1) ; D:(5,1) ; R:(5,2)
multidigit_addition
multidigit_addition:right-to-left-carry
313+403
d2:3+3+0=6→w6,c0 ; d1:1+0+0=1→w1,c0 ; d0:3+4+0=7→w7,c0 ; sum=716
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,4) ; G=(2,5)
R:(1,5) ; D:(2,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,0) ; G=(5,3)
R:(4,1) ; R:(4,2) ; R:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(5,3)
R:(0,2) ; D:(1,2) ; R:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3)
sorting_algorithms
sorting_algorithms:heap-sort
5, 3, 6, 1, 2
[6,3,5,1,2] ; [2,3,5,1,6] ; [5,3,2,1,6] ; [1,3,2,5,6] ; [3,1,2,5,6] ; [2,1,3,5,6] ; [1,2,3,5,6]
sorting_algorithms
sorting_algorithms:merge-sort
1, 7, 5, 4, 6
[1,7,4,5,6] ; [1,4,5,7,6] ; [1,4,5,6,7]
multidigit_addition
multidigit_addition:left-to-right-partials
179+828
p100:100+800=900 ; p10:70+20=90 ; p1:9+8=17 ; sum=900+90+17=1007
list_summation
list_summation:left-to-right
7, 6, 8, 3
7+6=13 ; 13+8=21 ; 21+3=24
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,2) ; G=(3,5)
R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5)
list_summation
list_summation:pairwise
3, 8, 4, 5
3+8=11 ; 4+5=9 ; 11+9=20
base_conversion
base_conversion:decomposition
n=48,base=8
TERM:6*8^1=48 ; TERM:0*8^0=0 ; OUT:60
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+4=14
2x+4=14 ; 2x=10 ; x=5
base_conversion
base_conversion:repeated-division
n=152,base=16
DIV:152/16=9,r:8 ; DIV:9/16=0,r:9 ; OUT:98
linear_equation_solving
linear_equation_solving:inverse-ops
7x-35=-28
7x-35=-28 ; x=(-28--35)/7 ; x=7/7 ; x=1
list_summation
list_summation:left-to-right
3, 7, 2, 1
3+7=10 ; 10+2=12 ; 12+1=13
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,4) ; G=(4,5)
D:(2,4) ; D:(3,4) ; D:(4,4) ; R:(4,5)
sorting_algorithms
sorting_algorithms:merge-sort
8, 0, 1, 7, 2
[0,8,1,7,2] ; [0,1,7,8,2] ; [0,1,2,7,8]
base_conversion
base_conversion:decomposition
n=109,base=4
TERM:1*4^3=64 ; TERM:2*4^2=32 ; TERM:3*4^1=12 ; TERM:1*4^0=1 ; OUT:1231
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)
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+12=36
3x+12=36 ; 3x=24 ; x=8
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
list_summation
list_summation:right-to-left
5, 6, 1, 0
1+0=1 ; 6+1=7 ; 5+7=12
multidigit_addition
multidigit_addition:rounding-decomposition
306+710
round:310+710=1020 ; adjust:1020-4=1016 ; sum=1016
sorting_algorithms
sorting_algorithms:heap-sort
8, 3, 5, 0, 2
[2,3,5,0,8] ; [5,3,2,0,8] ; [0,3,2,5,8] ; [3,0,2,5,8] ; [2,0,3,5,8] ; [0,2,3,5,8]
sorting_algorithms
sorting_algorithms:selection-sort
4, 8, 9, 6, 3
[3,8,9,6,4] ; [3,4,9,6,8] ; [3,4,6,9,8] ; [3,4,6,8,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; R:(4,5) ; D:(5,5)
base_conversion
base_conversion:repeated-division
n=166,base=16
DIV:166/16=10,r:6 ; DIV:10/16=0,r:10 ; OUT:A6
sorting_algorithms
sorting_algorithms:bubble-sort
0, 3, 9, 6, 5
[0,3,6,9,5] ; [0,3,6,5,9] ; [0,3,5,6,9]
base_conversion
base_conversion:decomposition
n=62,base=2
TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:111110
list_summation
list_summation:left-to-right
7, 3, 0, 2
7+3=10 ; 10+0=10 ; 10+2=12
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
list_summation
list_summation:left-to-right
6, 2, 6, 3
6+2=8 ; 8+6=14 ; 14+3=17
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+21=56
7x+21=56 ; 7x=35 ; x=5
base_conversion
base_conversion:decomposition
n=187,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:10111011
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+36=78
6x+36=78 ; x+6=13 ; x=13-6 ; x=7
multidigit_addition
multidigit_addition:left-to-right-partials
880+427
p100:800+400=1200 ; p10:80+20=100 ; p1:0+7=7 ; sum=1200+100+7=1307
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+3=24
3x+3=24 ; x+1=8 ; x=8-1 ; x=7
list_summation
list_summation:right-to-left
5, 5, 7, 2
7+2=9 ; 5+9=14 ; 5+14=19
base_conversion
base_conversion:repeated-division
n=175,base=4
DIV:175/4=43,r:3 ; DIV:43/4=10,r:3 ; DIV:10/4=2,r:2 ; DIV:2/4=0,r:2 ; OUT:2233
multidigit_addition
multidigit_addition:right-to-left-carry
278+617
d2:8+7+0=15→w5,c1 ; d1:7+1+1=9→w9,c0 ; d0:2+6+0=8→w8,c0 ; sum=895
sorting_algorithms
sorting_algorithms:heap-sort
7, 4, 1, 8, 0
[7,8,1,4,0] ; [8,7,1,4,0] ; [0,7,1,4,8] ; [7,0,1,4,8] ; [7,4,1,0,8] ; [0,4,1,7,8] ; [4,0,1,7,8] ; [1,0,4,7,8] ; [0,1,4,7,8]
list_summation
list_summation:pairwise
5, 7, 2, 4
5+7=12 ; 2+4=6 ; 12+6=18
sorting_algorithms
sorting_algorithms:insertion-sort
3, 9, 5, 7, 6
[3,9,5,7,6] ; [3,5,9,7,6] ; [3,5,7,9,6] ; [3,5,6,7,9]
base_conversion
base_conversion:repeated-division
n=139,base=16
DIV:139/16=8,r:11 ; DIV:8/16=0,r:8 ; OUT:8B
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-30=-75
5x-30=-75 ; x+-6=-15 ; x=-15--6 ; x=-9
list_summation
list_summation:right-to-left
8, 4, 7, 0
7+0=7 ; 4+7=11 ; 8+11=19
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,2) ; G=(4,3)
D:(4,2) ; R:(4,3)
multidigit_addition
multidigit_addition:rounding-decomposition
419+930
round:420+930=1350 ; adjust:1350-1=1349 ; sum=1349