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:subtract-then-divide
6x+12=-36
6x+12=-36 ; 6x=-48 ; x=-8
linear_equation_solving
linear_equation_solving:inverse-ops
3x+18=30
3x+18=30 ; x=(30-18)/3 ; x=12/3 ; x=4
sorting_algorithms
sorting_algorithms:bubble-sort
0, 3, 5, 9, 1
[0,3,5,1,9] ; [0,3,1,5,9] ; [0,1,3,5,9]
multidigit_addition
multidigit_addition:right-to-left-carry
441+560
d2:1+0+0=1→w1,c0 ; d1:4+6+0=10→w0,c1 ; d0:4+5+1=10→w0,c1 ; sum=1001
linear_equation_solving
linear_equation_solving:inverse-ops
9x+63=27
9x+63=27 ; x=(27-63)/9 ; x=-36/9 ; x=-4
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)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,4) ; G=(5,5)
R:(3,5) ; D:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,3) ; G=(4,5)
R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
list_summation
list_summation:pairwise
5, 7, 4, 8
5+7=12 ; 4+8=12 ; 12+12=24
multidigit_addition
multidigit_addition:right-to-left-carry
147+287
d2:7+7+0=14→w4,c1 ; d1:4+8+1=13→w3,c1 ; d0:1+2+1=4→w4,c0 ; sum=434
sorting_algorithms
sorting_algorithms:selection-sort
9, 3, 1, 4, 8
[1,3,9,4,8] ; [1,3,9,4,8] ; [1,3,4,9,8] ; [1,3,4,8,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(4,5)
D:(4,4) ; R:(4,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+64=16
8x+64=16 ; 8x=-48 ; x=-6
list_summation
list_summation:right-to-left
5, 3, 8, 0
8+0=8 ; 3+8=11 ; 5+11=16
list_summation
list_summation:pairwise
0, 6, 2, 9
0+6=6 ; 2+9=11 ; 6+11=17
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,3) ; G=(4,4)
R:(3,4) ; D:(4,4)
multidigit_addition
multidigit_addition:rounding-decomposition
755+677
round:760+677=1437 ; adjust:1437-5=1432 ; sum=1432
multidigit_addition
multidigit_addition:rounding-decomposition
939+635
round:940+635=1575 ; adjust:1575-1=1574 ; sum=1574
linear_equation_solving
linear_equation_solving:inverse-ops
3x+0=-24
3x+0=-24 ; x=(-24-0)/3 ; x=-24/3 ; x=-8
list_summation
list_summation:right-to-left
5, 6, 1, 1
1+1=2 ; 6+2=8 ; 5+8=13
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)
sorting_algorithms
sorting_algorithms:heap-sort
9, 2, 0, 6, 4
[9,6,0,2,4] ; [4,6,0,2,9] ; [6,4,0,2,9] ; [2,4,0,6,9] ; [4,2,0,6,9] ; [0,2,4,6,9] ; [2,0,4,6,9] ; [0,2,4,6,9]
linear_equation_solving
linear_equation_solving:inverse-ops
3x-9=-36
3x-9=-36 ; x=(-36--9)/3 ; x=-27/3 ; x=-9
linear_equation_solving
linear_equation_solving:inverse-ops
7x-63=-70
7x-63=-70 ; x=(-70--63)/7 ; x=-7/7 ; x=-1
base_conversion
base_conversion:via-binary
n=235,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:5 ; CHUNK:2:3 ; OUT:353
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+30=10
5x+30=10 ; x+6=2 ; x=2-6 ; x=-4
base_conversion
base_conversion:repeated-division
n=241,base=2
DIV:241/2=120,r:1 ; DIV:120/2=60,r:0 ; DIV:60/2=30,r:0 ; DIV:30/2=15,r:0 ; DIV:15/2=7,r:1 ; DIV:7/2=3,r:1 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11110001
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,3) ; G=(1,4)
D:(1,3) ; R:(1,4)
list_summation
list_summation:pairwise
8, 6, 8, 0
8+6=14 ; 8+0=8 ; 14+8=22
list_summation
list_summation:right-to-left
4, 4, 6, 6
6+6=12 ; 4+12=16 ; 4+16=20
base_conversion
base_conversion:via-binary
n=47,base=4
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:3 ; CHUNK:2:3 ; OUT:233
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+0=-72
9x+0=-72 ; x+0=-8 ; x=-8-0 ; x=-8
list_summation
list_summation:left-to-right
8, 7, 8, 6
8+7=15 ; 15+8=23 ; 23+6=29
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+24=3
3x+24=3 ; 3x=-21 ; x=-7
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,2) ; G=(5,4)
R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4)
sorting_algorithms
sorting_algorithms:merge-sort
2, 9, 1, 6, 7
[1,2,6,9,7] ; [1,2,6,7,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-48=-96
6x-48=-96 ; 6x=-48 ; x=-8
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-14=21
7x-14=21 ; x+-2=3 ; x=3--2 ; x=5
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-18=-24
6x-18=-24 ; x+-3=-4 ; x=-4--3 ; x=-1
base_conversion
base_conversion:decomposition
n=104,base=16
TERM:6*16^1=96 ; TERM:8*16^0=8 ; OUT:68
list_summation
list_summation:pairwise
1, 6, 0, 1
1+6=7 ; 0+1=1 ; 7+1=8
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+42=72
6x+42=72 ; x+7=12 ; x=12-7 ; x=5
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-16=8
4x-16=8 ; 4x=24 ; x=6
multidigit_addition
multidigit_addition:rounding-decomposition
973+363
round:980+363=1343 ; adjust:1343-7=1336 ; sum=1336
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,0) ; G=(5,2)
D:(5,0) ; R:(5,1) ; R:(5,2)
linear_equation_solving
linear_equation_solving:inverse-ops
4x+12=48
4x+12=48 ; x=(48-12)/4 ; x=36/4 ; x=9
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+45=75
5x+45=75 ; 5x=30 ; x=6
base_conversion
base_conversion:repeated-division
n=15,base=16
DIV:15/16=0,r:15 ; OUT:F
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,2) ; G=(3,3)
R:(2,3) ; D:(3,3)
sorting_algorithms
sorting_algorithms:bubble-sort
9, 0, 4, 1, 5
[0,9,4,1,5] ; [0,4,9,1,5] ; [0,4,1,9,5] ; [0,4,1,5,9] ; [0,1,4,5,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-25=-30
5x-25=-30 ; x+-5=-6 ; x=-6--5 ; x=-1
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-16=8
4x-16=8 ; x+-4=2 ; x=2--4 ; x=6
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,0) ; G=(5,1)
R:(4,1) ; D:(5,1)
base_conversion
base_conversion:via-binary
n=232,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:2 ; CHUNK:2:2 ; CHUNK:3:0 ; OUT:3220
sorting_algorithms
sorting_algorithms:selection-sort
4, 2, 8, 9, 5
[2,4,8,9,5] ; [2,4,8,9,5] ; [2,4,5,9,8] ; [2,4,5,8,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+0=-48
8x+0=-48 ; 8x=-48 ; x=-6
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x+0=20
4x+0=20 ; x+0=5 ; x=5-0 ; x=5
base_conversion
base_conversion:via-binary
n=255,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:7 ; CHUNK:2:7 ; OUT:377
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(2,3)
R:(0,2) ; D:(1,2) ; R:(1,3) ; D:(2,3)
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+56=91
7x+56=91 ; x+8=13 ; x=13-8 ; x=5
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+14=70
7x+14=70 ; 7x=56 ; x=8
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,3) ; G=(5,4)
R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
list_summation
list_summation:right-to-left
0, 1, 7, 2
7+2=9 ; 1+9=10 ; 0+10=10
list_summation
list_summation:left-to-right
6, 5, 2, 6
6+5=11 ; 11+2=13 ; 13+6=19
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+21=0
7x+21=0 ; x+3=0 ; x=0-3 ; x=-3
list_summation
list_summation:left-to-right
9, 4, 8, 3
9+4=13 ; 13+8=21 ; 21+3=24
sorting_algorithms
sorting_algorithms:selection-sort
1, 3, 5, 8, 6
[1,3,5,8,6] ; [1,3,5,8,6] ; [1,3,5,8,6] ; [1,3,5,6,8]
sorting_algorithms
sorting_algorithms:selection-sort
4, 8, 1, 0, 5
[0,8,1,4,5] ; [0,1,8,4,5] ; [0,1,4,8,5] ; [0,1,4,5,8]
sorting_algorithms
sorting_algorithms:merge-sort
7, 4, 6, 2, 8
[4,7,6,2,8] ; [4,7,2,6,8] ; [2,4,6,7,8]
sorting_algorithms
sorting_algorithms:selection-sort
4, 6, 0, 1, 7
[0,6,4,1,7] ; [0,1,4,6,7] ; [0,1,4,6,7] ; [0,1,4,6,7]
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-63=-35
7x-63=-35 ; x+-9=-5 ; x=-5--9 ; x=4
multidigit_addition
multidigit_addition:left-to-right-partials
901+781
p100:900+700=1600 ; p10:0+80=80 ; p1:1+1=2 ; sum=1600+80+2=1682
base_conversion
base_conversion:repeated-division
n=136,base=16
DIV:136/16=8,r:8 ; DIV:8/16=0,r:8 ; OUT:88
sorting_algorithms
sorting_algorithms:heap-sort
3, 8, 4, 1, 6
[8,3,4,1,6] ; [8,6,4,1,3] ; [3,6,4,1,8] ; [6,3,4,1,8] ; [1,3,4,6,8] ; [4,3,1,6,8] ; [1,3,4,6,8] ; [3,1,4,6,8] ; [1,3,4,6,8]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,4) ; G=(2,5)
R:(1,5) ; D:(2,5)
base_conversion
base_conversion:repeated-division
n=53,base=8
DIV:53/8=6,r:5 ; DIV:6/8=0,r:6 ; OUT:65
list_summation
list_summation:right-to-left
7, 9, 1, 8
1+8=9 ; 9+9=18 ; 7+18=25
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+48=48
6x+48=48 ; 6x=0 ; x=0
base_conversion
base_conversion:decomposition
n=88,base=8
TERM:1*8^2=64 ; TERM:3*8^1=24 ; TERM:0*8^0=0 ; OUT:130
list_summation
list_summation:pairwise
3, 1, 0, 0
3+1=4 ; 0+0=0 ; 4+0=4
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,1) ; G=(3,5)
D:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(4,5)
D:(3,4) ; D:(4,4) ; R:(4,5)
list_summation
list_summation:pairwise
4, 0, 6, 1
4+0=4 ; 6+1=7 ; 4+7=11
list_summation
list_summation:left-to-right
5, 6, 1, 2
5+6=11 ; 11+1=12 ; 12+2=14
list_summation
list_summation:left-to-right
3, 9, 2, 5
3+9=12 ; 12+2=14 ; 14+5=19
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+32=16
8x+32=16 ; 8x=-16 ; x=-2
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x-12=0
3x-12=0 ; 3x=12 ; x=4
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,3) ; G=(4,5)
D:(4,3) ; R:(4,4) ; R:(4,5)
list_summation
list_summation:right-to-left
3, 2, 1, 8
1+8=9 ; 2+9=11 ; 3+11=14
sorting_algorithms
sorting_algorithms:selection-sort
8, 0, 4, 2, 9
[0,8,4,2,9] ; [0,2,4,8,9] ; [0,2,4,8,9] ; [0,2,4,8,9]
sorting_algorithms
sorting_algorithms:selection-sort
6, 5, 9, 8, 4
[4,5,9,8,6] ; [4,5,9,8,6] ; [4,5,6,8,9] ; [4,5,6,8,9]
multidigit_addition
multidigit_addition:left-to-right-partials
198+625
p100:100+600=700 ; p10:90+20=110 ; p1:8+5=13 ; sum=700+110+13=823
list_summation
list_summation:right-to-left
9, 7, 9, 3
9+3=12 ; 7+12=19 ; 9+19=28
sorting_algorithms
sorting_algorithms:insertion-sort
2, 5, 4, 9, 1
[2,5,4,9,1] ; [2,4,5,9,1] ; [2,4,5,9,1] ; [1,2,4,5,9]
base_conversion
base_conversion:via-binary
n=216,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:2 ; CHUNK:3:0 ; OUT:3120
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+4=36
4x+4=36 ; 4x=32 ; x=8
base_conversion
base_conversion:repeated-division
n=13,base=2
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:1101
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(4,5)
R:(2,1) ; D:(3,1) ; R:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
list_summation
list_summation:pairwise
0, 0, 3, 4
0+0=0 ; 3+4=7 ; 0+7=7