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
list_summation
list_summation:pairwise
0, 6, 4, 5
0+6=6 ; 4+5=9 ; 6+9=15
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(4,5)
R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5) ; D:(4,5)
multidigit_addition
multidigit_addition:left-to-right-partials
500+827
p100:500+800=1300 ; p10:0+20=20 ; p1:0+7=7 ; sum=1300+20+7=1327
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,4) ; G=(3,5)
D:(2,4) ; D:(3,4) ; R:(3,5)
sorting_algorithms
sorting_algorithms:merge-sort
4, 5, 8, 3, 0
[4,5,3,8,0] ; [3,4,5,8,0] ; [0,3,4,5,8]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:inverse-ops
4x-24=-44
4x-24=-44 ; x=(-44--24)/4 ; x=-20/4 ; x=-5
multidigit_addition
multidigit_addition:right-to-left-carry
380+962
d2:0+2+0=2→w2,c0 ; d1:8+6+0=14→w4,c1 ; d0:3+9+1=13→w3,c1 ; sum=1342
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,1) ; G=(5,5)
R:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5) ; D:(5,5)
base_conversion
base_conversion:via-binary
n=129,base=16
BINLEN:8 ; CHUNK:0:8 ; CHUNK:1:1 ; OUT:81
sorting_algorithms
sorting_algorithms:merge-sort
2, 7, 9, 5, 1
[2,7,5,9,1] ; [2,5,7,9,1] ; [1,2,5,7,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,1) ; G=(5,5)
R:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,3) ; G=(2,5)
D:(1,3) ; D:(2,3) ; R:(2,4) ; R:(2,5)
list_summation
list_summation:left-to-right
5, 6, 6, 0
5+6=11 ; 11+6=17 ; 17+0=17
multidigit_addition
multidigit_addition:right-to-left-carry
109+208
d2:9+8+0=17→w7,c1 ; d1:0+0+1=1→w1,c0 ; d0:1+2+0=3→w3,c0 ; sum=317
multidigit_addition
multidigit_addition:left-to-right-partials
801+335
p100:800+300=1100 ; p10:0+30=30 ; p1:1+5=6 ; sum=1100+30+6=1136
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+10=35
5x+10=35 ; 5x=25 ; x=5
base_conversion
base_conversion:decomposition
n=88,base=2
TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:0*2^1=0 ; TERM:0*2^0=0 ; OUT:1011000
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,3) ; G=(4,4)
R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4)
multidigit_addition
multidigit_addition:right-to-left-carry
201+802
d2:1+2+0=3→w3,c0 ; d1:0+0+0=0→w0,c0 ; d0:2+8+0=10→w0,c1 ; sum=1003
base_conversion
base_conversion:decomposition
n=211,base=8
TERM:3*8^2=192 ; TERM:2*8^1=16 ; TERM:3*8^0=3 ; OUT:323
multidigit_addition
multidigit_addition:rounding-decomposition
460+445
round:460+445=905 ; adjust:905-0=905 ; sum=905
linear_equation_solving
linear_equation_solving:inverse-ops
7x-28=28
7x-28=28 ; x=(28--28)/7 ; x=56/7 ; x=8
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,2) ; G=(5,5)
D:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+0=-12
4x+0=-12 ; 4x=-12 ; x=-3
linear_equation_solving
linear_equation_solving:inverse-ops
8x+24=72
8x+24=72 ; x=(72-24)/8 ; x=48/8 ; x=6
sorting_algorithms
sorting_algorithms:bubble-sort
5, 3, 7, 9, 8
[3,5,7,9,8] ; [3,5,7,8,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+20=25
5x+20=25 ; x+4=5 ; x=5-4 ; x=1
sorting_algorithms
sorting_algorithms:selection-sort
2, 7, 4, 0, 5
[0,7,4,2,5] ; [0,2,4,7,5] ; [0,2,4,7,5] ; [0,2,4,5,7]
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-28=-28
7x-28=-28 ; 7x=0 ; x=0
base_conversion
base_conversion:repeated-division
n=45,base=4
DIV:45/4=11,r:1 ; DIV:11/4=2,r:3 ; DIV:2/4=0,r:2 ; OUT:231
sorting_algorithms
sorting_algorithms:insertion-sort
0, 2, 7, 5, 3
[0,2,7,5,3] ; [0,2,7,5,3] ; [0,2,5,7,3] ; [0,2,3,5,7]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,4) ; G=(4,5)
R:(3,5) ; D:(4,5)
sorting_algorithms
sorting_algorithms:merge-sort
6, 0, 9, 4, 3
[0,6,9,4,3] ; [0,6,4,9,3] ; [0,4,6,9,3] ; [0,3,4,6,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-25=10
5x-25=10 ; x+-5=2 ; x=2--5 ; x=7
base_conversion
base_conversion:repeated-division
n=218,base=8
DIV:218/8=27,r:2 ; DIV:27/8=3,r:3 ; DIV:3/8=0,r:3 ; OUT:332
base_conversion
base_conversion:decomposition
n=208,base=4
TERM:3*4^3=192 ; TERM:1*4^2=16 ; TERM:0*4^1=0 ; TERM:0*4^0=0 ; OUT:3100
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:subtract-then-divide
7x+21=-21
7x+21=-21 ; 7x=-42 ; x=-6
multidigit_addition
multidigit_addition:rounding-decomposition
683+129
round:690+129=819 ; adjust:819-7=812 ; sum=812
list_summation
list_summation:pairwise
4, 4, 1, 5
4+4=8 ; 1+5=6 ; 8+6=14
base_conversion
base_conversion:repeated-division
n=214,base=16
DIV:214/16=13,r:6 ; DIV:13/16=0,r:13 ; OUT:D6
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,1) ; G=(4,5)
D:(1,1) ; D:(2,1) ; D:(3,1) ; D:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-6=-48
6x-6=-48 ; x+-1=-8 ; x=-8--1 ; x=-7
multidigit_addition
multidigit_addition:right-to-left-carry
520+265
d2:0+5+0=5→w5,c0 ; d1:2+6+0=8→w8,c0 ; d0:5+2+0=7→w7,c0 ; sum=785
list_summation
list_summation:left-to-right
9, 4, 9, 9
9+4=13 ; 13+9=22 ; 22+9=31
multidigit_addition
multidigit_addition:rounding-decomposition
648+708
round:650+708=1358 ; adjust:1358-2=1356 ; sum=1356
multidigit_addition
multidigit_addition:right-to-left-carry
940+472
d2:0+2+0=2→w2,c0 ; d1:4+7+0=11→w1,c1 ; d0:9+4+1=14→w4,c1 ; sum=1412
base_conversion
base_conversion:decomposition
n=65,base=2
TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:0*2^1=0 ; TERM:1*2^0=1 ; OUT:1000001
sorting_algorithms
sorting_algorithms:heap-sort
5, 6, 8, 1, 3
[8,6,5,1,3] ; [3,6,5,1,8] ; [6,3,5,1,8] ; [1,3,5,6,8] ; [5,3,1,6,8] ; [1,3,5,6,8] ; [3,1,5,6,8] ; [1,3,5,6,8]
sorting_algorithms
sorting_algorithms:selection-sort
6, 8, 4, 2, 1
[1,8,4,2,6] ; [1,2,4,8,6] ; [1,2,4,8,6] ; [1,2,4,6,8]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,4) ; G=(3,5)
R:(1,5) ; D:(2,5) ; D:(3,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-54=0
9x-54=0 ; x+-6=0 ; x=0--6 ; x=6
multidigit_addition
multidigit_addition:left-to-right-partials
607+244
p100:600+200=800 ; p10:0+40=40 ; p1:7+4=11 ; sum=800+40+11=851
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+56=128
8x+56=128 ; x+7=16 ; x=16-7 ; x=9
sorting_algorithms
sorting_algorithms:selection-sort
0, 9, 4, 8, 1
[0,9,4,8,1] ; [0,1,4,8,9] ; [0,1,4,8,9] ; [0,1,4,8,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(4,3)
R:(2,2) ; R:(2,3) ; D:(3,3) ; D:(4,3)
base_conversion
base_conversion:via-binary
n=150,base=8
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:2 ; CHUNK:2:6 ; OUT:226
list_summation
list_summation:left-to-right
7, 2, 2, 7
7+2=9 ; 9+2=11 ; 11+7=18
list_summation
list_summation:right-to-left
8, 1, 5, 9
5+9=14 ; 1+14=15 ; 8+15=23
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,0) ; G=(3,2)
D:(1,0) ; D:(2,0) ; D:(3,0) ; R:(3,1) ; R:(3,2)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,0) ; G=(2,2)
D:(1,0) ; D:(2,0) ; R:(2,1) ; R:(2,2)
base_conversion
base_conversion:decomposition
n=219,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:0*2^5=0 ; 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:11011011
sorting_algorithms
sorting_algorithms:merge-sort
7, 0, 4, 8, 1
[0,7,4,8,1] ; [0,4,7,8,1] ; [0,1,4,7,8]
sorting_algorithms
sorting_algorithms:merge-sort
2, 0, 5, 1, 3
[0,2,5,1,3] ; [0,2,1,5,3] ; [0,1,2,5,3] ; [0,1,2,3,5]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,3) ; G=(5,5)
D:(4,3) ; D:(5,3) ; R:(5,4) ; R:(5,5)
multidigit_addition
multidigit_addition:rounding-decomposition
409+909
round:410+909=1319 ; adjust:1319-1=1318 ; sum=1318
sorting_algorithms
sorting_algorithms:selection-sort
4, 7, 0, 8, 9
[0,7,4,8,9] ; [0,4,7,8,9] ; [0,4,7,8,9] ; [0,4,7,8,9]
sorting_algorithms
sorting_algorithms:selection-sort
1, 8, 6, 7, 2
[1,8,6,7,2] ; [1,2,6,7,8] ; [1,2,6,7,8] ; [1,2,6,7,8]
base_conversion
base_conversion:decomposition
n=180,base=4
TERM:2*4^3=128 ; TERM:3*4^2=48 ; TERM:1*4^1=4 ; TERM:0*4^0=0 ; OUT:2310
linear_equation_solving
linear_equation_solving:inverse-ops
3x+12=24
3x+12=24 ; x=(24-12)/3 ; x=12/3 ; x=4
linear_equation_solving
linear_equation_solving:inverse-ops
9x+36=18
9x+36=18 ; x=(18-36)/9 ; x=-18/9 ; x=-2
base_conversion
base_conversion:via-binary
n=172,base=8
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:5 ; CHUNK:2:4 ; OUT:254
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,1) ; G=(5,4)
R:(3,2) ; R:(3,3) ; R:(3,4) ; D:(4,4) ; D:(5,4)
list_summation
list_summation:pairwise
6, 6, 7, 4
6+6=12 ; 7+4=11 ; 12+11=23
linear_equation_solving
linear_equation_solving:inverse-ops
8x+40=112
8x+40=112 ; x=(112-40)/8 ; x=72/8 ; x=9
multidigit_addition
multidigit_addition:rounding-decomposition
948+971
round:950+971=1921 ; adjust:1921-2=1919 ; sum=1919
list_summation
list_summation:pairwise
7, 5, 2, 7
7+5=12 ; 2+7=9 ; 12+9=21
sorting_algorithms
sorting_algorithms:selection-sort
2, 8, 3, 0, 1
[0,8,3,2,1] ; [0,1,3,2,8] ; [0,1,2,3,8] ; [0,1,2,3,8]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,1) ; G=(4,2)
R:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2)
base_conversion
base_conversion:repeated-division
n=188,base=8
DIV:188/8=23,r:4 ; DIV:23/8=2,r:7 ; DIV:2/8=0,r:2 ; OUT:274
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+81=162
9x+81=162 ; 9x=81 ; x=9
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
3, 1, 2, 7
2+7=9 ; 1+9=10 ; 3+10=13
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+32=56
4x+32=56 ; 4x=24 ; x=6
multidigit_addition
multidigit_addition:rounding-decomposition
357+930
round:360+930=1290 ; adjust:1290-3=1287 ; sum=1287
sorting_algorithms
sorting_algorithms:merge-sort
3, 8, 9, 6, 4
[3,8,6,9,4] ; [3,6,8,9,4] ; [3,4,6,8,9]
list_summation
list_summation:pairwise
2, 0, 5, 5
2+0=2 ; 5+5=10 ; 2+10=12
base_conversion
base_conversion:decomposition
n=198,base=16
TERM:12*16^1=192 ; TERM:6*16^0=6 ; OUT:C6
multidigit_addition
multidigit_addition:right-to-left-carry
136+373
d2:6+3+0=9→w9,c0 ; d1:3+7+0=10→w0,c1 ; d0:1+3+1=5→w5,c0 ; sum=509
base_conversion
base_conversion:via-binary
n=93,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:3 ; CHUNK:3:1 ; OUT:1131
base_conversion
base_conversion:repeated-division
n=25,base=16
DIV:25/16=1,r:9 ; DIV:1/16=0,r:1 ; OUT:19
linear_equation_solving
linear_equation_solving:inverse-ops
9x+45=108
9x+45=108 ; x=(108-45)/9 ; x=63/9 ; x=7
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-8=-8
2x-8=-8 ; x+-4=-4 ; x=-4--4 ; x=0
multidigit_addition
multidigit_addition:rounding-decomposition
419+784
round:420+784=1204 ; adjust:1204-1=1203 ; sum=1203
sorting_algorithms
sorting_algorithms:heap-sort
7, 4, 8, 9, 6
[7,9,8,4,6] ; [9,7,8,4,6] ; [6,7,8,4,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]
sorting_algorithms
sorting_algorithms:bubble-sort
7, 0, 3, 1, 8
[0,7,3,1,8] ; [0,3,7,1,8] ; [0,3,1,7,8] ; [0,1,3,7,8]
base_conversion
base_conversion:decomposition
n=212,base=4
TERM:3*4^3=192 ; TERM:1*4^2=16 ; TERM:1*4^1=4 ; TERM:0*4^0=0 ; OUT:3110
base_conversion
base_conversion:via-binary
n=115,base=16
BINLEN:7 ; CHUNK:0:7 ; CHUNK:1:3 ; OUT:73
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+72=108
9x+72=108 ; 9x=36 ; x=4