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
base_conversion
base_conversion:decomposition
n=139,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:10001011
sorting_algorithms
sorting_algorithms:heap-sort
2, 1, 8, 4, 6
[2,6,8,4,1] ; [8,6,2,4,1] ; [1,6,2,4,8] ; [6,1,2,4,8] ; [6,4,2,1,8] ; [1,4,2,6,8] ; [4,1,2,6,8] ; [2,1,4,6,8] ; [1,2,4,6,8]
list_summation
list_summation:right-to-left
4, 2, 1, 7
1+7=8 ; 2+8=10 ; 4+10=14
base_conversion
base_conversion:via-binary
n=157,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:1 ; CHUNK:2:3 ; CHUNK:3:1 ; OUT:2131
multidigit_addition
multidigit_addition:rounding-decomposition
556+756
round:560+756=1316 ; adjust:1316-4=1312 ; sum=1312
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(1,4)
D:(1,2) ; R:(1,3) ; R:(1,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,2) ; G=(2,5)
R:(1,3) ; D:(2,3) ; R:(2,4) ; R:(2,5)
sorting_algorithms
sorting_algorithms:bubble-sort
9, 7, 5, 1, 2
[7,9,5,1,2] ; [7,5,9,1,2] ; [7,5,1,9,2] ; [7,5,1,2,9] ; [5,7,1,2,9] ; [5,1,7,2,9] ; [5,1,2,7,9] ; [1,5,2,7,9] ; [1,2,5,7,9]
list_summation
list_summation:pairwise
6, 6, 7, 7
6+6=12 ; 7+7=14 ; 12+14=26
sorting_algorithms
sorting_algorithms:insertion-sort
6, 3, 1, 0, 9
[3,6,1,0,9] ; [1,3,6,0,9] ; [0,1,3,6,9] ; [0,1,3,6,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
list_summation
list_summation:right-to-left
7, 8, 6, 0
6+0=6 ; 8+6=14 ; 7+14=21
list_summation
list_summation:right-to-left
8, 6, 0, 0
0+0=0 ; 6+0=6 ; 8+6=14
base_conversion
base_conversion:decomposition
n=65,base=8
TERM:1*8^2=64 ; TERM:0*8^1=0 ; TERM:1*8^0=1 ; OUT:101
multidigit_addition
multidigit_addition:rounding-decomposition
634+803
round:640+803=1443 ; adjust:1443-6=1437 ; sum=1437
list_summation
list_summation:left-to-right
3, 1, 2, 1
3+1=4 ; 4+2=6 ; 6+1=7
list_summation
list_summation:right-to-left
3, 4, 5, 7
5+7=12 ; 4+12=16 ; 3+16=19
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,5)
D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+15=-15
5x+15=-15 ; x+3=-3 ; x=-3-3 ; x=-6
base_conversion
base_conversion:repeated-division
n=98,base=2
DIV:98/2=49,r:0 ; DIV:49/2=24,r:1 ; DIV:24/2=12,r:0 ; 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:1100010
list_summation
list_summation:pairwise
5, 2, 8, 3
5+2=7 ; 8+3=11 ; 7+11=18
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,4)
D:(5,3) ; R:(5,4)
base_conversion
base_conversion:decomposition
n=132,base=16
TERM:8*16^1=128 ; TERM:4*16^0=4 ; OUT:84
base_conversion
base_conversion:decomposition
n=235,base=16
TERM:14*16^1=224 ; TERM:11*16^0=11 ; OUT:EB
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,1) ; G=(5,4)
D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4)
base_conversion
base_conversion:decomposition
n=86,base=4
TERM:1*4^3=64 ; TERM:1*4^2=16 ; TERM:1*4^1=4 ; TERM:2*4^0=2 ; OUT:1112
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
linear_equation_solving
linear_equation_solving:inverse-ops
9x+81=162
9x+81=162 ; x=(162-81)/9 ; x=81/9 ; x=9
list_summation
list_summation:right-to-left
1, 8, 3, 6
3+6=9 ; 8+9=17 ; 1+17=18
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,3) ; G=(3,4)
R:(1,4) ; D:(2,4) ; D:(3,4)
base_conversion
base_conversion:repeated-division
n=112,base=16
DIV:112/16=7,r:0 ; DIV:7/16=0,r:7 ; OUT:70
multidigit_addition
multidigit_addition:rounding-decomposition
576+831
round:580+831=1411 ; adjust:1411-4=1407 ; sum=1407
linear_equation_solving
linear_equation_solving:inverse-ops
3x-27=-18
3x-27=-18 ; x=(-18--27)/3 ; x=9/3 ; x=3
list_summation
list_summation:pairwise
8, 0, 3, 2
8+0=8 ; 3+2=5 ; 8+5=13
sorting_algorithms
sorting_algorithms:bubble-sort
8, 3, 7, 6, 1
[3,8,7,6,1] ; [3,7,8,6,1] ; [3,7,6,8,1] ; [3,7,6,1,8] ; [3,6,7,1,8] ; [3,6,1,7,8] ; [3,1,6,7,8] ; [1,3,6,7,8]
list_summation
list_summation:left-to-right
0, 8, 9, 1
0+8=8 ; 8+9=17 ; 17+1=18
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,3) ; G=(5,5)
D:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3) ; R:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(4,2)
R:(3,1) ; R:(3,2) ; D:(4,2)
list_summation
list_summation:left-to-right
3, 5, 3, 0
3+5=8 ; 8+3=11 ; 11+0=11
linear_equation_solving
linear_equation_solving:inverse-ops
9x-54=-90
9x-54=-90 ; x=(-90--54)/9 ; x=-36/9 ; x=-4
sorting_algorithms
sorting_algorithms:selection-sort
5, 4, 2, 1, 0
[0,4,2,1,5] ; [0,1,2,4,5] ; [0,1,2,4,5] ; [0,1,2,4,5]
base_conversion
base_conversion:repeated-division
n=80,base=4
DIV:80/4=20,r:0 ; DIV:20/4=5,r:0 ; DIV:5/4=1,r:1 ; DIV:1/4=0,r:1 ; OUT:1100
linear_equation_solving
linear_equation_solving:inverse-ops
6x-18=-12
6x-18=-12 ; x=(-12--18)/6 ; x=6/6 ; x=1
linear_equation_solving
linear_equation_solving:inverse-ops
4x-12=-36
4x-12=-36 ; x=(-36--12)/4 ; x=-24/4 ; x=-6
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+9=6
3x+9=6 ; x+3=2 ; x=2-3 ; x=-1
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,4) ; G=(3,5)
R:(1,5) ; D:(2,5) ; D:(3,5)
sorting_algorithms
sorting_algorithms:heap-sort
9, 0, 1, 7, 2
[9,7,1,0,2] ; [2,7,1,0,9] ; [7,2,1,0,9] ; [0,2,1,7,9] ; [2,0,1,7,9] ; [1,0,2,7,9] ; [0,1,2,7,9]
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:left-to-right
1, 3, 0, 9
1+3=4 ; 4+0=4 ; 4+9=13
sorting_algorithms
sorting_algorithms:merge-sort
2, 0, 7, 5, 1
[0,2,7,5,1] ; [0,2,5,7,1] ; [0,1,2,5,7]
list_summation
list_summation:right-to-left
5, 9, 1, 7
1+7=8 ; 9+8=17 ; 5+17=22
multidigit_addition
multidigit_addition:left-to-right-partials
210+704
p100:200+700=900 ; p10:10+0=10 ; p1:0+4=4 ; sum=900+10+4=914
base_conversion
base_conversion:repeated-division
n=64,base=8
DIV:64/8=8,r:0 ; DIV:8/8=1,r:0 ; DIV:1/8=0,r:1 ; OUT:100
list_summation
list_summation:pairwise
4, 6, 5, 5
4+6=10 ; 5+5=10 ; 10+10=20
base_conversion
base_conversion:repeated-division
n=44,base=8
DIV:44/8=5,r:4 ; DIV:5/8=0,r:5 ; OUT:54
list_summation
list_summation:right-to-left
4, 4, 4, 3
4+3=7 ; 4+7=11 ; 4+11=15
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x+36=64
4x+36=64 ; x+9=16 ; x=16-9 ; x=7
list_summation
list_summation:pairwise
6, 9, 4, 6
6+9=15 ; 4+6=10 ; 15+10=25
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x+16=52
4x+16=52 ; x+4=13 ; x=13-4 ; x=9
list_summation
list_summation:left-to-right
0, 7, 9, 8
0+7=7 ; 7+9=16 ; 16+8=24
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(5,5)
R:(3,4) ; R:(3,5) ; D:(4,5) ; D:(5,5)
multidigit_addition
multidigit_addition:left-to-right-partials
828+850
p100:800+800=1600 ; p10:20+50=70 ; p1:8+0=8 ; sum=1600+70+8=1678
list_summation
list_summation:right-to-left
4, 3, 0, 2
0+2=2 ; 3+2=5 ; 4+5=9
linear_equation_solving
linear_equation_solving:inverse-ops
8x+56=56
8x+56=56 ; x=(56-56)/8 ; x=0/8 ; x=0
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+12=-18
6x+12=-18 ; 6x=-30 ; x=-5
list_summation
list_summation:left-to-right
7, 9, 5, 4
7+9=16 ; 16+5=21 ; 21+4=25
list_summation
list_summation:pairwise
2, 6, 0, 1
2+6=8 ; 0+1=1 ; 8+1=9
multidigit_addition
multidigit_addition:right-to-left-carry
285+709
d2:5+9+0=14→w4,c1 ; d1:8+0+1=9→w9,c0 ; d0:2+7+0=9→w9,c0 ; sum=994
linear_equation_solving
linear_equation_solving:inverse-ops
7x+42=84
7x+42=84 ; x=(84-42)/7 ; x=42/7 ; x=6
multidigit_addition
multidigit_addition:right-to-left-carry
804+314
d2:4+4+0=8→w8,c0 ; d1:0+1+0=1→w1,c0 ; d0:8+3+0=11→w1,c1 ; sum=1118
sorting_algorithms
sorting_algorithms:heap-sort
0, 8, 6, 7, 9
[0,9,6,7,8] ; [9,0,6,7,8] ; [9,8,6,7,0] ; [0,8,6,7,9] ; [8,0,6,7,9] ; [8,7,6,0,9] ; [0,7,6,8,9] ; [7,0,6,8,9] ; [6,0,7,8,9] ; [0,6,7,8,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-12=42
6x-12=42 ; 6x=54 ; x=9
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:right-to-left-carry
222+547
d2:2+7+0=9→w9,c0 ; d1:2+4+0=6→w6,c0 ; d0:2+5+0=7→w7,c0 ; sum=769
sorting_algorithms
sorting_algorithms:merge-sort
5, 8, 6, 1, 3
[5,8,1,6,3] ; [1,5,6,8,3] ; [1,3,5,6,8]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(2,5)
R:(1,5) ; D:(2,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
sorting_algorithms
sorting_algorithms:selection-sort
7, 0, 1, 3, 9
[0,7,1,3,9] ; [0,1,7,3,9] ; [0,1,3,7,9] ; [0,1,3,7,9]
multidigit_addition
multidigit_addition:left-to-right-partials
664+952
p100:600+900=1500 ; p10:60+50=110 ; p1:4+2=6 ; sum=1500+110+6=1616
base_conversion
base_conversion:repeated-division
n=191,base=2
DIV:191/2=95,r:1 ; DIV:95/2=47,r:1 ; DIV:47/2=23,r:1 ; DIV:23/2=11,r:1 ; DIV:11/2=5,r:1 ; DIV:5/2=2,r:1 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:10111111
linear_equation_solving
linear_equation_solving:inverse-ops
5x-25=-10
5x-25=-10 ; x=(-10--25)/5 ; x=15/5 ; x=3
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,0) ; G=(4,5)
R:(1,1) ; R:(1,2) ; R:(1,3) ; R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
linear_equation_solving
linear_equation_solving:inverse-ops
4x+24=-4
4x+24=-4 ; x=(-4-24)/4 ; x=-28/4 ; x=-7
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x-45=-117
9x-45=-117 ; 9x=-72 ; x=-8
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,3)
D:(5,1) ; R:(5,2) ; R:(5,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,1) ; G=(5,3)
D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3)
base_conversion
base_conversion:via-binary
n=59,base=16
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:11 ; OUT:3B
sorting_algorithms
sorting_algorithms:selection-sort
0, 8, 1, 9, 2
[0,8,1,9,2] ; [0,1,8,9,2] ; [0,1,2,9,8] ; [0,1,2,8,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+32=16
4x+32=16 ; 4x=-16 ; x=-4
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-27=-27
9x-27=-27 ; x+-3=-3 ; x=-3--3 ; x=0
multidigit_addition
multidigit_addition:rounding-decomposition
275+452
round:280+452=732 ; adjust:732-5=727 ; sum=727
sorting_algorithms
sorting_algorithms:heap-sort
4, 9, 3, 2, 5
[9,4,3,2,5] ; [9,5,3,2,4] ; [4,5,3,2,9] ; [5,4,3,2,9] ; [2,4,3,5,9] ; [4,2,3,5,9] ; [3,2,4,5,9] ; [2,3,4,5,9]
multidigit_addition
multidigit_addition:rounding-decomposition
214+904
round:220+904=1124 ; adjust:1124-6=1118 ; sum=1118
list_summation
list_summation:right-to-left
1, 7, 1, 8
1+8=9 ; 7+9=16 ; 1+16=17
multidigit_addition
multidigit_addition:right-to-left-carry
247+519
d2:7+9+0=16→w6,c1 ; d1:4+1+1=6→w6,c0 ; d0:2+5+0=7→w7,c0 ; sum=766
base_conversion
base_conversion:decomposition
n=244,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:1*2^2=4 ; TERM:0*2^1=0 ; TERM:0*2^0=0 ; OUT:11110100
linear_equation_solving
linear_equation_solving:inverse-ops
5x+45=35
5x+45=35 ; x=(35-45)/5 ; x=-10/5 ; x=-2
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-56=-64
8x-56=-64 ; 8x=-8 ; x=-1
multidigit_addition
multidigit_addition:rounding-decomposition
326+275
round:330+275=605 ; adjust:605-4=601 ; sum=601
sorting_algorithms
sorting_algorithms:heap-sort
9, 4, 0, 6, 2
[9,6,0,4,2] ; [2,6,0,4,9] ; [6,2,0,4,9] ; [6,4,0,2,9] ; [2,4,0,6,9] ; [4,2,0,6,9] ; [0,2,4,6,9] ; [2,0,4,6,9] ; [0,2,4,6,9]