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
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)
multidigit_addition
multidigit_addition:rounding-decomposition
412+600
round:420+600=1020 ; adjust:1020-8=1012 ; sum=1012
sorting_algorithms
sorting_algorithms:merge-sort
3, 0, 1, 6, 7
[0,3,1,6,7] ; [0,1,3,6,7]
multidigit_addition
multidigit_addition:rounding-decomposition
483+460
round:490+460=950 ; adjust:950-7=943 ; sum=943
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x-18=3
3x-18=3 ; 3x=21 ; x=7
list_summation
list_summation:right-to-left
5, 7, 7, 0
7+0=7 ; 7+7=14 ; 5+14=19
linear_equation_solving
linear_equation_solving:inverse-ops
7x+14=-42
7x+14=-42 ; x=(-42-14)/7 ; x=-56/7 ; x=-8
sorting_algorithms
sorting_algorithms:selection-sort
2, 8, 0, 6, 7
[0,8,2,6,7] ; [0,2,8,6,7] ; [0,2,6,8,7] ; [0,2,6,7,8]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(4,4)
R:(2,2) ; R:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(5,5)
R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,3) ; G=(3,4)
R:(1,4) ; D:(2,4) ; D:(3,4)
list_summation
list_summation:left-to-right
6, 1, 0, 7
6+1=7 ; 7+0=7 ; 7+7=14
linear_equation_solving
linear_equation_solving:inverse-ops
9x-45=36
9x-45=36 ; x=(36--45)/9 ; x=81/9 ; x=9
multidigit_addition
multidigit_addition:right-to-left-carry
590+332
d2:0+2+0=2→w2,c0 ; d1:9+3+0=12→w2,c1 ; d0:5+3+1=9→w9,c0 ; sum=922
linear_equation_solving
linear_equation_solving:inverse-ops
7x+28=7
7x+28=7 ; x=(7-28)/7 ; x=-21/7 ; x=-3
multidigit_addition
multidigit_addition:left-to-right-partials
894+750
p100:800+700=1500 ; p10:90+50=140 ; p1:4+0=4 ; sum=1500+140+4=1644
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(2,4)
D:(2,0) ; R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4)
sorting_algorithms
sorting_algorithms:heap-sort
3, 4, 2, 9, 5
[3,9,2,4,5] ; [9,3,2,4,5] ; [9,5,2,4,3] ; [3,5,2,4,9] ; [5,3,2,4,9] ; [5,4,2,3,9] ; [3,4,2,5,9] ; [4,3,2,5,9] ; [2,3,4,5,9] ; [3,2,4,5,9] ; [2,3,4,5,9]
grid_pathfinding
grid_pathfinding:right-first
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)
linear_equation_solving
linear_equation_solving:inverse-ops
3x+3=21
3x+3=21 ; x=(21-3)/3 ; x=18/3 ; x=6
list_summation
list_summation:right-to-left
9, 7, 2, 9
2+9=11 ; 7+11=18 ; 9+18=27
multidigit_addition
multidigit_addition:right-to-left-carry
912+687
d2:2+7+0=9→w9,c0 ; d1:1+8+0=9→w9,c0 ; d0:9+6+0=15→w5,c1 ; sum=1599
list_summation
list_summation:right-to-left
0, 0, 0, 7
0+7=7 ; 0+7=7 ; 0+7=7
list_summation
list_summation:pairwise
0, 4, 0, 0
0+4=4 ; 0+0=0 ; 4+0=4
linear_equation_solving
linear_equation_solving:inverse-ops
7x+42=14
7x+42=14 ; x=(14-42)/7 ; x=-28/7 ; x=-4
list_summation
list_summation:left-to-right
7, 0, 5, 1
7+0=7 ; 7+5=12 ; 12+1=13
base_conversion
base_conversion:via-binary
n=193,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:1 ; OUT:11000001
sorting_algorithms
sorting_algorithms:insertion-sort
4, 2, 9, 1, 7
[2,4,9,1,7] ; [2,4,9,1,7] ; [1,2,4,9,7] ; [1,2,4,7,9]
sorting_algorithms
sorting_algorithms:bubble-sort
9, 2, 4, 6, 7
[2,9,4,6,7] ; [2,4,9,6,7] ; [2,4,6,9,7] ; [2,4,6,7,9]
list_summation
list_summation:right-to-left
1, 9, 6, 1
6+1=7 ; 9+7=16 ; 1+16=17
sorting_algorithms
sorting_algorithms:bubble-sort
7, 4, 1, 2, 3
[4,7,1,2,3] ; [4,1,7,2,3] ; [4,1,2,7,3] ; [4,1,2,3,7] ; [1,4,2,3,7] ; [1,2,4,3,7] ; [1,2,3,4,7]
base_conversion
base_conversion:decomposition
n=235,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:1*2^5=32 ; 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:11101011
sorting_algorithms
sorting_algorithms:insertion-sort
6, 3, 0, 8, 9
[3,6,0,8,9] ; [0,3,6,8,9] ; [0,3,6,8,9] ; [0,3,6,8,9]
multidigit_addition
multidigit_addition:left-to-right-partials
579+899
p100:500+800=1300 ; p10:70+90=160 ; p1:9+9=18 ; sum=1300+160+18=1478
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,0) ; G=(5,2)
R:(4,1) ; R:(4,2) ; D:(5,2)
base_conversion
base_conversion:repeated-division
n=235,base=2
DIV:235/2=117,r:1 ; DIV:117/2=58,r:1 ; 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:11101011
list_summation
list_summation:right-to-left
2, 4, 8, 4
8+4=12 ; 4+12=16 ; 2+16=18
sorting_algorithms
sorting_algorithms:heap-sort
0, 8, 5, 7, 4
[8,0,5,7,4] ; [8,7,5,0,4] ; [4,7,5,0,8] ; [7,4,5,0,8] ; [0,4,5,7,8] ; [5,4,0,7,8] ; [0,4,5,7,8] ; [4,0,5,7,8] ; [0,4,5,7,8]
multidigit_addition
multidigit_addition:left-to-right-partials
238+572
p100:200+500=700 ; p10:30+70=100 ; p1:8+2=10 ; sum=700+100+10=810
linear_equation_solving
linear_equation_solving:inverse-ops
5x+30=0
5x+30=0 ; x=(0-30)/5 ; x=-30/5 ; x=-6
list_summation
list_summation:pairwise
2, 1, 3, 1
2+1=3 ; 3+1=4 ; 3+4=7
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(4,5)
R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
multidigit_addition
multidigit_addition:rounding-decomposition
489+374
round:490+374=864 ; adjust:864-1=863 ; sum=863
linear_equation_solving
linear_equation_solving:inverse-ops
5x-10=-30
5x-10=-30 ; x=(-30--10)/5 ; x=-20/5 ; x=-4
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-12=6
2x-12=6 ; 2x=18 ; x=9
list_summation
list_summation:left-to-right
8, 4, 8, 4
8+4=12 ; 12+8=20 ; 20+4=24
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-36=45
9x-36=45 ; x+-4=5 ; x=5--4 ; x=9
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(5,5)
D:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:insertion-sort
6, 4, 1, 0, 2
[4,6,1,0,2] ; [1,4,6,0,2] ; [0,1,4,6,2] ; [0,1,2,4,6]
multidigit_addition
multidigit_addition:left-to-right-partials
953+446
p100:900+400=1300 ; p10:50+40=90 ; p1:3+6=9 ; sum=1300+90+9=1399
list_summation
list_summation:left-to-right
1, 6, 2, 7
1+6=7 ; 7+2=9 ; 9+7=16
sorting_algorithms
sorting_algorithms:insertion-sort
3, 1, 2, 9, 5
[1,3,2,9,5] ; [1,2,3,9,5] ; [1,2,3,9,5] ; [1,2,3,5,9]
grid_pathfinding
grid_pathfinding:right-first
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)
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-12=-24
2x-12=-24 ; x+-6=-12 ; x=-12--6 ; x=-6
multidigit_addition
multidigit_addition:right-to-left-carry
478+873
d2:8+3+0=11→w1,c1 ; d1:7+7+1=15→w5,c1 ; d0:4+8+1=13→w3,c1 ; sum=1351
sorting_algorithms
sorting_algorithms:insertion-sort
5, 7, 6, 1, 4
[5,7,6,1,4] ; [5,6,7,1,4] ; [1,5,6,7,4] ; [1,4,5,6,7]
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+7=56
7x+7=56 ; x+1=8 ; x=8-1 ; x=7
list_summation
list_summation:right-to-left
8, 2, 3, 3
3+3=6 ; 2+6=8 ; 8+8=16
list_summation
list_summation:right-to-left
2, 6, 2, 2
2+2=4 ; 6+4=10 ; 2+10=12
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-6=-14
2x-6=-14 ; x+-3=-7 ; x=-7--3 ; x=-4
sorting_algorithms
sorting_algorithms:insertion-sort
7, 0, 6, 5, 9
[0,7,6,5,9] ; [0,6,7,5,9] ; [0,5,6,7,9] ; [0,5,6,7,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x+32=24
4x+32=24 ; x+8=6 ; x=6-8 ; x=-2
multidigit_addition
multidigit_addition:left-to-right-partials
895+540
p100:800+500=1300 ; p10:90+40=130 ; p1:5+0=5 ; sum=1300+130+5=1435
sorting_algorithms
sorting_algorithms:heap-sort
9, 6, 1, 2, 7
[9,7,1,2,6] ; [6,7,1,2,9] ; [7,6,1,2,9] ; [2,6,1,7,9] ; [6,2,1,7,9] ; [1,2,6,7,9] ; [2,1,6,7,9] ; [1,2,6,7,9]
base_conversion
base_conversion:decomposition
n=77,base=8
TERM:1*8^2=64 ; TERM:1*8^1=8 ; TERM:5*8^0=5 ; OUT:115
list_summation
list_summation:right-to-left
3, 8, 0, 8
0+8=8 ; 8+8=16 ; 3+16=19
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(5,4)
R:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
list_summation
list_summation:right-to-left
3, 6, 5, 4
5+4=9 ; 6+9=15 ; 3+15=18
base_conversion
base_conversion:via-binary
n=117,base=16
BINLEN:7 ; CHUNK:0:7 ; CHUNK:1:5 ; OUT:75
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
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
sorting_algorithms
sorting_algorithms:selection-sort
7, 0, 5, 8, 9
[0,7,5,8,9] ; [0,5,7,8,9] ; [0,5,7,8,9] ; [0,5,7,8,9]
base_conversion
base_conversion:repeated-division
n=62,base=2
DIV:62/2=31,r:0 ; DIV:31/2=15,r:1 ; 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:111110
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,2) ; G=(5,5)
R:(3,3) ; R:(3,4) ; R:(3,5) ; D:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(3,4)
R:(1,4) ; D:(2,4) ; D:(3,4)
sorting_algorithms
sorting_algorithms:heap-sort
7, 3, 5, 2, 1
[1,3,5,2,7] ; [5,3,1,2,7] ; [2,3,1,5,7] ; [3,2,1,5,7] ; [1,2,3,5,7] ; [2,1,3,5,7] ; [1,2,3,5,7]
base_conversion
base_conversion:repeated-division
n=106,base=2
DIV:106/2=53,r:0 ; DIV:53/2=26,r:1 ; DIV:26/2=13,r:0 ; DIV:13/2=6,r:1 ; DIV:6/2=3,r:0 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:1101010
sorting_algorithms
sorting_algorithms:selection-sort
0, 3, 7, 6, 9
[0,3,7,6,9] ; [0,3,7,6,9] ; [0,3,6,7,9] ; [0,3,6,7,9]
sorting_algorithms
sorting_algorithms:bubble-sort
4, 5, 6, 9, 3
[4,5,6,3,9] ; [4,5,3,6,9] ; [4,3,5,6,9] ; [3,4,5,6,9]
sorting_algorithms
sorting_algorithms:selection-sort
2, 7, 3, 4, 1
[1,7,3,4,2] ; [1,2,3,4,7] ; [1,2,3,4,7] ; [1,2,3,4,7]
multidigit_addition
multidigit_addition:rounding-decomposition
714+796
round:720+796=1516 ; adjust:1516-6=1510 ; sum=1510
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,1) ; G=(3,2)
D:(2,1) ; D:(3,1) ; R:(3,2)
linear_equation_solving
linear_equation_solving:inverse-ops
9x+27=0
9x+27=0 ; x=(0-27)/9 ; x=-27/9 ; x=-3
list_summation
list_summation:left-to-right
1, 9, 3, 5
1+9=10 ; 10+3=13 ; 13+5=18
multidigit_addition
multidigit_addition:rounding-decomposition
661+579
round:670+579=1249 ; adjust:1249-9=1240 ; sum=1240
linear_equation_solving
linear_equation_solving:inverse-ops
9x-36=36
9x-36=36 ; x=(36--36)/9 ; x=72/9 ; 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
list_summation
list_summation:left-to-right
7, 4, 1, 6
7+4=11 ; 11+1=12 ; 12+6=18
base_conversion
base_conversion:decomposition
n=71,base=2
TERM:1*2^6=64 ; TERM:0*2^5=0 ; 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:1000111
list_summation
list_summation:pairwise
2, 1, 5, 2
2+1=3 ; 5+2=7 ; 3+7=10
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x-9=27
9x-9=27 ; 9x=36 ; x=4
linear_equation_solving
linear_equation_solving:inverse-ops
7x+56=119
7x+56=119 ; x=(119-56)/7 ; x=63/7 ; x=9
base_conversion
base_conversion:via-binary
n=195,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:3 ; OUT:3003
linear_equation_solving
linear_equation_solving:inverse-ops
7x+7=63
7x+7=63 ; x=(63-7)/7 ; x=56/7 ; x=8
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,2) ; G=(4,5)
R:(3,3) ; D:(4,3) ; R:(4,4) ; R:(4,5)
base_conversion
base_conversion:via-binary
n=209,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:2 ; CHUNK:2:1 ; OUT:321
multidigit_addition
multidigit_addition:left-to-right-partials
542+787
p100:500+700=1200 ; p10:40+80=120 ; p1:2+7=9 ; sum=1200+120+9=1329
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(5,5)
R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5) ; D:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+42=49
7x+42=49 ; x+6=7 ; x=7-6 ; x=1
sorting_algorithms
sorting_algorithms:bubble-sort
9, 7, 2, 3, 4
[7,9,2,3,4] ; [7,2,9,3,4] ; [7,2,3,9,4] ; [7,2,3,4,9] ; [2,7,3,4,9] ; [2,3,7,4,9] ; [2,3,4,7,9]