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
multidigit_addition
multidigit_addition:left-to-right-partials
782+618
p100:700+600=1300 ; p10:80+10=90 ; p1:2+8=10 ; sum=1300+90+10=1400
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+0=27
3x+0=27 ; 3x=27 ; x=9
sorting_algorithms
sorting_algorithms:merge-sort
3, 1, 7, 9, 2
[1,3,7,9,2] ; [1,2,3,7,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(5,5)
D:(3,4) ; D:(4,4) ; D:(5,4) ; R:(5,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+12=12
3x+12=12 ; 3x=0 ; x=0
list_summation
list_summation:pairwise
6, 6, 3, 8
6+6=12 ; 3+8=11 ; 12+11=23
multidigit_addition
multidigit_addition:left-to-right-partials
461+679
p100:400+600=1000 ; p10:60+70=130 ; p1:1+9=10 ; sum=1000+130+10=1140
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,2) ; G=(3,3)
R:(2,3) ; D:(3,3)
list_summation
list_summation:pairwise
4, 4, 6, 1
4+4=8 ; 6+1=7 ; 8+7=15
linear_equation_solving
linear_equation_solving:inverse-ops
3x-3=-12
3x-3=-12 ; x=(-12--3)/3 ; x=-9/3 ; x=-3
list_summation
list_summation:left-to-right
7, 8, 2, 4
7+8=15 ; 15+2=17 ; 17+4=21
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+6=18
6x+6=18 ; 6x=12 ; x=2
multidigit_addition
multidigit_addition:rounding-decomposition
157+843
round:160+843=1003 ; adjust:1003-3=1000 ; sum=1000
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-2=-4
2x-2=-4 ; x+-1=-2 ; x=-2--1 ; x=-1
multidigit_addition
multidigit_addition:right-to-left-carry
751+400
d2:1+0+0=1→w1,c0 ; d1:5+0+0=5→w5,c0 ; d0:7+4+0=11→w1,c1 ; sum=1151
list_summation
list_summation:pairwise
7, 4, 6, 0
7+4=11 ; 6+0=6 ; 11+6=17
list_summation
list_summation:left-to-right
6, 7, 5, 7
6+7=13 ; 13+5=18 ; 18+7=25
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(4,4)
R:(0,2) ; D:(1,2) ; R:(1,3) ; D:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4)
base_conversion
base_conversion:via-binary
n=70,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:0 ; OUT:1000110
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,2) ; G=(4,5)
D:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
base_conversion
base_conversion:via-binary
n=165,base=8
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:4 ; CHUNK:2:5 ; OUT:245
sorting_algorithms
sorting_algorithms:selection-sort
0, 7, 6, 8, 2
[0,7,6,8,2] ; [0,2,6,8,7] ; [0,2,6,8,7] ; [0,2,6,7,8]
sorting_algorithms
sorting_algorithms:merge-sort
7, 9, 3, 2, 4
[7,9,2,3,4] ; [2,3,7,9,4] ; [2,3,4,7,9]
sorting_algorithms
sorting_algorithms:heap-sort
5, 9, 4, 7, 1
[9,5,4,7,1] ; [9,7,4,5,1] ; [1,7,4,5,9] ; [7,1,4,5,9] ; [7,5,4,1,9] ; [1,5,4,7,9] ; [5,1,4,7,9] ; [4,1,5,7,9] ; [1,4,5,7,9]
base_conversion
base_conversion:decomposition
n=1,base=2
TERM:1*2^0=1 ; OUT:1
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(3,4)
D:(2,0) ; D:(3,0) ; R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4)
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)
list_summation
list_summation:pairwise
0, 8, 6, 6
0+8=8 ; 6+6=12 ; 8+12=20
multidigit_addition
multidigit_addition:left-to-right-partials
482+980
p100:400+900=1300 ; p10:80+80=160 ; p1:2+0=2 ; sum=1300+160+2=1462
sorting_algorithms
sorting_algorithms:selection-sort
2, 9, 1, 6, 7
[1,9,2,6,7] ; [1,2,9,6,7] ; [1,2,6,9,7] ; [1,2,6,7,9]
base_conversion
base_conversion:decomposition
n=160,base=8
TERM:2*8^2=128 ; TERM:4*8^1=32 ; TERM:0*8^0=0 ; OUT:240
multidigit_addition
multidigit_addition:left-to-right-partials
870+935
p100:800+900=1700 ; p10:70+30=100 ; p1:0+5=5 ; sum=1700+100+5=1805
base_conversion
base_conversion:repeated-division
n=84,base=4
DIV:84/4=21,r:0 ; DIV:21/4=5,r:1 ; DIV:5/4=1,r:1 ; DIV:1/4=0,r:1 ; OUT:1110
sorting_algorithms
sorting_algorithms:merge-sort
4, 1, 7, 6, 2
[1,4,7,6,2] ; [1,4,6,7,2] ; [1,2,4,6,7]
linear_equation_solving
linear_equation_solving:inverse-ops
8x-24=24
8x-24=24 ; x=(24--24)/8 ; x=48/8 ; x=6
base_conversion
base_conversion:decomposition
n=131,base=8
TERM:2*8^2=128 ; TERM:0*8^1=0 ; TERM:3*8^0=3 ; OUT:203
multidigit_addition
multidigit_addition:left-to-right-partials
874+756
p100:800+700=1500 ; p10:70+50=120 ; p1:4+6=10 ; sum=1500+120+10=1630
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,3) ; G=(3,4)
R:(1,4) ; D:(2,4) ; D:(3,4)
multidigit_addition
multidigit_addition:rounding-decomposition
513+481
round:520+481=1001 ; adjust:1001-7=994 ; sum=994
base_conversion
base_conversion:via-binary
n=24,base=4
BINLEN:5 ; CHUNK:0:1 ; CHUNK:1:2 ; CHUNK:2:0 ; OUT:120
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-42=-72
6x-42=-72 ; 6x=-30 ; x=-5
list_summation
list_summation:right-to-left
3, 9, 3, 6
3+6=9 ; 9+9=18 ; 3+18=21
multidigit_addition
multidigit_addition:right-to-left-carry
274+831
d2:4+1+0=5→w5,c0 ; d1:7+3+0=10→w0,c1 ; d0:2+8+1=11→w1,c1 ; sum=1105
sorting_algorithms
sorting_algorithms:heap-sort
5, 3, 0, 6, 2
[5,6,0,3,2] ; [6,5,0,3,2] ; [2,5,0,3,6] ; [5,2,0,3,6] ; [5,3,0,2,6] ; [2,3,0,5,6] ; [3,2,0,5,6] ; [0,2,3,5,6] ; [2,0,3,5,6] ; [0,2,3,5,6]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,0) ; G=(4,2)
R:(1,1) ; D:(2,1) ; R:(2,2) ; D:(3,2) ; D:(4,2)
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+48=30
6x+48=30 ; x+8=5 ; x=5-8 ; x=-3
sorting_algorithms
sorting_algorithms:bubble-sort
5, 6, 4, 1, 3
[5,4,6,1,3] ; [5,4,1,6,3] ; [5,4,1,3,6] ; [4,5,1,3,6] ; [4,1,5,3,6] ; [4,1,3,5,6] ; [1,4,3,5,6] ; [1,3,4,5,6]
sorting_algorithms
sorting_algorithms:selection-sort
2, 4, 1, 5, 8
[1,4,2,5,8] ; [1,2,4,5,8] ; [1,2,4,5,8] ; [1,2,4,5,8]
list_summation
list_summation:pairwise
7, 0, 0, 9
7+0=7 ; 0+9=9 ; 7+9=16
base_conversion
base_conversion:via-binary
n=84,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:2 ; CHUNK:2:4 ; OUT:124
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,2) ; G=(5,4)
D:(5,2) ; R:(5,3) ; R:(5,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-10=-20
5x-10=-20 ; 5x=-10 ; x=-2
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(2,5)
D:(2,0) ; R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5)
multidigit_addition
multidigit_addition:rounding-decomposition
808+923
round:810+923=1733 ; adjust:1733-2=1731 ; sum=1731
base_conversion
base_conversion:decomposition
n=241,base=8
TERM:3*8^2=192 ; TERM:6*8^1=48 ; TERM:1*8^0=1 ; OUT:361
base_conversion
base_conversion:via-binary
n=167,base=16
BINLEN:8 ; CHUNK:0:10 ; CHUNK:1:7 ; OUT:A7
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-6=-6
6x-6=-6 ; 6x=0 ; x=0
base_conversion
base_conversion:decomposition
n=212,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:0*2^5=0 ; 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:11010100
multidigit_addition
multidigit_addition:right-to-left-carry
811+210
d2:1+0+0=1→w1,c0 ; d1:1+1+0=2→w2,c0 ; d0:8+2+0=10→w0,c1 ; sum=1021
base_conversion
base_conversion:via-binary
n=98,base=16
BINLEN:7 ; CHUNK:0:6 ; CHUNK:1:2 ; OUT:62
multidigit_addition
multidigit_addition:right-to-left-carry
958+479
d2:8+9+0=17→w7,c1 ; d1:5+7+1=13→w3,c1 ; d0:9+4+1=14→w4,c1 ; sum=1437
sorting_algorithms
sorting_algorithms:heap-sort
0, 6, 1, 5, 9
[0,9,1,5,6] ; [9,0,1,5,6] ; [9,6,1,5,0] ; [0,6,1,5,9] ; [6,0,1,5,9] ; [6,5,1,0,9] ; [0,5,1,6,9] ; [5,0,1,6,9] ; [1,0,5,6,9] ; [0,1,5,6,9]
multidigit_addition
multidigit_addition:left-to-right-partials
850+512
p100:800+500=1300 ; p10:50+10=60 ; p1:0+2=2 ; sum=1300+60+2=1362
sorting_algorithms
sorting_algorithms:insertion-sort
9, 6, 4, 3, 8
[6,9,4,3,8] ; [4,6,9,3,8] ; [3,4,6,9,8] ; [3,4,6,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
977+498
d2:7+8+0=15→w5,c1 ; d1:7+9+1=17→w7,c1 ; d0:9+4+1=14→w4,c1 ; sum=1475
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-12=12
4x-12=12 ; x+-3=3 ; x=3--3 ; x=6
multidigit_addition
multidigit_addition:left-to-right-partials
935+247
p100:900+200=1100 ; p10:30+40=70 ; p1:5+7=12 ; sum=1100+70+12=1182
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,0) ; G=(5,4)
R:(1,1) ; D:(2,1) ; R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4)
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)
base_conversion
base_conversion:decomposition
n=207,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:11001111
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,3) ; G=(3,4)
D:(2,3) ; D:(3,3) ; R:(3,4)
multidigit_addition
multidigit_addition:left-to-right-partials
607+997
p100:600+900=1500 ; p10:0+90=90 ; p1:7+7=14 ; sum=1500+90+14=1604
multidigit_addition
multidigit_addition:rounding-decomposition
766+784
round:770+784=1554 ; adjust:1554-4=1550 ; sum=1550
linear_equation_solving
linear_equation_solving:inverse-ops
6x-12=-66
6x-12=-66 ; x=(-66--12)/6 ; x=-54/6 ; x=-9
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,0) ; G=(4,5)
R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,2) ; G=(3,3)
R:(1,3) ; D:(2,3) ; D:(3,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,4) ; G=(3,5)
D:(3,4) ; R:(3,5)
base_conversion
base_conversion:via-binary
n=58,base=4
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:2 ; CHUNK:2:2 ; OUT:322
sorting_algorithms
sorting_algorithms:insertion-sort
6, 2, 0, 3, 7
[2,6,0,3,7] ; [0,2,6,3,7] ; [0,2,3,6,7] ; [0,2,3,6,7]
multidigit_addition
multidigit_addition:left-to-right-partials
254+255
p100:200+200=400 ; p10:50+50=100 ; p1:4+5=9 ; sum=400+100+9=509
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:divide-then-subtract
2x+6=12
2x+6=12 ; x+3=6 ; x=6-3 ; x=3
multidigit_addition
multidigit_addition:left-to-right-partials
289+283
p100:200+200=400 ; p10:80+80=160 ; p1:9+3=12 ; sum=400+160+12=572
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,5)
D:(5,3) ; R:(5,4) ; R:(5,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+49=98
7x+49=98 ; x+7=14 ; x=14-7 ; x=7
base_conversion
base_conversion:via-binary
n=250,base=16
BINLEN:8 ; CHUNK:0:15 ; CHUNK:1:10 ; OUT:FA
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-48=-24
8x-48=-24 ; 8x=24 ; x=3
base_conversion
base_conversion:repeated-division
n=127,base=4
DIV:127/4=31,r:3 ; DIV:31/4=7,r:3 ; DIV:7/4=1,r:3 ; DIV:1/4=0,r:1 ; OUT:1333
base_conversion
base_conversion:via-binary
n=95,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:3 ; CHUNK:2:7 ; OUT:137
list_summation
list_summation:pairwise
0, 3, 2, 3
0+3=3 ; 2+3=5 ; 3+5=8
multidigit_addition
multidigit_addition:rounding-decomposition
123+768
round:130+768=898 ; adjust:898-7=891 ; sum=891
base_conversion
base_conversion:decomposition
n=27,base=8
TERM:3*8^1=24 ; TERM:3*8^0=3 ; OUT:33
sorting_algorithms
sorting_algorithms:bubble-sort
4, 6, 5, 0, 3
[4,5,6,0,3] ; [4,5,0,6,3] ; [4,5,0,3,6] ; [4,0,5,3,6] ; [4,0,3,5,6] ; [0,4,3,5,6] ; [0,3,4,5,6]
linear_equation_solving
linear_equation_solving:inverse-ops
7x-42=-98
7x-42=-98 ; x=(-98--42)/7 ; x=-56/7 ; x=-8
multidigit_addition
multidigit_addition:left-to-right-partials
592+420
p100:500+400=900 ; p10:90+20=110 ; p1:2+0=2 ; sum=900+110+2=1012
list_summation
list_summation:left-to-right
4, 8, 2, 1
4+8=12 ; 12+2=14 ; 14+1=15
sorting_algorithms
sorting_algorithms:insertion-sort
8, 7, 3, 6, 9
[7,8,3,6,9] ; [3,7,8,6,9] ; [3,6,7,8,9] ; [3,6,7,8,9]
base_conversion
base_conversion:via-binary
n=156,base=16
BINLEN:8 ; CHUNK:0:9 ; CHUNK:1:12 ; OUT:9C
sorting_algorithms
sorting_algorithms:insertion-sort
6, 7, 9, 0, 1
[6,7,9,0,1] ; [6,7,9,0,1] ; [0,6,7,9,1] ; [0,1,6,7,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,4) ; G=(5,5)
R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)