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:inverse-ops
6x+48=60
6x+48=60 ; x=(60-48)/6 ; x=12/6 ; x=2
sorting_algorithms
sorting_algorithms:heap-sort
5, 3, 6, 7, 4
[5,7,6,3,4] ; [7,5,6,3,4] ; [4,5,6,3,7] ; [6,5,4,3,7] ; [3,5,4,6,7] ; [5,3,4,6,7] ; [4,3,5,6,7] ; [3,4,5,6,7]
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x+4=20
4x+4=20 ; x+1=5 ; x=5-1 ; x=4
base_conversion
base_conversion:repeated-division
n=51,base=8
DIV:51/8=6,r:3 ; DIV:6/8=0,r:6 ; OUT:63
multidigit_addition
multidigit_addition:left-to-right-partials
182+685
p100:100+600=700 ; p10:80+80=160 ; p1:2+5=7 ; sum=700+160+7=867
base_conversion
base_conversion:decomposition
n=25,base=4
TERM:1*4^2=16 ; TERM:2*4^1=8 ; TERM:1*4^0=1 ; OUT:121
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,0) ; G=(5,1)
R:(4,1) ; D:(5,1)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,1) ; G=(4,3)
R:(1,2) ; R:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
list_summation
list_summation:right-to-left
4, 8, 2, 8
2+8=10 ; 8+10=18 ; 4+18=22
multidigit_addition
multidigit_addition:rounding-decomposition
665+451
round:670+451=1121 ; adjust:1121-5=1116 ; sum=1116
list_summation
list_summation:left-to-right
1, 1, 9, 9
1+1=2 ; 2+9=11 ; 11+9=20
sorting_algorithms
sorting_algorithms:selection-sort
0, 4, 1, 5, 2
[0,4,1,5,2] ; [0,1,4,5,2] ; [0,1,2,5,4] ; [0,1,2,4,5]
sorting_algorithms
sorting_algorithms:insertion-sort
7, 1, 5, 8, 4
[1,7,5,8,4] ; [1,5,7,8,4] ; [1,5,7,8,4] ; [1,4,5,7,8]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,0) ; G=(4,5)
D:(3,0) ; D:(4,0) ; R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
multidigit_addition
multidigit_addition:left-to-right-partials
454+755
p100:400+700=1100 ; p10:50+50=100 ; p1:4+5=9 ; sum=1100+100+9=1209
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-27=-33
3x-27=-33 ; x+-9=-11 ; x=-11--9 ; x=-2
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(5,5)
D:(3,4) ; D:(4,4) ; D:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,5)
D:(5,3) ; R:(5,4) ; R:(5,5)
list_summation
list_summation:left-to-right
5, 6, 3, 2
5+6=11 ; 11+3=14 ; 14+2=16
sorting_algorithms
sorting_algorithms:selection-sort
6, 3, 8, 2, 9
[2,3,8,6,9] ; [2,3,8,6,9] ; [2,3,6,8,9] ; [2,3,6,8,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-32=-28
4x-32=-28 ; x+-8=-7 ; x=-7--8 ; x=1
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-4=0
2x-4=0 ; x+-2=0 ; x=0--2 ; x=2
sorting_algorithms
sorting_algorithms:insertion-sort
0, 7, 4, 2, 6
[0,7,4,2,6] ; [0,4,7,2,6] ; [0,2,4,7,6] ; [0,2,4,6,7]
multidigit_addition
multidigit_addition:left-to-right-partials
179+541
p100:100+500=600 ; p10:70+40=110 ; p1:9+1=10 ; sum=600+110+10=720
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(4,5)
R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(3,4)
R:(1,4) ; D:(2,4) ; D:(3,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+8=8
4x+8=8 ; 4x=0 ; x=0
sorting_algorithms
sorting_algorithms:selection-sort
3, 7, 5, 0, 4
[0,7,5,3,4] ; [0,3,5,7,4] ; [0,3,4,7,5] ; [0,3,4,5,7]
linear_equation_solving
linear_equation_solving:inverse-ops
4x-12=8
4x-12=8 ; x=(8--12)/4 ; x=20/4 ; x=5
list_summation
list_summation:pairwise
7, 2, 7, 9
7+2=9 ; 7+9=16 ; 9+16=25
base_conversion
base_conversion:repeated-division
n=24,base=4
DIV:24/4=6,r:0 ; DIV:6/4=1,r:2 ; DIV:1/4=0,r:1 ; OUT:120
list_summation
list_summation:right-to-left
4, 3, 4, 0
4+0=4 ; 3+4=7 ; 4+7=11
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-14=-24
2x-14=-24 ; 2x=-10 ; x=-5
sorting_algorithms
sorting_algorithms:insertion-sort
3, 6, 5, 7, 8
[3,6,5,7,8] ; [3,5,6,7,8] ; [3,5,6,7,8] ; [3,5,6,7,8]
multidigit_addition
multidigit_addition:rounding-decomposition
828+796
round:830+796=1626 ; adjust:1626-2=1624 ; sum=1624
list_summation
list_summation:right-to-left
1, 9, 0, 5
0+5=5 ; 9+5=14 ; 1+14=15
base_conversion
base_conversion:decomposition
n=45,base=8
TERM:5*8^1=40 ; TERM:5*8^0=5 ; OUT:55
sorting_algorithms
sorting_algorithms:merge-sort
3, 8, 0, 9, 2
[0,3,8,9,2] ; [0,2,3,8,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+35=98
7x+35=98 ; 7x=63 ; x=9
list_summation
list_summation:left-to-right
2, 2, 9, 3
2+2=4 ; 4+9=13 ; 13+3=16
list_summation
list_summation:pairwise
6, 7, 7, 3
6+7=13 ; 7+3=10 ; 13+10=23
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,3) ; G=(5,5)
D:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3) ; R:(5,4) ; R:(5,5)
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)
sorting_algorithms
sorting_algorithms:bubble-sort
1, 6, 9, 8, 3
[1,6,8,9,3] ; [1,6,8,3,9] ; [1,6,3,8,9] ; [1,3,6,8,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+27=30
3x+27=30 ; x+9=10 ; x=10-9 ; x=1
sorting_algorithms
sorting_algorithms:heap-sort
5, 8, 3, 2, 4
[8,5,3,2,4] ; [4,5,3,2,8] ; [5,4,3,2,8] ; [2,4,3,5,8] ; [4,2,3,5,8] ; [3,2,4,5,8] ; [2,3,4,5,8]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,2) ; G=(5,3)
R:(3,3) ; D:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,3) ; G=(4,5)
D:(4,3) ; R:(4,4) ; R:(4,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,1) ; G=(2,4)
D:(1,1) ; D:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4)
list_summation
list_summation:pairwise
6, 6, 2, 6
6+6=12 ; 2+6=8 ; 12+8=20
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
multidigit_addition
multidigit_addition:right-to-left-carry
641+984
d2:1+4+0=5→w5,c0 ; d1:4+8+0=12→w2,c1 ; d0:6+9+1=16→w6,c1 ; sum=1625
multidigit_addition
multidigit_addition:rounding-decomposition
145+739
round:150+739=889 ; adjust:889-5=884 ; sum=884
sorting_algorithms
sorting_algorithms:bubble-sort
7, 9, 6, 5, 3
[7,6,9,5,3] ; [7,6,5,9,3] ; [7,6,5,3,9] ; [6,7,5,3,9] ; [6,5,7,3,9] ; [6,5,3,7,9] ; [5,6,3,7,9] ; [5,3,6,7,9] ; [3,5,6,7,9]
list_summation
list_summation:left-to-right
4, 2, 5, 7
4+2=6 ; 6+5=11 ; 11+7=18
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+45=117
9x+45=117 ; 9x=72 ; x=8
list_summation
list_summation:right-to-left
9, 7, 4, 2
4+2=6 ; 7+6=13 ; 9+13=22
list_summation
list_summation:left-to-right
1, 4, 1, 8
1+4=5 ; 5+1=6 ; 6+8=14
sorting_algorithms
sorting_algorithms:selection-sort
7, 6, 2, 4, 8
[2,6,7,4,8] ; [2,4,7,6,8] ; [2,4,6,7,8] ; [2,4,6,7,8]
sorting_algorithms
sorting_algorithms:merge-sort
9, 2, 1, 5, 4
[2,9,1,5,4] ; [1,2,5,9,4] ; [1,2,4,5,9]
base_conversion
base_conversion:repeated-division
n=228,base=4
DIV:228/4=57,r:0 ; DIV:57/4=14,r:1 ; DIV:14/4=3,r:2 ; DIV:3/4=0,r:3 ; OUT:3210
sorting_algorithms
sorting_algorithms:heap-sort
8, 3, 7, 2, 0
[0,3,7,2,8] ; [7,3,0,2,8] ; [2,3,0,7,8] ; [3,2,0,7,8] ; [0,2,3,7,8] ; [2,0,3,7,8] ; [0,2,3,7,8]
sorting_algorithms
sorting_algorithms:heap-sort
5, 0, 3, 6, 2
[5,6,3,0,2] ; [6,5,3,0,2] ; [2,5,3,0,6] ; [5,2,3,0,6] ; [0,2,3,5,6] ; [3,2,0,5,6] ; [0,2,3,5,6] ; [2,0,3,5,6] ; [0,2,3,5,6]
multidigit_addition
multidigit_addition:left-to-right-partials
294+649
p100:200+600=800 ; p10:90+40=130 ; p1:4+9=13 ; sum=800+130+13=943
multidigit_addition
multidigit_addition:rounding-decomposition
639+287
round:640+287=927 ; adjust:927-1=926 ; sum=926
base_conversion
base_conversion:decomposition
n=225,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:1*2^5=32 ; 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:11100001
multidigit_addition
multidigit_addition:rounding-decomposition
651+659
round:660+659=1319 ; adjust:1319-9=1310 ; sum=1310
multidigit_addition
multidigit_addition:right-to-left-carry
204+747
d2:4+7+0=11→w1,c1 ; d1:0+4+1=5→w5,c0 ; d0:2+7+0=9→w9,c0 ; sum=951
list_summation
list_summation:left-to-right
8, 4, 2, 5
8+4=12 ; 12+2=14 ; 14+5=19
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+42=54
6x+42=54 ; 6x=12 ; x=2
base_conversion
base_conversion:decomposition
n=199,base=16
TERM:12*16^1=192 ; TERM:7*16^0=7 ; OUT:C7
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x-36=-27
9x-36=-27 ; 9x=9 ; x=1
sorting_algorithms
sorting_algorithms:merge-sort
0, 4, 1, 9, 3
[0,1,4,9,3] ; [0,1,3,4,9]
multidigit_addition
multidigit_addition:left-to-right-partials
374+120
p100:300+100=400 ; p10:70+20=90 ; p1:4+0=4 ; sum=400+90+4=494
list_summation
list_summation:pairwise
7, 7, 2, 5
7+7=14 ; 2+5=7 ; 14+7=21
list_summation
list_summation:pairwise
3, 3, 6, 9
3+3=6 ; 6+9=15 ; 6+15=21
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+9=-12
3x+9=-12 ; 3x=-21 ; x=-7
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-12=-6
2x-12=-6 ; x+-6=-3 ; x=-3--6 ; x=3
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,0) ; G=(4,1)
D:(3,0) ; D:(4,0) ; R:(4,1)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,0) ; G=(5,4)
R:(1,1) ; D:(2,1) ; R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4)
list_summation
list_summation:pairwise
9, 1, 8, 0
9+1=10 ; 8+0=8 ; 10+8=18
base_conversion
base_conversion:via-binary
n=70,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:2 ; OUT:1012
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,2) ; G=(3,5)
R:(1,3) ; R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5)
linear_equation_solving
linear_equation_solving:inverse-ops
4x+4=-24
4x+4=-24 ; x=(-24-4)/4 ; x=-28/4 ; x=-7
list_summation
list_summation:left-to-right
8, 1, 2, 9
8+1=9 ; 9+2=11 ; 11+9=20
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-48=0
8x-48=0 ; 8x=48 ; x=6
multidigit_addition
multidigit_addition:rounding-decomposition
274+905
round:280+905=1185 ; adjust:1185-6=1179 ; sum=1179
multidigit_addition
multidigit_addition:left-to-right-partials
183+772
p100:100+700=800 ; p10:80+70=150 ; p1:3+2=5 ; sum=800+150+5=955
list_summation
list_summation:right-to-left
9, 7, 2, 4
2+4=6 ; 7+6=13 ; 9+13=22
base_conversion
base_conversion:repeated-division
n=206,base=2
DIV:206/2=103,r:0 ; DIV:103/2=51,r:1 ; DIV:51/2=25,r:1 ; DIV:25/2=12,r:1 ; DIV:12/2=6,r:0 ; DIV:6/2=3,r:0 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11001110
sorting_algorithms
sorting_algorithms:heap-sort
5, 9, 2, 0, 3
[9,5,2,0,3] ; [3,5,2,0,9] ; [5,3,2,0,9] ; [0,3,2,5,9] ; [3,0,2,5,9] ; [2,0,3,5,9] ; [0,2,3,5,9]
base_conversion
base_conversion:via-binary
n=169,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:1 ; OUT:10101001
multidigit_addition
multidigit_addition:right-to-left-carry
763+474
d2:3+4+0=7→w7,c0 ; d1:6+7+0=13→w3,c1 ; d0:7+4+1=12→w2,c1 ; sum=1237
list_summation
list_summation:pairwise
5, 7, 5, 0
5+7=12 ; 5+0=5 ; 12+5=17
multidigit_addition
multidigit_addition:left-to-right-partials
122+925
p100:100+900=1000 ; p10:20+20=40 ; p1:2+5=7 ; sum=1000+40+7=1047
list_summation
list_summation:right-to-left
3, 4, 7, 2
7+2=9 ; 4+9=13 ; 3+13=16
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,3) ; G=(3,5)
R:(2,4) ; R:(2,5) ; D:(3,5)
multidigit_addition
multidigit_addition:left-to-right-partials
806+626
p100:800+600=1400 ; p10:0+20=20 ; p1:6+6=12 ; sum=1400+20+12=1432
multidigit_addition
multidigit_addition:left-to-right-partials
997+673
p100:900+600=1500 ; p10:90+70=160 ; p1:7+3=10 ; sum=1500+160+10=1670