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:right-to-left
6, 2, 5, 6
5+6=11 ; 2+11=13 ; 6+13=19
list_summation
list_summation:left-to-right
0, 7, 3, 6
0+7=7 ; 7+3=10 ; 10+6=16
sorting_algorithms
sorting_algorithms:heap-sort
3, 0, 2, 6, 7
[3,7,2,6,0] ; [7,3,2,6,0] ; [7,6,2,3,0] ; [0,6,2,3,7] ; [6,0,2,3,7] ; [6,3,2,0,7] ; [0,3,2,6,7] ; [3,0,2,6,7] ; [2,0,3,6,7] ; [0,2,3,6,7]
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-35=-10
5x-35=-10 ; 5x=25 ; x=5
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+63=135
9x+63=135 ; x+7=15 ; x=15-7 ; x=8
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,1) ; G=(5,3)
D:(1,1) ; D:(2,1) ; D:(3,1) ; D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3)
list_summation
list_summation:left-to-right
3, 5, 4, 2
3+5=8 ; 8+4=12 ; 12+2=14
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,1) ; G=(4,5)
R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5) ; D:(4,5)
sorting_algorithms
sorting_algorithms:heap-sort
0, 8, 7, 1, 3
[8,0,7,1,3] ; [8,3,7,1,0] ; [0,3,7,1,8] ; [7,3,0,1,8] ; [1,3,0,7,8] ; [3,1,0,7,8] ; [0,1,3,7,8] ; [1,0,3,7,8] ; [0,1,3,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
7x-7=-14
7x-7=-14 ; x=(-14--7)/7 ; x=-7/7 ; x=-1
base_conversion
base_conversion:repeated-division
n=212,base=4
DIV:212/4=53,r:0 ; DIV:53/4=13,r:1 ; DIV:13/4=3,r:1 ; DIV:3/4=0,r:3 ; OUT:3110
list_summation
list_summation:right-to-left
2, 1, 5, 6
5+6=11 ; 1+11=12 ; 2+12=14
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+54=0
9x+54=0 ; 9x=-54 ; x=-6
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-12=-24
6x-12=-24 ; 6x=-12 ; x=-2
list_summation
list_summation:left-to-right
5, 8, 8, 2
5+8=13 ; 13+8=21 ; 21+2=23
linear_equation_solving
linear_equation_solving:inverse-ops
4x-20=-28
4x-20=-28 ; x=(-28--20)/4 ; x=-8/4 ; x=-2
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,2)
D:(5,1) ; R:(5,2)
list_summation
list_summation:pairwise
9, 2, 5, 1
9+2=11 ; 5+1=6 ; 11+6=17
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,2) ; G=(4,3)
D:(3,2) ; D:(4,2) ; R:(4,3)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,1) ; G=(5,2)
R:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
multidigit_addition
multidigit_addition:right-to-left-carry
443+851
d2:3+1+0=4→w4,c0 ; d1:4+5+0=9→w9,c0 ; d0:4+8+0=12→w2,c1 ; sum=1294
sorting_algorithms
sorting_algorithms:selection-sort
4, 3, 9, 0, 8
[0,3,9,4,8] ; [0,3,9,4,8] ; [0,3,4,9,8] ; [0,3,4,8,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,0) ; G=(1,5)
R:(0,1) ; D:(1,1) ; R:(1,2) ; R:(1,3) ; R:(1,4) ; R:(1,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,0) ; G=(3,3)
R:(1,1) ; D:(2,1) ; R:(2,2) ; D:(3,2) ; R:(3,3)
list_summation
list_summation:right-to-left
8, 1, 4, 2
4+2=6 ; 1+6=7 ; 8+7=15
multidigit_addition
multidigit_addition:left-to-right-partials
435+206
p100:400+200=600 ; p10:30+0=30 ; p1:5+6=11 ; sum=600+30+11=641
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-54=-84
6x-54=-84 ; 6x=-30 ; x=-5
list_summation
list_summation:left-to-right
5, 6, 3, 4
5+6=11 ; 11+3=14 ; 14+4=18
base_conversion
base_conversion:repeated-division
n=132,base=4
DIV:132/4=33,r:0 ; DIV:33/4=8,r:1 ; DIV:8/4=2,r:0 ; DIV:2/4=0,r:2 ; OUT:2010
sorting_algorithms
sorting_algorithms:selection-sort
7, 6, 4, 2, 0
[0,6,4,2,7] ; [0,2,4,6,7] ; [0,2,4,6,7] ; [0,2,4,6,7]
sorting_algorithms
sorting_algorithms:merge-sort
0, 7, 8, 5, 4
[0,7,5,8,4] ; [0,5,7,8,4] ; [0,4,5,7,8]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(5,5)
D:(4,4) ; D:(5,4) ; R:(5,5)
multidigit_addition
multidigit_addition:right-to-left-carry
361+733
d2:1+3+0=4→w4,c0 ; d1:6+3+0=9→w9,c0 ; d0:3+7+0=10→w0,c1 ; sum=1094
multidigit_addition
multidigit_addition:left-to-right-partials
840+161
p100:800+100=900 ; p10:40+60=100 ; p1:0+1=1 ; sum=900+100+1=1001
base_conversion
base_conversion:decomposition
n=185,base=4
TERM:2*4^3=128 ; TERM:3*4^2=48 ; TERM:2*4^1=8 ; TERM:1*4^0=1 ; OUT:2321
linear_equation_solving
linear_equation_solving:inverse-ops
8x+32=32
8x+32=32 ; x=(32-32)/8 ; x=0/8 ; x=0
base_conversion
base_conversion:via-binary
n=92,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:0 ; OUT:1011100
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+54=102
6x+54=102 ; x+9=17 ; x=17-9 ; x=8
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(1,3)
D:(1,2) ; R:(1,3)
multidigit_addition
multidigit_addition:left-to-right-partials
506+131
p100:500+100=600 ; p10:0+30=30 ; p1:6+1=7 ; sum=600+30+7=637
sorting_algorithms
sorting_algorithms:insertion-sort
1, 7, 5, 0, 9
[1,7,5,0,9] ; [1,5,7,0,9] ; [0,1,5,7,9] ; [0,1,5,7,9]
sorting_algorithms
sorting_algorithms:heap-sort
1, 9, 4, 7, 3
[9,1,4,7,3] ; [9,7,4,1,3] ; [3,7,4,1,9] ; [7,3,4,1,9] ; [1,3,4,7,9] ; [4,3,1,7,9] ; [1,3,4,7,9] ; [3,1,4,7,9] ; [1,3,4,7,9]
base_conversion
base_conversion:via-binary
n=57,base=16
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:9 ; OUT:39
linear_equation_solving
linear_equation_solving:inverse-ops
6x+36=84
6x+36=84 ; x=(84-36)/6 ; x=48/6 ; x=8
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+45=9
9x+45=9 ; x+5=1 ; x=1-5 ; x=-4
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+36=78
6x+36=78 ; 6x=42 ; x=7
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-40=-30
5x-40=-30 ; 5x=10 ; x=2
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,3) ; G=(4,4)
D:(3,3) ; D:(4,3) ; R:(4,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-16=-8
2x-16=-8 ; 2x=8 ; x=4
multidigit_addition
multidigit_addition:rounding-decomposition
133+871
round:140+871=1011 ; adjust:1011-7=1004 ; sum=1004
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+72=117
9x+72=117 ; x+8=13 ; x=13-8 ; x=5
base_conversion
base_conversion:decomposition
n=60,base=2
TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:0*2^1=0 ; TERM:0*2^0=0 ; OUT:111100
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,2) ; G=(3,5)
R:(2,3) ; D:(3,3) ; R:(3,4) ; R:(3,5)
sorting_algorithms
sorting_algorithms:bubble-sort
9, 4, 0, 5, 3
[4,9,0,5,3] ; [4,0,9,5,3] ; [4,0,5,9,3] ; [4,0,5,3,9] ; [0,4,5,3,9] ; [0,4,3,5,9] ; [0,3,4,5,9]
sorting_algorithms
sorting_algorithms:bubble-sort
6, 4, 8, 3, 7
[4,6,8,3,7] ; [4,6,3,8,7] ; [4,6,3,7,8] ; [4,3,6,7,8] ; [3,4,6,7,8]
sorting_algorithms
sorting_algorithms:heap-sort
0, 2, 1, 8, 4
[0,8,1,2,4] ; [8,0,1,2,4] ; [8,4,1,2,0] ; [0,4,1,2,8] ; [4,0,1,2,8] ; [4,2,1,0,8] ; [0,2,1,4,8] ; [2,0,1,4,8] ; [1,0,2,4,8] ; [0,1,2,4,8]
sorting_algorithms
sorting_algorithms:bubble-sort
1, 6, 4, 2, 3
[1,4,6,2,3] ; [1,4,2,6,3] ; [1,4,2,3,6] ; [1,2,4,3,6] ; [1,2,3,4,6]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(5,1)
R:(3,1) ; D:(4,1) ; D:(5,1)
list_summation
list_summation:right-to-left
1, 1, 1, 9
1+9=10 ; 1+10=11 ; 1+11=12
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-40=-75
5x-40=-75 ; x+-8=-15 ; x=-15--8 ; x=-7
base_conversion
base_conversion:decomposition
n=197,base=8
TERM:3*8^2=192 ; TERM:0*8^1=0 ; TERM:5*8^0=5 ; OUT:305
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)
base_conversion
base_conversion:decomposition
n=182,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:10110110
base_conversion
base_conversion:decomposition
n=249,base=16
TERM:15*16^1=240 ; TERM:9*16^0=9 ; OUT:F9
multidigit_addition
multidigit_addition:right-to-left-carry
817+496
d2:7+6+0=13→w3,c1 ; d1:1+9+1=11→w1,c1 ; d0:8+4+1=13→w3,c1 ; sum=1313
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+16=-56
8x+16=-56 ; 8x=-72 ; x=-9
list_summation
list_summation:right-to-left
0, 7, 2, 3
2+3=5 ; 7+5=12 ; 0+12=12
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)
sorting_algorithms
sorting_algorithms:insertion-sort
6, 3, 5, 9, 1
[3,6,5,9,1] ; [3,5,6,9,1] ; [3,5,6,9,1] ; [1,3,5,6,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,4) ; G=(1,5)
R:(0,5) ; D:(1,5)
sorting_algorithms
sorting_algorithms:merge-sort
0, 6, 1, 2, 7
[0,1,2,6,7]
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+12=0
3x+12=0 ; 3x=-12 ; x=-4
list_summation
list_summation:left-to-right
1, 3, 5, 8
1+3=4 ; 4+5=9 ; 9+8=17
multidigit_addition
multidigit_addition:right-to-left-carry
155+443
d2:5+3+0=8→w8,c0 ; d1:5+4+0=9→w9,c0 ; d0:1+4+0=5→w5,c0 ; sum=598
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(4,3)
R:(3,1) ; R:(3,2) ; R:(3,3) ; D:(4,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,4) ; G=(4,5)
R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
multidigit_addition
multidigit_addition:right-to-left-carry
778+227
d2:8+7+0=15→w5,c1 ; d1:7+2+1=10→w0,c1 ; d0:7+2+1=10→w0,c1 ; sum=1005
base_conversion
base_conversion:decomposition
n=214,base=16
TERM:13*16^1=208 ; TERM:6*16^0=6 ; OUT:D6
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-18=-18
2x-18=-18 ; 2x=0 ; x=0
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+10=14
2x+10=14 ; 2x=4 ; x=2
sorting_algorithms
sorting_algorithms:bubble-sort
5, 2, 3, 0, 6
[2,5,3,0,6] ; [2,3,5,0,6] ; [2,3,0,5,6] ; [2,0,3,5,6] ; [0,2,3,5,6]
linear_equation_solving
linear_equation_solving:inverse-ops
6x+30=6
6x+30=6 ; x=(6-30)/6 ; x=-24/6 ; x=-4
base_conversion
base_conversion:repeated-division
n=167,base=2
DIV:167/2=83,r:1 ; DIV:83/2=41,r:1 ; DIV:41/2=20,r:1 ; DIV:20/2=10,r:0 ; 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:10100111
sorting_algorithms
sorting_algorithms:selection-sort
6, 9, 2, 0, 3
[0,9,2,6,3] ; [0,2,9,6,3] ; [0,2,3,6,9] ; [0,2,3,6,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+0=64
8x+0=64 ; 8x=64 ; x=8
list_summation
list_summation:left-to-right
3, 9, 5, 0
3+9=12 ; 12+5=17 ; 17+0=17
linear_equation_solving
linear_equation_solving:inverse-ops
5x+20=5
5x+20=5 ; x=(5-20)/5 ; x=-15/5 ; x=-3
sorting_algorithms
sorting_algorithms:insertion-sort
9, 6, 3, 8, 7
[6,9,3,8,7] ; [3,6,9,8,7] ; [3,6,8,9,7] ; [3,6,7,8,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)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,0) ; G=(5,3)
D:(3,0) ; D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,4) ; G=(1,5)
R:(0,5) ; D:(1,5)
list_summation
list_summation:right-to-left
8, 4, 0, 8
0+8=8 ; 4+8=12 ; 8+12=20
sorting_algorithms
sorting_algorithms:insertion-sort
5, 9, 0, 6, 3
[5,9,0,6,3] ; [0,5,9,6,3] ; [0,5,6,9,3] ; [0,3,5,6,9]
base_conversion
base_conversion:via-binary
n=72,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:0 ; CHUNK:5:0 ; CHUNK:6:0 ; OUT:1001000
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-36=-72
4x-36=-72 ; 4x=-36 ; x=-9
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(4,4)
R:(0,3) ; R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4)
list_summation
list_summation:right-to-left
8, 8, 9, 9
9+9=18 ; 8+18=26 ; 8+26=34
linear_equation_solving
linear_equation_solving:inverse-ops
6x-36=-54
6x-36=-54 ; x=(-54--36)/6 ; x=-18/6 ; x=-3
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-3=-6
3x-3=-6 ; x+-1=-2 ; x=-2--1 ; x=-1