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
9, 6, 4, 5, 8
[9,8,4,5,6] ; [6,8,4,5,9] ; [8,6,4,5,9] ; [5,6,4,8,9] ; [6,5,4,8,9] ; [4,5,6,8,9] ; [5,4,6,8,9] ; [4,5,6,8,9]
list_summation
list_summation:left-to-right
5, 3, 0, 1
5+3=8 ; 8+0=8 ; 8+1=9
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,2) ; G=(3,4)
R:(0,3) ; D:(1,3) ; R:(1,4) ; D:(2,4) ; D:(3,4)
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+72=144
9x+72=144 ; x+8=16 ; x=16-8 ; x=8
sorting_algorithms
sorting_algorithms:insertion-sort
0, 2, 9, 7, 8
[0,2,9,7,8] ; [0,2,9,7,8] ; [0,2,7,9,8] ; [0,2,7,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
594+284
d2:4+4+0=8→w8,c0 ; d1:9+8+0=17→w7,c1 ; d0:5+2+1=8→w8,c0 ; sum=878
list_summation
list_summation:right-to-left
5, 4, 1, 0
1+0=1 ; 4+1=5 ; 5+5=10
linear_equation_solving
linear_equation_solving:inverse-ops
3x+18=12
3x+18=12 ; x=(12-18)/3 ; x=-6/3 ; x=-2
sorting_algorithms
sorting_algorithms:heap-sort
3, 1, 9, 7, 0
[3,7,9,1,0] ; [9,7,3,1,0] ; [0,7,3,1,9] ; [7,0,3,1,9] ; [7,1,3,0,9] ; [0,1,3,7,9] ; [3,1,0,7,9] ; [0,1,3,7,9] ; [1,0,3,7,9] ; [0,1,3,7,9]
multidigit_addition
multidigit_addition:left-to-right-partials
617+833
p100:600+800=1400 ; p10:10+30=40 ; p1:7+3=10 ; sum=1400+40+10=1450
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(3,1)
R:(2,1) ; D:(3,1)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(2,5)
R:(0,5) ; D:(1,5) ; D:(2,5)
base_conversion
base_conversion:decomposition
n=50,base=16
TERM:3*16^1=48 ; TERM:2*16^0=2 ; OUT:32
list_summation
list_summation:right-to-left
2, 7, 2, 3
2+3=5 ; 7+5=12 ; 2+12=14
list_summation
list_summation:left-to-right
3, 1, 3, 1
3+1=4 ; 4+3=7 ; 7+1=8
sorting_algorithms
sorting_algorithms:insertion-sort
0, 4, 2, 5, 9
[0,4,2,5,9] ; [0,2,4,5,9] ; [0,2,4,5,9] ; [0,2,4,5,9]
base_conversion
base_conversion:decomposition
n=108,base=8
TERM:1*8^2=64 ; TERM:5*8^1=40 ; TERM:4*8^0=4 ; OUT:154
base_conversion
base_conversion:decomposition
n=180,base=16
TERM:11*16^1=176 ; TERM:4*16^0=4 ; OUT:B4
list_summation
list_summation:pairwise
5, 2, 5, 6
5+2=7 ; 5+6=11 ; 7+11=18
linear_equation_solving
linear_equation_solving:inverse-ops
7x+35=98
7x+35=98 ; x=(98-35)/7 ; x=63/7 ; x=9
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-72=-8
8x-72=-8 ; 8x=64 ; x=8
base_conversion
base_conversion:repeated-division
n=100,base=16
DIV:100/16=6,r:4 ; DIV:6/16=0,r:6 ; OUT:64
list_summation
list_summation:right-to-left
0, 0, 6, 2
6+2=8 ; 0+8=8 ; 0+8=8
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-10=-10
2x-10=-10 ; x+-5=-5 ; x=-5--5 ; x=0
sorting_algorithms
sorting_algorithms:selection-sort
6, 4, 0, 2, 9
[0,4,6,2,9] ; [0,2,6,4,9] ; [0,2,4,6,9] ; [0,2,4,6,9]
base_conversion
base_conversion:via-binary
n=16,base=2
BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; OUT:10000
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:right-first
grid=6 ; S=(2,3) ; G=(3,4)
R:(2,4) ; D:(3,4)
sorting_algorithms
sorting_algorithms:bubble-sort
7, 3, 1, 9, 5
[3,7,1,9,5] ; [3,1,7,9,5] ; [3,1,7,5,9] ; [1,3,7,5,9] ; [1,3,5,7,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:pairwise
1, 1, 1, 5
1+1=2 ; 1+5=6 ; 2+6=8
base_conversion
base_conversion:repeated-division
n=170,base=8
DIV:170/8=21,r:2 ; DIV:21/8=2,r:5 ; DIV:2/8=0,r:2 ; OUT:252
sorting_algorithms
sorting_algorithms:heap-sort
2, 1, 6, 5, 7
[2,7,6,5,1] ; [7,2,6,5,1] ; [7,5,6,2,1] ; [1,5,6,2,7] ; [6,5,1,2,7] ; [2,5,1,6,7] ; [5,2,1,6,7] ; [1,2,5,6,7] ; [2,1,5,6,7] ; [1,2,5,6,7]
base_conversion
base_conversion:via-binary
n=48,base=16
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:0 ; OUT:30
base_conversion
base_conversion:decomposition
n=45,base=4
TERM:2*4^2=32 ; TERM:3*4^1=12 ; TERM:1*4^0=1 ; OUT:231
multidigit_addition
multidigit_addition:right-to-left-carry
972+166
d2:2+6+0=8→w8,c0 ; d1:7+6+0=13→w3,c1 ; d0:9+1+1=11→w1,c1 ; sum=1138
list_summation
list_summation:pairwise
4, 3, 0, 1
4+3=7 ; 0+1=1 ; 7+1=8
linear_equation_solving
linear_equation_solving:inverse-ops
6x+6=0
6x+6=0 ; x=(0-6)/6 ; x=-6/6 ; x=-1
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(4,5)
D:(3,4) ; D:(4,4) ; R:(4,5)
multidigit_addition
multidigit_addition:rounding-decomposition
109+939
round:110+939=1049 ; adjust:1049-1=1048 ; sum=1048
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+8=20
4x+8=20 ; 4x=12 ; x=3
multidigit_addition
multidigit_addition:right-to-left-carry
961+741
d2:1+1+0=2→w2,c0 ; d1:6+4+0=10→w0,c1 ; d0:9+7+1=17→w7,c1 ; sum=1702
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=(1,0) ; G=(4,4)
R:(1,1) ; D:(2,1) ; R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; R:(4,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+63=72
9x+63=72 ; 9x=9 ; x=1
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,3) ; G=(5,4)
R:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-24=-48
8x-24=-48 ; 8x=-24 ; x=-3
base_conversion
base_conversion:repeated-division
n=246,base=8
DIV:246/8=30,r:6 ; DIV:30/8=3,r:6 ; DIV:3/8=0,r:3 ; OUT:366
sorting_algorithms
sorting_algorithms:heap-sort
2, 7, 9, 4, 3
[9,7,2,4,3] ; [3,7,2,4,9] ; [7,3,2,4,9] ; [7,4,2,3,9] ; [3,4,2,7,9] ; [4,3,2,7,9] ; [2,3,4,7,9] ; [3,2,4,7,9] ; [2,3,4,7,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(4,5)
D:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
sorting_algorithms
sorting_algorithms:selection-sort
0, 1, 7, 6, 5
[0,1,7,6,5] ; [0,1,7,6,5] ; [0,1,5,6,7] ; [0,1,5,6,7]
sorting_algorithms
sorting_algorithms:heap-sort
8, 0, 7, 3, 1
[8,3,7,0,1] ; [1,3,7,0,8] ; [7,3,1,0,8] ; [0,3,1,7,8] ; [3,0,1,7,8] ; [1,0,3,7,8] ; [0,1,3,7,8]
sorting_algorithms
sorting_algorithms:merge-sort
8, 6, 4, 1, 0
[6,8,4,1,0] ; [6,8,1,4,0] ; [1,4,6,8,0] ; [0,1,4,6,8]
sorting_algorithms
sorting_algorithms:bubble-sort
5, 2, 9, 4, 3
[2,5,9,4,3] ; [2,5,4,9,3] ; [2,5,4,3,9] ; [2,4,5,3,9] ; [2,4,3,5,9] ; [2,3,4,5,9]
sorting_algorithms
sorting_algorithms:bubble-sort
1, 7, 8, 3, 6
[1,7,3,8,6] ; [1,7,3,6,8] ; [1,3,7,6,8] ; [1,3,6,7,8]
multidigit_addition
multidigit_addition:left-to-right-partials
938+896
p100:900+800=1700 ; p10:30+90=120 ; p1:8+6=14 ; sum=1700+120+14=1834
base_conversion
base_conversion:decomposition
n=57,base=16
TERM:3*16^1=48 ; TERM:9*16^0=9 ; OUT:39
base_conversion
base_conversion:via-binary
n=180,base=16
BINLEN:8 ; CHUNK:0:11 ; CHUNK:1:4 ; OUT:B4
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,2) ; G=(5,5)
R:(4,3) ; R:(4,4) ; R:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,3)
D:(5,1) ; R:(5,2) ; R:(5,3)
list_summation
list_summation:right-to-left
4, 3, 1, 0
1+0=1 ; 3+1=4 ; 4+4=8
list_summation
list_summation:left-to-right
1, 1, 7, 8
1+1=2 ; 2+7=9 ; 9+8=17
multidigit_addition
multidigit_addition:left-to-right-partials
444+843
p100:400+800=1200 ; p10:40+40=80 ; p1:4+3=7 ; sum=1200+80+7=1287
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)
list_summation
list_summation:left-to-right
4, 4, 7, 1
4+4=8 ; 8+7=15 ; 15+1=16
list_summation
list_summation:left-to-right
2, 3, 8, 1
2+3=5 ; 5+8=13 ; 13+1=14
sorting_algorithms
sorting_algorithms:merge-sort
1, 3, 9, 4, 0
[1,3,4,9,0] ; [0,1,3,4,9]
linear_equation_solving
linear_equation_solving:inverse-ops
6x-48=-36
6x-48=-36 ; x=(-36--48)/6 ; x=12/6 ; x=2
multidigit_addition
multidigit_addition:rounding-decomposition
893+992
round:900+992=1892 ; adjust:1892-7=1885 ; sum=1885
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,0) ; G=(2,4)
D:(1,0) ; D:(2,0) ; R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4)
base_conversion
base_conversion:repeated-division
n=116,base=2
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:1110100
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-36=-48
4x-36=-48 ; 4x=-12 ; x=-3
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,1) ; G=(5,3)
R:(4,2) ; D:(5,2) ; R:(5,3)
base_conversion
base_conversion:repeated-division
n=41,base=16
DIV:41/16=2,r:9 ; DIV:2/16=0,r:2 ; OUT:29
sorting_algorithms
sorting_algorithms:merge-sort
8, 9, 4, 5, 3
[4,5,8,9,3] ; [3,4,5,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
996+820
d2:6+0+0=6→w6,c0 ; d1:9+2+0=11→w1,c1 ; d0:9+8+1=18→w8,c1 ; sum=1816
multidigit_addition
multidigit_addition:right-to-left-carry
753+347
d2:3+7+0=10→w0,c1 ; d1:5+4+1=10→w0,c1 ; d0:7+3+1=11→w1,c1 ; sum=1100
sorting_algorithms
sorting_algorithms:selection-sort
9, 6, 2, 3, 5
[2,6,9,3,5] ; [2,3,9,6,5] ; [2,3,5,6,9] ; [2,3,5,6,9]
base_conversion
base_conversion:via-binary
n=115,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:6 ; CHUNK:2:3 ; OUT:163
multidigit_addition
multidigit_addition:right-to-left-carry
247+451
d2:7+1+0=8→w8,c0 ; d1:4+5+0=9→w9,c0 ; d0:2+4+0=6→w6,c0 ; sum=698
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-32=4
4x-32=4 ; x+-8=1 ; x=1--8 ; x=9
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+12=60
6x+12=60 ; x+2=10 ; x=10-2 ; x=8
linear_equation_solving
linear_equation_solving:inverse-ops
4x+4=-16
4x+4=-16 ; x=(-16-4)/4 ; x=-20/4 ; x=-5
list_summation
list_summation:left-to-right
3, 1, 3, 3
3+1=4 ; 4+3=7 ; 7+3=10
multidigit_addition
multidigit_addition:left-to-right-partials
829+960
p100:800+900=1700 ; p10:20+60=80 ; p1:9+0=9 ; sum=1700+80+9=1789
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,1) ; G=(5,3)
R:(4,2) ; R:(4,3) ; D:(5,3)
base_conversion
base_conversion:decomposition
n=118,base=4
TERM:1*4^3=64 ; TERM:3*4^2=48 ; TERM:1*4^1=4 ; TERM:2*4^0=2 ; OUT:1312
base_conversion
base_conversion:via-binary
n=3,base=4
BINLEN:2 ; CHUNK:0:3 ; OUT:3
sorting_algorithms
sorting_algorithms:selection-sort
2, 4, 0, 8, 5
[0,4,2,8,5] ; [0,2,4,8,5] ; [0,2,4,8,5] ; [0,2,4,5,8]
multidigit_addition
multidigit_addition:left-to-right-partials
740+879
p100:700+800=1500 ; p10:40+70=110 ; p1:0+9=9 ; sum=1500+110+9=1619
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,4) ; G=(4,5)
R:(3,5) ; D:(4,5)
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)
multidigit_addition
multidigit_addition:right-to-left-carry
143+384
d2:3+4+0=7→w7,c0 ; d1:4+8+0=12→w2,c1 ; d0:1+3+1=5→w5,c0 ; sum=527
base_conversion
base_conversion:repeated-division
n=180,base=8
DIV:180/8=22,r:4 ; DIV:22/8=2,r:6 ; DIV:2/8=0,r:2 ; OUT:264
sorting_algorithms
sorting_algorithms:merge-sort
1, 4, 3, 2, 6
[1,4,2,3,6] ; [1,2,3,4,6]
base_conversion
base_conversion:via-binary
n=55,base=16
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:7 ; OUT:37
base_conversion
base_conversion:repeated-division
n=130,base=16
DIV:130/16=8,r:2 ; DIV:8/16=0,r:8 ; OUT:82
multidigit_addition
multidigit_addition:rounding-decomposition
151+864
round:160+864=1024 ; adjust:1024-9=1015 ; sum=1015
linear_equation_solving
linear_equation_solving:inverse-ops
8x+0=-16
8x+0=-16 ; x=(-16-0)/8 ; x=-16/8 ; x=-2
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+15=-3
3x+15=-3 ; 3x=-18 ; x=-6