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
2, 4, 2, 4
2+4=6 ; 6+2=8 ; 8+4=12
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-32=-8
4x-32=-8 ; x+-8=-2 ; x=-2--8 ; x=6
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+15=24
3x+15=24 ; x+5=8 ; x=8-5 ; x=3
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,0) ; G=(5,2)
R:(0,1) ; D:(1,1) ; R:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
list_summation
list_summation:pairwise
7, 6, 1, 9
7+6=13 ; 1+9=10 ; 13+10=23
sorting_algorithms
sorting_algorithms:heap-sort
7, 6, 1, 2, 0
[0,6,1,2,7] ; [6,0,1,2,7] ; [6,2,1,0,7] ; [0,2,1,6,7] ; [2,0,1,6,7] ; [1,0,2,6,7] ; [0,1,2,6,7]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,4) ; G=(3,5)
D:(2,4) ; D:(3,4) ; R:(3,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,2) ; G=(5,4)
R:(4,3) ; R:(4,4) ; D:(5,4)
list_summation
list_summation:left-to-right
9, 2, 0, 0
9+2=11 ; 11+0=11 ; 11+0=11
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,4)
D:(5,3) ; R:(5,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
multidigit_addition
multidigit_addition:rounding-decomposition
684+546
round:690+546=1236 ; adjust:1236-6=1230 ; sum=1230
list_summation
list_summation:left-to-right
9, 1, 6, 4
9+1=10 ; 10+6=16 ; 16+4=20
sorting_algorithms
sorting_algorithms:insertion-sort
5, 3, 4, 2, 9
[3,5,4,2,9] ; [3,4,5,2,9] ; [2,3,4,5,9] ; [2,3,4,5,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
list_summation
list_summation:left-to-right
1, 9, 7, 0
1+9=10 ; 10+7=17 ; 17+0=17
base_conversion
base_conversion:repeated-division
n=2,base=4
DIV:2/4=0,r:2 ; OUT:2
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,2) ; G=(4,4)
R:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4)
linear_equation_solving
linear_equation_solving:inverse-ops
7x-14=49
7x-14=49 ; x=(49--14)/7 ; x=63/7 ; x=9
multidigit_addition
multidigit_addition:rounding-decomposition
886+160
round:890+160=1050 ; adjust:1050-4=1046 ; sum=1046
sorting_algorithms
sorting_algorithms:insertion-sort
4, 3, 2, 5, 8
[3,4,2,5,8] ; [2,3,4,5,8] ; [2,3,4,5,8] ; [2,3,4,5,8]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
multidigit_addition
multidigit_addition:left-to-right-partials
843+320
p100:800+300=1100 ; p10:40+20=60 ; p1:3+0=3 ; sum=1100+60+3=1163
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-14=42
7x-14=42 ; x+-2=6 ; x=6--2 ; x=8
sorting_algorithms
sorting_algorithms:heap-sort
6, 9, 4, 2, 3
[9,6,4,2,3] ; [3,6,4,2,9] ; [6,3,4,2,9] ; [2,3,4,6,9] ; [4,3,2,6,9] ; [2,3,4,6,9] ; [3,2,4,6,9] ; [2,3,4,6,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+8=-4
2x+8=-4 ; 2x=-12 ; x=-6
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,0) ; G=(4,2)
R:(3,1) ; D:(4,1) ; R:(4,2)
sorting_algorithms
sorting_algorithms:insertion-sort
5, 9, 1, 3, 8
[5,9,1,3,8] ; [1,5,9,3,8] ; [1,3,5,9,8] ; [1,3,5,8,9]
multidigit_addition
multidigit_addition:left-to-right-partials
200+375
p100:200+300=500 ; p10:0+70=70 ; p1:0+5=5 ; sum=500+70+5=575
sorting_algorithms
sorting_algorithms:selection-sort
8, 5, 1, 7, 4
[1,5,8,7,4] ; [1,4,8,7,5] ; [1,4,5,7,8] ; [1,4,5,7,8]
base_conversion
base_conversion:via-binary
n=169,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:2 ; CHUNK:2:2 ; CHUNK:3:1 ; OUT:2221
list_summation
list_summation:pairwise
6, 3, 4, 0
6+3=9 ; 4+0=4 ; 9+4=13
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,3) ; G=(5,4)
D:(4,3) ; D:(5,3) ; R:(5,4)
linear_equation_solving
linear_equation_solving:inverse-ops
7x-7=-35
7x-7=-35 ; x=(-35--7)/7 ; x=-28/7 ; x=-4
multidigit_addition
multidigit_addition:rounding-decomposition
818+689
round:820+689=1509 ; adjust:1509-2=1507 ; sum=1507
multidigit_addition
multidigit_addition:rounding-decomposition
801+243
round:810+243=1053 ; adjust:1053-9=1044 ; sum=1044
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,1) ; G=(5,3)
R:(3,2) ; R:(3,3) ; D:(4,3) ; D:(5,3)
sorting_algorithms
sorting_algorithms:heap-sort
7, 9, 4, 3, 1
[9,7,4,3,1] ; [1,7,4,3,9] ; [7,1,4,3,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]
sorting_algorithms
sorting_algorithms:bubble-sort
7, 3, 4, 1, 5
[3,7,4,1,5] ; [3,4,7,1,5] ; [3,4,1,7,5] ; [3,4,1,5,7] ; [3,1,4,5,7] ; [1,3,4,5,7]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,1) ; G=(3,5)
D:(1,1) ; D:(2,1) ; D:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
base_conversion
base_conversion:repeated-division
n=51,base=4
DIV:51/4=12,r:3 ; DIV:12/4=3,r:0 ; DIV:3/4=0,r:3 ; OUT:303
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x-32=-48
8x-32=-48 ; x+-4=-6 ; x=-6--4 ; x=-2
base_conversion
base_conversion:repeated-division
n=25,base=8
DIV:25/8=3,r:1 ; DIV:3/8=0,r:3 ; OUT:31
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,3) ; G=(3,5)
R:(2,4) ; D:(3,4) ; R:(3,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-16=-48
4x-16=-48 ; 4x=-32 ; x=-8
sorting_algorithms
sorting_algorithms:selection-sort
3, 8, 1, 7, 4
[1,8,3,7,4] ; [1,3,8,7,4] ; [1,3,4,7,8] ; [1,3,4,7,8]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
list_summation
list_summation:right-to-left
3, 3, 5, 2
5+2=7 ; 3+7=10 ; 3+10=13
multidigit_addition
multidigit_addition:left-to-right-partials
583+239
p100:500+200=700 ; p10:80+30=110 ; p1:3+9=12 ; sum=700+110+12=822
multidigit_addition
multidigit_addition:left-to-right-partials
144+367
p100:100+300=400 ; p10:40+60=100 ; p1:4+7=11 ; sum=400+100+11=511
list_summation
list_summation:left-to-right
5, 6, 4, 3
5+6=11 ; 11+4=15 ; 15+3=18
list_summation
list_summation:right-to-left
5, 3, 7, 3
7+3=10 ; 3+10=13 ; 5+13=18
base_conversion
base_conversion:via-binary
n=21,base=2
BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:1 ; OUT:10101
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(3,1)
R:(2,1) ; D:(3,1)
list_summation
list_summation:pairwise
2, 4, 9, 8
2+4=6 ; 9+8=17 ; 6+17=23
base_conversion
base_conversion:repeated-division
n=247,base=2
DIV:247/2=123,r:1 ; DIV:123/2=61,r:1 ; DIV:61/2=30,r:1 ; DIV:30/2=15,r:0 ; DIV:15/2=7,r:1 ; DIV:7/2=3,r:1 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11110111
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,1) ; G=(5,5)
R:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,1) ; G=(3,5)
D:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
multidigit_addition
multidigit_addition:left-to-right-partials
736+323
p100:700+300=1000 ; p10:30+20=50 ; p1:6+3=9 ; sum=1000+50+9=1059
multidigit_addition
multidigit_addition:left-to-right-partials
817+183
p100:800+100=900 ; p10:10+80=90 ; p1:7+3=10 ; sum=900+90+10=1000
sorting_algorithms
sorting_algorithms:insertion-sort
0, 2, 5, 1, 9
[0,2,5,1,9] ; [0,2,5,1,9] ; [0,1,2,5,9] ; [0,1,2,5,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(2,5)
R:(1,5) ; D:(2,5)
list_summation
list_summation:right-to-left
1, 8, 6, 4
6+4=10 ; 8+10=18 ; 1+18=19
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(5,4)
R:(0,3) ; R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-48=-88
8x-48=-88 ; 8x=-40 ; x=-5
sorting_algorithms
sorting_algorithms:heap-sort
7, 6, 5, 9, 4
[7,9,5,6,4] ; [9,7,5,6,4] ; [4,7,5,6,9] ; [7,4,5,6,9] ; [7,6,5,4,9] ; [4,6,5,7,9] ; [6,4,5,7,9] ; [5,4,6,7,9] ; [4,5,6,7,9]
multidigit_addition
multidigit_addition:right-to-left-carry
188+448
d2:8+8+0=16→w6,c1 ; d1:8+4+1=13→w3,c1 ; d0:1+4+1=6→w6,c0 ; sum=636
sorting_algorithms
sorting_algorithms:insertion-sort
0, 2, 9, 7, 5
[0,2,9,7,5] ; [0,2,9,7,5] ; [0,2,7,9,5] ; [0,2,5,7,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+25=35
5x+25=35 ; x+5=7 ; x=7-5 ; x=2
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+14=2
2x+14=2 ; x+7=1 ; x=1-7 ; x=-6
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+27=9
3x+27=9 ; 3x=-18 ; x=-6
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,0) ; G=(4,3)
D:(4,0) ; R:(4,1) ; R:(4,2) ; R:(4,3)
multidigit_addition
multidigit_addition:right-to-left-carry
571+757
d2:1+7+0=8→w8,c0 ; d1:7+5+0=12→w2,c1 ; d0:5+7+1=13→w3,c1 ; sum=1328
sorting_algorithms
sorting_algorithms:bubble-sort
7, 2, 0, 6, 4
[2,7,0,6,4] ; [2,0,7,6,4] ; [2,0,6,7,4] ; [2,0,6,4,7] ; [0,2,6,4,7] ; [0,2,4,6,7]
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+21=48
3x+21=48 ; 3x=27 ; x=9
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+40=65
5x+40=65 ; 5x=25 ; x=5
sorting_algorithms
sorting_algorithms:insertion-sort
3, 5, 1, 0, 7
[3,5,1,0,7] ; [1,3,5,0,7] ; [0,1,3,5,7] ; [0,1,3,5,7]
sorting_algorithms
sorting_algorithms:heap-sort
5, 2, 8, 0, 7
[5,7,8,0,2] ; [8,7,5,0,2] ; [2,7,5,0,8] ; [7,2,5,0,8] ; [0,2,5,7,8] ; [5,2,0,7,8] ; [0,2,5,7,8] ; [2,0,5,7,8] ; [0,2,5,7,8]
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+54=78
6x+54=78 ; 6x=24 ; x=4
sorting_algorithms
sorting_algorithms:merge-sort
8, 5, 0, 4, 2
[5,8,0,4,2] ; [0,4,5,8,2] ; [0,2,4,5,8]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,4) ; G=(4,5)
R:(2,5) ; D:(3,5) ; D:(4,5)
sorting_algorithms
sorting_algorithms:heap-sort
4, 2, 7, 0, 6
[4,6,7,0,2] ; [7,6,4,0,2] ; [2,6,4,0,7] ; [6,2,4,0,7] ; [0,2,4,6,7] ; [4,2,0,6,7] ; [0,2,4,6,7] ; [2,0,4,6,7] ; [0,2,4,6,7]
list_summation
list_summation:left-to-right
4, 4, 4, 0
4+4=8 ; 8+4=12 ; 12+0=12
multidigit_addition
multidigit_addition:left-to-right-partials
488+627
p100:400+600=1000 ; p10:80+20=100 ; p1:8+7=15 ; sum=1000+100+15=1115
linear_equation_solving
linear_equation_solving:inverse-ops
7x+42=-7
7x+42=-7 ; x=(-7-42)/7 ; x=-49/7 ; x=-7
base_conversion
base_conversion:decomposition
n=231,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:1*2^5=32 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:11100111
sorting_algorithms
sorting_algorithms:insertion-sort
2, 5, 3, 4, 7
[2,5,3,4,7] ; [2,3,5,4,7] ; [2,3,4,5,7] ; [2,3,4,5,7]
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-56=-105
7x-56=-105 ; x+-8=-15 ; x=-15--8 ; x=-7
base_conversion
base_conversion:repeated-division
n=83,base=16
DIV:83/16=5,r:3 ; DIV:5/16=0,r:5 ; OUT:53
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+81=0
9x+81=0 ; 9x=-81 ; x=-9
multidigit_addition
multidigit_addition:rounding-decomposition
427+301
round:430+301=731 ; adjust:731-3=728 ; sum=728
linear_equation_solving
linear_equation_solving:inverse-ops
8x-24=-56
8x-24=-56 ; x=(-56--24)/8 ; x=-32/8 ; x=-4
sorting_algorithms
sorting_algorithms:insertion-sort
0, 6, 4, 5, 8
[0,6,4,5,8] ; [0,4,6,5,8] ; [0,4,5,6,8] ; [0,4,5,6,8]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,5)
R:(4,3) ; D:(5,3) ; R:(5,4) ; R:(5,5)
list_summation
list_summation:right-to-left
2, 7, 2, 7
2+7=9 ; 7+9=16 ; 2+16=18
list_summation
list_summation:right-to-left
6, 0, 2, 2
2+2=4 ; 0+4=4 ; 6+4=10
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-42=-14
7x-42=-14 ; 7x=28 ; x=4
list_summation
list_summation:right-to-left
9, 3, 8, 2
8+2=10 ; 3+10=13 ; 9+13=22
list_summation
list_summation:pairwise
0, 2, 2, 5
0+2=2 ; 2+5=7 ; 2+7=9
linear_equation_solving
linear_equation_solving:inverse-ops
6x-54=-78
6x-54=-78 ; x=(-78--54)/6 ; x=-24/6 ; x=-4