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
sorting_algorithms
sorting_algorithms:heap-sort
4, 8, 2, 5, 6
[8,4,2,5,6] ; [8,6,2,5,4] ; [4,6,2,5,8] ; [6,4,2,5,8] ; [6,5,2,4,8] ; [4,5,2,6,8] ; [5,4,2,6,8] ; [2,4,5,6,8] ; [4,2,5,6,8] ; [2,4,5,6,8]
sorting_algorithms
sorting_algorithms:insertion-sort
2, 8, 5, 1, 9
[2,8,5,1,9] ; [2,5,8,1,9] ; [1,2,5,8,9] ; [1,2,5,8,9]
base_conversion
base_conversion:repeated-division
n=41,base=8
DIV:41/8=5,r:1 ; DIV:5/8=0,r:5 ; OUT:51
multidigit_addition
multidigit_addition:right-to-left-carry
626+257
d2:6+7+0=13→w3,c1 ; d1:2+5+1=8→w8,c0 ; d0:6+2+0=8→w8,c0 ; sum=883
base_conversion
base_conversion:decomposition
n=40,base=4
TERM:2*4^2=32 ; TERM:2*4^1=8 ; TERM:0*4^0=0 ; OUT:220
list_summation
list_summation:left-to-right
8, 9, 2, 3
8+9=17 ; 17+2=19 ; 19+3=22
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-18=-28
2x-18=-28 ; 2x=-10 ; x=-5
sorting_algorithms
sorting_algorithms:insertion-sort
4, 5, 2, 1, 3
[4,5,2,1,3] ; [2,4,5,1,3] ; [1,2,4,5,3] ; [1,2,3,4,5]
sorting_algorithms
sorting_algorithms:heap-sort
4, 1, 8, 6, 5
[4,6,8,1,5] ; [8,6,4,1,5] ; [5,6,4,1,8] ; [6,5,4,1,8] ; [1,5,4,6,8] ; [5,1,4,6,8] ; [4,1,5,6,8] ; [1,4,5,6,8]
base_conversion
base_conversion:decomposition
n=35,base=8
TERM:4*8^1=32 ; TERM:3*8^0=3 ; OUT:43
sorting_algorithms
sorting_algorithms:heap-sort
1, 2, 4, 5, 3
[1,5,4,2,3] ; [5,1,4,2,3] ; [5,3,4,2,1] ; [1,3,4,2,5] ; [4,3,1,2,5] ; [2,3,1,4,5] ; [3,2,1,4,5] ; [1,2,3,4,5] ; [2,1,3,4,5] ; [1,2,3,4,5]
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+4=-8
2x+4=-8 ; 2x=-12 ; x=-6
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,0) ; G=(5,4)
D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4)
sorting_algorithms
sorting_algorithms:selection-sort
7, 4, 2, 5, 8
[2,4,7,5,8] ; [2,4,7,5,8] ; [2,4,5,7,8] ; [2,4,5,7,8]
sorting_algorithms
sorting_algorithms:bubble-sort
0, 8, 5, 1, 9
[0,5,8,1,9] ; [0,5,1,8,9] ; [0,1,5,8,9]
base_conversion
base_conversion:repeated-division
n=243,base=4
DIV:243/4=60,r:3 ; DIV:60/4=15,r:0 ; DIV:15/4=3,r:3 ; DIV:3/4=0,r:3 ; OUT:3303
base_conversion
base_conversion:decomposition
n=209,base=8
TERM:3*8^2=192 ; TERM:2*8^1=16 ; TERM:1*8^0=1 ; OUT:321
base_conversion
base_conversion:via-binary
n=182,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:3 ; CHUNK:2:1 ; CHUNK:3:2 ; OUT:2312
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+2=16
2x+2=16 ; 2x=14 ; x=7
multidigit_addition
multidigit_addition:left-to-right-partials
593+198
p100:500+100=600 ; p10:90+90=180 ; p1:3+8=11 ; sum=600+180+11=791
list_summation
list_summation:right-to-left
8, 7, 4, 2
4+2=6 ; 7+6=13 ; 8+13=21
multidigit_addition
multidigit_addition:rounding-decomposition
952+954
round:960+954=1914 ; adjust:1914-8=1906 ; sum=1906
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,0) ; G=(5,4)
D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4)
list_summation
list_summation:pairwise
9, 3, 1, 5
9+3=12 ; 1+5=6 ; 12+6=18
base_conversion
base_conversion:decomposition
n=51,base=2
TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:110011
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,1) ; G=(4,3)
R:(3,2) ; D:(4,2) ; R:(4,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(3,5)
D:(3,4) ; R:(3,5)
base_conversion
base_conversion:repeated-division
n=118,base=4
DIV:118/4=29,r:2 ; DIV:29/4=7,r:1 ; DIV:7/4=1,r:3 ; DIV:1/4=0,r:1 ; OUT:1312
list_summation
list_summation:pairwise
8, 9, 0, 8
8+9=17 ; 0+8=8 ; 17+8=25
sorting_algorithms
sorting_algorithms:bubble-sort
5, 0, 8, 1, 2
[0,5,8,1,2] ; [0,5,1,8,2] ; [0,5,1,2,8] ; [0,1,5,2,8] ; [0,1,2,5,8]
linear_equation_solving
linear_equation_solving:inverse-ops
6x+42=54
6x+42=54 ; x=(54-42)/6 ; x=12/6 ; x=2
list_summation
list_summation:right-to-left
7, 6, 8, 1
8+1=9 ; 6+9=15 ; 7+15=22
multidigit_addition
multidigit_addition:right-to-left-carry
336+245
d2:6+5+0=11→w1,c1 ; d1:3+4+1=8→w8,c0 ; d0:3+2+0=5→w5,c0 ; sum=581
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,0) ; G=(3,2)
R:(2,1) ; R:(2,2) ; D:(3,2)
multidigit_addition
multidigit_addition:left-to-right-partials
924+664
p100:900+600=1500 ; p10:20+60=80 ; p1:4+4=8 ; sum=1500+80+8=1588
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+18=66
6x+18=66 ; 6x=48 ; x=8
list_summation
list_summation:right-to-left
7, 0, 4, 8
4+8=12 ; 0+12=12 ; 7+12=19
sorting_algorithms
sorting_algorithms:bubble-sort
5, 8, 9, 6, 3
[5,8,6,9,3] ; [5,8,6,3,9] ; [5,6,8,3,9] ; [5,6,3,8,9] ; [5,3,6,8,9] ; [3,5,6,8,9]
list_summation
list_summation:right-to-left
3, 4, 0, 0
0+0=0 ; 4+0=4 ; 3+4=7
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)
sorting_algorithms
sorting_algorithms:selection-sort
2, 0, 6, 1, 4
[0,2,6,1,4] ; [0,1,6,2,4] ; [0,1,2,6,4] ; [0,1,2,4,6]
linear_equation_solving
linear_equation_solving:inverse-ops
6x+36=-18
6x+36=-18 ; x=(-18-36)/6 ; x=-54/6 ; x=-9
list_summation
list_summation:left-to-right
0, 6, 3, 1
0+6=6 ; 6+3=9 ; 9+1=10
multidigit_addition
multidigit_addition:left-to-right-partials
612+673
p100:600+600=1200 ; p10:10+70=80 ; p1:2+3=5 ; sum=1200+80+5=1285
list_summation
list_summation:left-to-right
0, 5, 9, 8
0+5=5 ; 5+9=14 ; 14+8=22
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+27=-9
9x+27=-9 ; 9x=-36 ; x=-4
base_conversion
base_conversion:via-binary
n=155,base=8
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:3 ; CHUNK:2:3 ; OUT:233
list_summation
list_summation:pairwise
2, 7, 0, 1
2+7=9 ; 0+1=1 ; 9+1=10
multidigit_addition
multidigit_addition:left-to-right-partials
302+712
p100:300+700=1000 ; p10:0+10=10 ; p1:2+2=4 ; sum=1000+10+4=1014
list_summation
list_summation:left-to-right
1, 1, 1, 4
1+1=2 ; 2+1=3 ; 3+4=7
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-27=36
9x-27=36 ; x+-3=4 ; x=4--3 ; x=7
multidigit_addition
multidigit_addition:rounding-decomposition
590+153
round:590+153=743 ; adjust:743-0=743 ; sum=743
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(5,2)
R:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
list_summation
list_summation:pairwise
8, 5, 5, 7
8+5=13 ; 5+7=12 ; 13+12=25
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,2) ; G=(4,5)
D:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-40=-104
8x-40=-104 ; 8x=-64 ; x=-8
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,0) ; G=(5,5)
D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
multidigit_addition
multidigit_addition:left-to-right-partials
301+237
p100:300+200=500 ; p10:0+30=30 ; p1:1+7=8 ; sum=500+30+8=538
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,0) ; G=(5,4)
R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; D:(5,4)
sorting_algorithms
sorting_algorithms:insertion-sort
3, 1, 4, 7, 5
[1,3,4,7,5] ; [1,3,4,7,5] ; [1,3,4,7,5] ; [1,3,4,5,7]
sorting_algorithms
sorting_algorithms:selection-sort
7, 0, 9, 8, 5
[0,7,9,8,5] ; [0,5,9,8,7] ; [0,5,7,8,9] ; [0,5,7,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
144+724
d2:4+4+0=8→w8,c0 ; d1:4+2+0=6→w6,c0 ; d0:1+7+0=8→w8,c0 ; sum=868
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+21=28
7x+21=28 ; 7x=7 ; x=1
list_summation
list_summation:left-to-right
0, 7, 9, 1
0+7=7 ; 7+9=16 ; 16+1=17
list_summation
list_summation:left-to-right
9, 0, 5, 1
9+0=9 ; 9+5=14 ; 14+1=15
list_summation
list_summation:right-to-left
8, 1, 8, 5
8+5=13 ; 1+13=14 ; 8+14=22
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,1) ; G=(3,3)
D:(3,1) ; R:(3,2) ; R:(3,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,4) ; G=(4,5)
D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; R:(4,5)
base_conversion
base_conversion:via-binary
n=181,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:0 ; CHUNK:5:1 ; CHUNK:6:0 ; CHUNK:7:1 ; OUT:10110101
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,3) ; G=(5,5)
R:(0,4) ; D:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
base_conversion
base_conversion:decomposition
n=243,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:11110011
linear_equation_solving
linear_equation_solving:inverse-ops
8x+64=120
8x+64=120 ; x=(120-64)/8 ; x=56/8 ; x=7
sorting_algorithms
sorting_algorithms:insertion-sort
3, 9, 8, 0, 2
[3,9,8,0,2] ; [3,8,9,0,2] ; [0,3,8,9,2] ; [0,2,3,8,9]
list_summation
list_summation:pairwise
3, 6, 1, 1
3+6=9 ; 1+1=2 ; 9+2=11
base_conversion
base_conversion:repeated-division
n=232,base=2
DIV:232/2=116,r:0 ; DIV:116/2=58,r:0 ; DIV:58/2=29,r:0 ; DIV:29/2=14,r:1 ; DIV:14/2=7,r:0 ; DIV:7/2=3,r:1 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11101000
base_conversion
base_conversion:repeated-division
n=227,base=16
DIV:227/16=14,r:3 ; DIV:14/16=0,r:14 ; OUT:E3
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-9=72
9x-9=72 ; x+-1=8 ; x=8--1 ; x=9
list_summation
list_summation:left-to-right
2, 8, 8, 0
2+8=10 ; 10+8=18 ; 18+0=18
sorting_algorithms
sorting_algorithms:insertion-sort
0, 3, 4, 7, 5
[0,3,4,7,5] ; [0,3,4,7,5] ; [0,3,4,7,5] ; [0,3,4,5,7]
sorting_algorithms
sorting_algorithms:selection-sort
8, 7, 3, 5, 2
[2,7,3,5,8] ; [2,3,7,5,8] ; [2,3,5,7,8] ; [2,3,5,7,8]
list_summation
list_summation:left-to-right
8, 3, 3, 8
8+3=11 ; 11+3=14 ; 14+8=22
linear_equation_solving
linear_equation_solving:inverse-ops
6x+54=18
6x+54=18 ; x=(18-54)/6 ; x=-36/6 ; x=-6
sorting_algorithms
sorting_algorithms:merge-sort
8, 9, 7, 2, 5
[8,9,2,7,5] ; [2,7,8,9,5] ; [2,5,7,8,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,1) ; G=(5,3)
R:(1,2) ; R:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,0) ; G=(5,4)
R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,4) ; G=(5,5)
R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(4,2)
R:(0,2) ; D:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2)
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+12=0
2x+12=0 ; 2x=-12 ; x=-6
linear_equation_solving
linear_equation_solving:inverse-ops
6x+48=24
6x+48=24 ; x=(24-48)/6 ; x=-24/6 ; x=-4
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,1) ; G=(4,4)
D:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(3,5)
R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5)
multidigit_addition
multidigit_addition:left-to-right-partials
834+785
p100:800+700=1500 ; p10:30+80=110 ; p1:4+5=9 ; sum=1500+110+9=1619
multidigit_addition
multidigit_addition:rounding-decomposition
528+938
round:530+938=1468 ; adjust:1468-2=1466 ; sum=1466
linear_equation_solving
linear_equation_solving:inverse-ops
2x+10=10
2x+10=10 ; x=(10-10)/2 ; x=0/2 ; x=0
multidigit_addition
multidigit_addition:right-to-left-carry
791+962
d2:1+2+0=3→w3,c0 ; d1:9+6+0=15→w5,c1 ; d0:7+9+1=17→w7,c1 ; sum=1753
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-42=-49
7x-42=-49 ; x+-6=-7 ; x=-7--6 ; x=-1
linear_equation_solving
linear_equation_solving:inverse-ops
5x-30=-30
5x-30=-30 ; x=(-30--30)/5 ; x=0/5 ; x=0
sorting_algorithms
sorting_algorithms:insertion-sort
9, 1, 4, 5, 6
[1,9,4,5,6] ; [1,4,9,5,6] ; [1,4,5,9,6] ; [1,4,5,6,9]
base_conversion
base_conversion:via-binary
n=209,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:0 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:1 ; OUT:11010001
multidigit_addition
multidigit_addition:rounding-decomposition
918+658
round:920+658=1578 ; adjust:1578-2=1576 ; sum=1576