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
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+16=20
2x+16=20 ; x+8=10 ; x=10-8 ; x=2
sorting_algorithms
sorting_algorithms:insertion-sort
6, 1, 9, 7, 5
[1,6,9,7,5] ; [1,6,9,7,5] ; [1,6,7,9,5] ; [1,5,6,7,9]
sorting_algorithms
sorting_algorithms:merge-sort
9, 5, 7, 4, 0
[5,9,7,4,0] ; [5,9,4,7,0] ; [4,5,7,9,0] ; [0,4,5,7,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-16=-44
4x-16=-44 ; x+-4=-11 ; x=-11--4 ; x=-7
linear_equation_solving
linear_equation_solving:inverse-ops
7x+63=70
7x+63=70 ; x=(70-63)/7 ; x=7/7 ; x=1
sorting_algorithms
sorting_algorithms:heap-sort
5, 2, 3, 4, 6
[5,6,3,4,2] ; [6,5,3,4,2] ; [2,5,3,4,6] ; [5,2,3,4,6] ; [5,4,3,2,6] ; [2,4,3,5,6] ; [4,2,3,5,6] ; [3,2,4,5,6] ; [2,3,4,5,6]
list_summation
list_summation:pairwise
3, 2, 8, 2
3+2=5 ; 8+2=10 ; 5+10=15
sorting_algorithms
sorting_algorithms:merge-sort
7, 5, 2, 4, 8
[5,7,2,4,8] ; [2,4,5,7,8]
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+18=-6
3x+18=-6 ; x+6=-2 ; x=-2-6 ; x=-8
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+28=16
4x+28=16 ; 4x=-12 ; x=-3
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-35=7
7x-35=7 ; 7x=42 ; x=6
linear_equation_solving
linear_equation_solving:inverse-ops
6x+18=42
6x+18=42 ; x=(42-18)/6 ; x=24/6 ; x=4
base_conversion
base_conversion:decomposition
n=229,base=8
TERM:3*8^2=192 ; TERM:4*8^1=32 ; TERM:5*8^0=5 ; OUT:345
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x-9=-24
3x-9=-24 ; 3x=-15 ; x=-5
multidigit_addition
multidigit_addition:right-to-left-carry
114+234
d2:4+4+0=8→w8,c0 ; d1:1+3+0=4→w4,c0 ; d0:1+2+0=3→w3,c0 ; sum=348
base_conversion
base_conversion:repeated-division
n=171,base=2
DIV:171/2=85,r:1 ; DIV:85/2=42,r:1 ; DIV:42/2=21,r:0 ; DIV:21/2=10,r:1 ; 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:10101011
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x-3=12
3x-3=12 ; 3x=15 ; x=5
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+21=12
3x+21=12 ; 3x=-9 ; x=-3
multidigit_addition
multidigit_addition:left-to-right-partials
100+851
p100:100+800=900 ; p10:0+50=50 ; p1:0+1=1 ; sum=900+50+1=951
sorting_algorithms
sorting_algorithms:merge-sort
7, 0, 5, 2, 3
[0,7,5,2,3] ; [0,7,2,5,3] ; [0,2,5,7,3] ; [0,2,3,5,7]
list_summation
list_summation:right-to-left
0, 3, 7, 7
7+7=14 ; 3+14=17 ; 0+17=17
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,2) ; G=(5,5)
R:(2,3) ; D:(3,3) ; R:(3,4) ; D:(4,4) ; R:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+35=5
5x+35=5 ; x+7=1 ; x=1-7 ; x=-6
sorting_algorithms
sorting_algorithms:merge-sort
6, 5, 9, 0, 2
[5,6,9,0,2] ; [5,6,0,9,2] ; [0,5,6,9,2] ; [0,2,5,6,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+42=18
6x+42=18 ; x+7=3 ; x=3-7 ; x=-4
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+14=42
7x+14=42 ; x+2=6 ; x=6-2 ; x=4
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-6=-60
6x-6=-60 ; x+-1=-10 ; x=-10--1 ; x=-9
sorting_algorithms
sorting_algorithms:insertion-sort
5, 9, 4, 0, 6
[5,9,4,0,6] ; [4,5,9,0,6] ; [0,4,5,9,6] ; [0,4,5,6,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,3) ; G=(4,4)
D:(4,3) ; R:(4,4)
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x-64=-32
8x-64=-32 ; x+-8=-4 ; x=-4--8 ; x=4
base_conversion
base_conversion:repeated-division
n=216,base=8
DIV:216/8=27,r:0 ; DIV:27/8=3,r:3 ; DIV:3/8=0,r:3 ; OUT:330
base_conversion
base_conversion:decomposition
n=121,base=16
TERM:7*16^1=112 ; TERM:9*16^0=9 ; OUT:79
list_summation
list_summation:pairwise
8, 9, 6, 3
8+9=17 ; 6+3=9 ; 17+9=26
list_summation
list_summation:right-to-left
9, 0, 6, 8
6+8=14 ; 0+14=14 ; 9+14=23
base_conversion
base_conversion:via-binary
n=66,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:2 ; OUT:1002
base_conversion
base_conversion:repeated-division
n=185,base=4
DIV:185/4=46,r:1 ; DIV:46/4=11,r:2 ; DIV:11/4=2,r:3 ; DIV:2/4=0,r:2 ; OUT:2321
list_summation
list_summation:left-to-right
0, 5, 1, 7
0+5=5 ; 5+1=6 ; 6+7=13
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(4,3)
R:(0,3) ; D:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,2) ; G=(3,5)
D:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(2,3)
R:(1,2) ; D:(2,2) ; R:(2,3)
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)
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x+8=20
4x+8=20 ; x+2=5 ; x=5-2 ; x=3
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-12=0
6x-12=0 ; 6x=12 ; x=2
sorting_algorithms
sorting_algorithms:bubble-sort
7, 5, 3, 1, 8
[5,7,3,1,8] ; [5,3,7,1,8] ; [5,3,1,7,8] ; [3,5,1,7,8] ; [3,1,5,7,8] ; [1,3,5,7,8]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(5,4)
R:(1,2) ; D:(2,2) ; R:(2,3) ; D:(3,3) ; R:(3,4) ; D:(4,4) ; D:(5,4)
list_summation
list_summation:pairwise
2, 9, 2, 0
2+9=11 ; 2+0=2 ; 11+2=13
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,3) ; G=(4,5)
R:(2,4) ; D:(3,4) ; R:(3,5) ; D:(4,5)
multidigit_addition
multidigit_addition:right-to-left-carry
922+375
d2:2+5+0=7→w7,c0 ; d1:2+7+0=9→w9,c0 ; d0:9+3+0=12→w2,c1 ; sum=1297
list_summation
list_summation:right-to-left
0, 0, 2, 6
2+6=8 ; 0+8=8 ; 0+8=8
list_summation
list_summation:left-to-right
1, 4, 3, 0
1+4=5 ; 5+3=8 ; 8+0=8
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+48=96
6x+48=96 ; x+8=16 ; x=16-8 ; x=8
base_conversion
base_conversion:repeated-division
n=99,base=4
DIV:99/4=24,r:3 ; DIV:24/4=6,r:0 ; DIV:6/4=1,r:2 ; DIV:1/4=0,r:1 ; OUT:1203
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+21=9
3x+21=9 ; 3x=-12 ; x=-4
list_summation
list_summation:right-to-left
8, 6, 7, 1
7+1=8 ; 6+8=14 ; 8+14=22
base_conversion
base_conversion:via-binary
n=25,base=16
BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:9 ; OUT:19
list_summation
list_summation:right-to-left
2, 8, 9, 0
9+0=9 ; 8+9=17 ; 2+17=19
list_summation
list_summation:pairwise
0, 7, 6, 2
0+7=7 ; 6+2=8 ; 7+8=15
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+35=-10
5x+35=-10 ; x+7=-2 ; x=-2-7 ; x=-9
list_summation
list_summation:pairwise
4, 5, 8, 9
4+5=9 ; 8+9=17 ; 9+17=26
base_conversion
base_conversion:via-binary
n=167,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:2 ; CHUNK:2:1 ; CHUNK:3:3 ; OUT:2213
list_summation
list_summation:right-to-left
4, 0, 6, 6
6+6=12 ; 0+12=12 ; 4+12=16
list_summation
list_summation:pairwise
1, 3, 2, 0
1+3=4 ; 2+0=2 ; 4+2=6
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(4,3)
D:(2,2) ; D:(3,2) ; D:(4,2) ; R:(4,3)
multidigit_addition
multidigit_addition:rounding-decomposition
334+829
round:340+829=1169 ; adjust:1169-6=1163 ; sum=1163
linear_equation_solving
linear_equation_solving:inverse-ops
6x-48=-6
6x-48=-6 ; x=(-6--48)/6 ; x=42/6 ; x=7
linear_equation_solving
linear_equation_solving:inverse-ops
6x-6=-60
6x-6=-60 ; x=(-60--6)/6 ; x=-54/6 ; x=-9
linear_equation_solving
linear_equation_solving:inverse-ops
7x-7=-28
7x-7=-28 ; x=(-28--7)/7 ; x=-21/7 ; x=-3
list_summation
list_summation:left-to-right
5, 8, 0, 6
5+8=13 ; 13+0=13 ; 13+6=19
sorting_algorithms
sorting_algorithms:heap-sort
9, 1, 2, 4, 8
[9,8,2,4,1] ; [1,8,2,4,9] ; [8,1,2,4,9] ; [8,4,2,1,9] ; [1,4,2,8,9] ; [4,1,2,8,9] ; [2,1,4,8,9] ; [1,2,4,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
195+215
d2:5+5+0=10→w0,c1 ; d1:9+1+1=11→w1,c1 ; d0:1+2+1=4→w4,c0 ; sum=410
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+14=-35
7x+14=-35 ; 7x=-49 ; x=-7
list_summation
list_summation:left-to-right
1, 1, 0, 9
1+1=2 ; 2+0=2 ; 2+9=11
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(4,4)
R:(3,4) ; D:(4,4)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,1) ; G=(2,2)
D:(2,1) ; R:(2,2)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,2) ; G=(5,4)
R:(1,3) ; D:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,2)
D:(5,1) ; R:(5,2)
sorting_algorithms
sorting_algorithms:insertion-sort
0, 9, 4, 7, 3
[0,9,4,7,3] ; [0,4,9,7,3] ; [0,4,7,9,3] ; [0,3,4,7,9]
base_conversion
base_conversion:repeated-division
n=113,base=4
DIV:113/4=28,r:1 ; DIV:28/4=7,r:0 ; DIV:7/4=1,r:3 ; DIV:1/4=0,r:1 ; OUT:1301
multidigit_addition
multidigit_addition:left-to-right-partials
369+656
p100:300+600=900 ; p10:60+50=110 ; p1:9+6=15 ; sum=900+110+15=1025
list_summation
list_summation:left-to-right
4, 9, 0, 2
4+9=13 ; 13+0=13 ; 13+2=15
base_conversion
base_conversion:decomposition
n=13,base=2
TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:0*2^1=0 ; TERM:1*2^0=1 ; OUT:1101
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,5)
R:(4,3) ; D:(5,3) ; R:(5,4) ; R:(5,5)
multidigit_addition
multidigit_addition:rounding-decomposition
747+512
round:750+512=1262 ; adjust:1262-3=1259 ; sum=1259
multidigit_addition
multidigit_addition:rounding-decomposition
806+113
round:810+113=923 ; adjust:923-4=919 ; sum=919
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,2) ; G=(5,4)
R:(4,3) ; R:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(1,5)
R:(0,5) ; D:(1,5)
multidigit_addition
multidigit_addition:left-to-right-partials
345+926
p100:300+900=1200 ; p10:40+20=60 ; p1:5+6=11 ; sum=1200+60+11=1271
base_conversion
base_conversion:via-binary
n=185,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:1 ; OUT:10111001
list_summation
list_summation:right-to-left
9, 0, 8, 9
8+9=17 ; 0+17=17 ; 9+17=26
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x-32=-104
8x-32=-104 ; x+-4=-13 ; x=-13--4 ; x=-9
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,4) ; G=(4,5)
R:(2,5) ; D:(3,5) ; D:(4,5)
sorting_algorithms
sorting_algorithms:merge-sort
6, 3, 2, 9, 5
[3,6,2,9,5] ; [2,3,6,9,5] ; [2,3,5,6,9]
base_conversion
base_conversion:via-binary
n=248,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:0 ; OUT:11111000
list_summation
list_summation:pairwise
1, 2, 1, 8
1+2=3 ; 1+8=9 ; 3+9=12
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(4,5)
D:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
base_conversion
base_conversion:decomposition
n=57,base=16
TERM:3*16^1=48 ; TERM:9*16^0=9 ; OUT:39
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(5,5)
R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
sorting_algorithms
sorting_algorithms:selection-sort
5, 1, 3, 2, 6
[1,5,3,2,6] ; [1,2,3,5,6] ; [1,2,3,5,6] ; [1,2,3,5,6]
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+42=-7
7x+42=-7 ; x+6=-1 ; x=-1-6 ; x=-7
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+16=34
2x+16=34 ; 2x=18 ; x=9