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:left-to-right
3, 1, 9, 8
3+1=4 ; 4+9=13 ; 13+8=21
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(3,3)
R:(2,2) ; R:(2,3) ; D:(3,3)
multidigit_addition
multidigit_addition:left-to-right-partials
507+801
p100:500+800=1300 ; p10:0+0=0 ; p1:7+1=8 ; sum=1300+0+8=1308
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,2) ; G=(3,4)
R:(1,3) ; R:(1,4) ; D:(2,4) ; D:(3,4)
sorting_algorithms
sorting_algorithms:bubble-sort
3, 2, 8, 6, 9
[2,3,8,6,9] ; [2,3,6,8,9]
base_conversion
base_conversion:decomposition
n=254,base=4
TERM:3*4^3=192 ; TERM:3*4^2=48 ; TERM:3*4^1=12 ; TERM:2*4^0=2 ; OUT:3332
linear_equation_solving
linear_equation_solving:inverse-ops
8x+16=0
8x+16=0 ; x=(0-16)/8 ; x=-16/8 ; x=-2
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,2) ; G=(5,4)
R:(3,3) ; R:(3,4) ; D:(4,4) ; D:(5,4)
base_conversion
base_conversion:via-binary
n=234,base=16
BINLEN:8 ; CHUNK:0:14 ; CHUNK:1:10 ; OUT:EA
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-14=-16
2x-14=-16 ; 2x=-2 ; x=-1
sorting_algorithms
sorting_algorithms:heap-sort
6, 9, 5, 7, 3
[9,6,5,7,3] ; [9,7,5,6,3] ; [3,7,5,6,9] ; [7,3,5,6,9] ; [7,6,5,3,9] ; [3,6,5,7,9] ; [6,3,5,7,9] ; [5,3,6,7,9] ; [3,5,6,7,9]
multidigit_addition
multidigit_addition:rounding-decomposition
575+233
round:580+233=813 ; adjust:813-5=808 ; sum=808
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(3,5)
R:(2,1) ; D:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
multidigit_addition
multidigit_addition:left-to-right-partials
337+232
p100:300+200=500 ; p10:30+30=60 ; p1:7+2=9 ; sum=500+60+9=569
linear_equation_solving
linear_equation_solving:inverse-ops
4x-4=-40
4x-4=-40 ; x=(-40--4)/4 ; x=-36/4 ; x=-9
base_conversion
base_conversion:repeated-division
n=159,base=2
DIV:159/2=79,r:1 ; DIV:79/2=39,r:1 ; DIV:39/2=19,r:1 ; DIV:19/2=9,r:1 ; DIV:9/2=4,r:1 ; DIV:4/2=2,r:0 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:10011111
list_summation
list_summation:left-to-right
2, 3, 2, 0
2+3=5 ; 5+2=7 ; 7+0=7
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,2) ; G=(5,5)
R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:inverse-ops
2x+12=24
2x+12=24 ; x=(24-12)/2 ; x=12/2 ; x=6
list_summation
list_summation:left-to-right
0, 4, 2, 5
0+4=4 ; 4+2=6 ; 6+5=11
multidigit_addition
multidigit_addition:left-to-right-partials
329+318
p100:300+300=600 ; p10:20+10=30 ; p1:9+8=17 ; sum=600+30+17=647
linear_equation_solving
linear_equation_solving:inverse-ops
9x+36=81
9x+36=81 ; x=(81-36)/9 ; x=45/9 ; x=5
sorting_algorithms
sorting_algorithms:merge-sort
6, 5, 2, 9, 0
[5,6,2,9,0] ; [2,5,6,9,0] ; [0,2,5,6,9]
base_conversion
base_conversion:repeated-division
n=148,base=2
DIV:148/2=74,r:0 ; DIV:74/2=37,r:0 ; DIV:37/2=18,r:1 ; DIV:18/2=9,r:0 ; DIV:9/2=4,r:1 ; DIV:4/2=2,r:0 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:10010100
multidigit_addition
multidigit_addition:rounding-decomposition
982+322
round:990+322=1312 ; adjust:1312-8=1304 ; sum=1304
multidigit_addition
multidigit_addition:left-to-right-partials
781+750
p100:700+700=1400 ; p10:80+50=130 ; p1:1+0=1 ; sum=1400+130+1=1531
list_summation
list_summation:pairwise
6, 7, 8, 1
6+7=13 ; 8+1=9 ; 13+9=22
list_summation
list_summation:right-to-left
7, 5, 4, 6
4+6=10 ; 5+10=15 ; 7+15=22
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+3=-6
3x+3=-6 ; 3x=-9 ; x=-3
base_conversion
base_conversion:via-binary
n=13,base=2
BINLEN:4 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; OUT:1101
sorting_algorithms
sorting_algorithms:heap-sort
0, 9, 6, 8, 5
[9,0,6,8,5] ; [9,8,6,0,5] ; [5,8,6,0,9] ; [8,5,6,0,9] ; [0,5,6,8,9] ; [6,5,0,8,9] ; [0,5,6,8,9] ; [5,0,6,8,9] ; [0,5,6,8,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+18=-9
3x+18=-9 ; 3x=-27 ; x=-9
base_conversion
base_conversion:decomposition
n=88,base=4
TERM:1*4^3=64 ; TERM:1*4^2=16 ; TERM:2*4^1=8 ; TERM:0*4^0=0 ; OUT:1120
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,2) ; G=(5,3)
D:(5,2) ; R:(5,3)
grid_pathfinding
grid_pathfinding:alternating
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)
sorting_algorithms
sorting_algorithms:insertion-sort
1, 2, 5, 9, 7
[1,2,5,9,7] ; [1,2,5,9,7] ; [1,2,5,9,7] ; [1,2,5,7,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-4=-12
4x-4=-12 ; 4x=-8 ; x=-2
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(2,3)
D:(2,2) ; R:(2,3)
sorting_algorithms
sorting_algorithms:merge-sort
9, 4, 0, 6, 7
[4,9,0,6,7] ; [0,4,6,9,7] ; [0,4,6,7,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(3,5)
R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5)
base_conversion
base_conversion:decomposition
n=221,base=4
TERM:3*4^3=192 ; TERM:1*4^2=16 ; TERM:3*4^1=12 ; TERM:1*4^0=1 ; OUT:3131
sorting_algorithms
sorting_algorithms:heap-sort
5, 3, 2, 6, 8
[5,8,2,6,3] ; [8,5,2,6,3] ; [8,6,2,5,3] ; [3,6,2,5,8] ; [6,3,2,5,8] ; [6,5,2,3,8] ; [3,5,2,6,8] ; [5,3,2,6,8] ; [2,3,5,6,8] ; [3,2,5,6,8] ; [2,3,5,6,8]
linear_equation_solving
linear_equation_solving:inverse-ops
5x+20=-25
5x+20=-25 ; x=(-25-20)/5 ; x=-45/5 ; x=-9
base_conversion
base_conversion:decomposition
n=217,base=16
TERM:13*16^1=208 ; TERM:9*16^0=9 ; OUT:D9
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+63=135
9x+63=135 ; 9x=72 ; x=8
base_conversion
base_conversion:via-binary
n=186,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:1 ; CHUNK:7:0 ; OUT:10111010
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
sorting_algorithms
sorting_algorithms:bubble-sort
3, 1, 8, 7, 9
[1,3,8,7,9] ; [1,3,7,8,9]
base_conversion
base_conversion:repeated-division
n=17,base=8
DIV:17/8=2,r:1 ; DIV:2/8=0,r:2 ; OUT:21
sorting_algorithms
sorting_algorithms:bubble-sort
3, 8, 9, 4, 6
[3,8,4,9,6] ; [3,8,4,6,9] ; [3,4,8,6,9] ; [3,4,6,8,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-28=-28
4x-28=-28 ; 4x=0 ; x=0
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,0) ; G=(5,4)
R:(3,1) ; D:(4,1) ; R:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4)
multidigit_addition
multidigit_addition:left-to-right-partials
945+450
p100:900+400=1300 ; p10:40+50=90 ; p1:5+0=5 ; sum=1300+90+5=1395
base_conversion
base_conversion:decomposition
n=110,base=16
TERM:6*16^1=96 ; TERM:14*16^0=14 ; OUT:6E
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(3,3)
R:(1,2) ; D:(2,2) ; R:(2,3) ; D:(3,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,1) ; G=(4,4)
D:(3,1) ; D:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4)
multidigit_addition
multidigit_addition:left-to-right-partials
359+169
p100:300+100=400 ; p10:50+60=110 ; p1:9+9=18 ; sum=400+110+18=528
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,1) ; G=(4,5)
D:(3,1) ; D:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(4,4)
R:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,3) ; G=(3,4)
R:(2,4) ; D:(3,4)
list_summation
list_summation:left-to-right
9, 4, 8, 7
9+4=13 ; 13+8=21 ; 21+7=28
sorting_algorithms
sorting_algorithms:bubble-sort
7, 5, 9, 4, 2
[5,7,9,4,2] ; [5,7,4,9,2] ; [5,7,4,2,9] ; [5,4,7,2,9] ; [5,4,2,7,9] ; [4,5,2,7,9] ; [4,2,5,7,9] ; [2,4,5,7,9]
multidigit_addition
multidigit_addition:right-to-left-carry
706+270
d2:6+0+0=6→w6,c0 ; d1:0+7+0=7→w7,c0 ; d0:7+2+0=9→w9,c0 ; sum=976
list_summation
list_summation:right-to-left
5, 9, 3, 8
3+8=11 ; 9+11=20 ; 5+20=25
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+12=3
3x+12=3 ; x+4=1 ; x=1-4 ; x=-3
sorting_algorithms
sorting_algorithms:insertion-sort
2, 8, 5, 6, 3
[2,8,5,6,3] ; [2,5,8,6,3] ; [2,5,6,8,3] ; [2,3,5,6,8]
sorting_algorithms
sorting_algorithms:insertion-sort
8, 6, 1, 0, 2
[6,8,1,0,2] ; [1,6,8,0,2] ; [0,1,6,8,2] ; [0,1,2,6,8]
base_conversion
base_conversion:decomposition
n=149,base=8
TERM:2*8^2=128 ; TERM:2*8^1=16 ; TERM:5*8^0=5 ; OUT:225
sorting_algorithms
sorting_algorithms:bubble-sort
8, 1, 4, 5, 9
[1,8,4,5,9] ; [1,4,8,5,9] ; [1,4,5,8,9]
base_conversion
base_conversion:via-binary
n=219,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:3 ; CHUNK:2:3 ; OUT:333
linear_equation_solving
linear_equation_solving:inverse-ops
3x-9=0
3x-9=0 ; x=(0--9)/3 ; x=9/3 ; x=3
list_summation
list_summation:pairwise
4, 6, 5, 2
4+6=10 ; 5+2=7 ; 10+7=17
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:down-first
grid=6 ; S=(0,4) ; G=(3,5)
D:(1,4) ; D:(2,4) ; D:(3,4) ; R:(3,5)
base_conversion
base_conversion:repeated-division
n=182,base=8
DIV:182/8=22,r:6 ; DIV:22/8=2,r:6 ; DIV:2/8=0,r:2 ; OUT:266
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,1) ; G=(4,2)
R:(3,2) ; D:(4,2)
base_conversion
base_conversion:repeated-division
n=130,base=16
DIV:130/16=8,r:2 ; DIV:8/16=0,r:8 ; OUT:82
base_conversion
base_conversion:decomposition
n=72,base=16
TERM:4*16^1=64 ; TERM:8*16^0=8 ; OUT:48
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-45=-63
9x-45=-63 ; x+-5=-7 ; x=-7--5 ; x=-2
multidigit_addition
multidigit_addition:right-to-left-carry
419+470
d2:9+0+0=9→w9,c0 ; d1:1+7+0=8→w8,c0 ; d0:4+4+0=8→w8,c0 ; sum=889
multidigit_addition
multidigit_addition:left-to-right-partials
111+285
p100:100+200=300 ; p10:10+80=90 ; p1:1+5=6 ; sum=300+90+6=396
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+10=30
5x+10=30 ; x+2=6 ; x=6-2 ; x=4
linear_equation_solving
linear_equation_solving:inverse-ops
8x+32=-8
8x+32=-8 ; x=(-8-32)/8 ; x=-40/8 ; x=-5
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,4) ; G=(4,5)
D:(2,4) ; D:(3,4) ; D:(4,4) ; R:(4,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,2) ; G=(5,3)
R:(3,3) ; D:(4,3) ; D:(5,3)
list_summation
list_summation:right-to-left
8, 5, 4, 1
4+1=5 ; 5+5=10 ; 8+10=18
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x-72=-27
9x-72=-27 ; 9x=45 ; x=5
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(3,5)
R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+12=33
3x+12=33 ; 3x=21 ; x=7
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+36=18
6x+36=18 ; 6x=-18 ; x=-3
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+36=54
9x+36=54 ; 9x=18 ; x=2
base_conversion
base_conversion:decomposition
n=30,base=4
TERM:1*4^2=16 ; TERM:3*4^1=12 ; TERM:2*4^0=2 ; OUT:132
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-6=10
2x-6=10 ; 2x=16 ; x=8
sorting_algorithms
sorting_algorithms:heap-sort
5, 4, 2, 7, 8
[5,8,2,7,4] ; [8,5,2,7,4] ; [8,7,2,5,4] ; [4,7,2,5,8] ; [7,4,2,5,8] ; [7,5,2,4,8] ; [4,5,2,7,8] ; [5,4,2,7,8] ; [2,4,5,7,8] ; [4,2,5,7,8] ; [2,4,5,7,8]
sorting_algorithms
sorting_algorithms:insertion-sort
9, 3, 7, 5, 0
[3,9,7,5,0] ; [3,7,9,5,0] ; [3,5,7,9,0] ; [0,3,5,7,9]
list_summation
list_summation:left-to-right
4, 5, 1, 0
4+5=9 ; 9+1=10 ; 10+0=10
sorting_algorithms
sorting_algorithms:insertion-sort
7, 9, 5, 1, 4
[7,9,5,1,4] ; [5,7,9,1,4] ; [1,5,7,9,4] ; [1,4,5,7,9]
list_summation
list_summation:left-to-right
0, 3, 9, 5
0+3=3 ; 3+9=12 ; 12+5=17
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-5=-35
5x-5=-35 ; 5x=-30 ; x=-6