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=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
7x+28=7
7x+28=7 ; x=(7-28)/7 ; x=-21/7 ; x=-3
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(1,5)
D:(1,2) ; R:(1,3) ; R:(1,4) ; R:(1,5)
base_conversion
base_conversion:decomposition
n=173,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:1*2^5=32 ; TERM:0*2^4=0 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:0*2^1=0 ; TERM:1*2^0=1 ; OUT:10101101
list_summation
list_summation:pairwise
7, 5, 6, 4
7+5=12 ; 6+4=10 ; 12+10=22
multidigit_addition
multidigit_addition:left-to-right-partials
937+545
p100:900+500=1400 ; p10:30+40=70 ; p1:7+5=12 ; sum=1400+70+12=1482
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,1) ; G=(3,3)
D:(1,1) ; D:(2,1) ; D:(3,1) ; R:(3,2) ; R:(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:repeated-division
n=11,base=2
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:1011
base_conversion
base_conversion:decomposition
n=222,base=4
TERM:3*4^3=192 ; TERM:1*4^2=16 ; TERM:3*4^1=12 ; TERM:2*4^0=2 ; OUT:3132
sorting_algorithms
sorting_algorithms:merge-sort
0, 7, 2, 8, 1
[0,2,7,8,1] ; [0,1,2,7,8]
base_conversion
base_conversion:decomposition
n=59,base=8
TERM:7*8^1=56 ; TERM:3*8^0=3 ; OUT:73
sorting_algorithms
sorting_algorithms:merge-sort
5, 8, 0, 9, 3
[0,5,8,9,3] ; [0,3,5,8,9]
multidigit_addition
multidigit_addition:left-to-right-partials
969+176
p100:900+100=1000 ; p10:60+70=130 ; p1:9+6=15 ; sum=1000+130+15=1145
base_conversion
base_conversion:repeated-division
n=6,base=8
DIV:6/8=0,r:6 ; OUT:6
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,2) ; G=(5,5)
R:(1,3) ; R:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
list_summation
list_summation:right-to-left
6, 2, 0, 7
0+7=7 ; 2+7=9 ; 6+9=15
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,2) ; G=(2,4)
R:(1,3) ; R:(1,4) ; D:(2,4)
base_conversion
base_conversion:via-binary
n=146,base=8
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:2 ; CHUNK:2:2 ; OUT:222
list_summation
list_summation:left-to-right
9, 2, 1, 4
9+2=11 ; 11+1=12 ; 12+4=16
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(3,5)
D:(1,2) ; D:(2,2) ; D:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,1) ; G=(5,4)
R:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4)
sorting_algorithms
sorting_algorithms:selection-sort
0, 5, 3, 4, 1
[0,5,3,4,1] ; [0,1,3,4,5] ; [0,1,3,4,5] ; [0,1,3,4,5]
sorting_algorithms
sorting_algorithms:insertion-sort
8, 1, 7, 9, 3
[1,8,7,9,3] ; [1,7,8,9,3] ; [1,7,8,9,3] ; [1,3,7,8,9]
base_conversion
base_conversion:decomposition
n=131,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:10000011
list_summation
list_summation:pairwise
8, 4, 6, 8
8+4=12 ; 6+8=14 ; 12+14=26
multidigit_addition
multidigit_addition:right-to-left-carry
280+262
d2:0+2+0=2→w2,c0 ; d1:8+6+0=14→w4,c1 ; d0:2+2+1=5→w5,c0 ; sum=542
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,1) ; G=(5,3)
R:(3,2) ; D:(4,2) ; R:(4,3) ; D:(5,3)
base_conversion
base_conversion:repeated-division
n=184,base=4
DIV:184/4=46,r:0 ; DIV:46/4=11,r:2 ; DIV:11/4=2,r:3 ; DIV:2/4=0,r:2 ; OUT:2320
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+8=24
8x+8=24 ; 8x=16 ; x=2
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+54=135
9x+54=135 ; 9x=81 ; x=9
linear_equation_solving
linear_equation_solving:inverse-ops
3x-12=-24
3x-12=-24 ; x=(-24--12)/3 ; x=-12/3 ; x=-4
sorting_algorithms
sorting_algorithms:selection-sort
0, 4, 7, 2, 1
[0,4,7,2,1] ; [0,1,7,2,4] ; [0,1,2,7,4] ; [0,1,2,4,7]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,4) ; G=(2,5)
D:(2,4) ; R:(2,5)
list_summation
list_summation:left-to-right
0, 1, 8, 3
0+1=1 ; 1+8=9 ; 9+3=12
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,1) ; G=(3,2)
D:(3,1) ; R:(3,2)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,1) ; G=(5,4)
R:(0,2) ; 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
2x+14=-4
2x+14=-4 ; 2x=-18 ; x=-9
multidigit_addition
multidigit_addition:left-to-right-partials
731+671
p100:700+600=1300 ; p10:30+70=100 ; p1:1+1=2 ; sum=1300+100+2=1402
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,1) ; G=(2,3)
R:(0,2) ; R:(0,3) ; D:(1,3) ; D:(2,3)
sorting_algorithms
sorting_algorithms:insertion-sort
7, 0, 4, 3, 5
[0,7,4,3,5] ; [0,4,7,3,5] ; [0,3,4,7,5] ; [0,3,4,5,7]
sorting_algorithms
sorting_algorithms:insertion-sort
7, 0, 5, 2, 6
[0,7,5,2,6] ; [0,5,7,2,6] ; [0,2,5,7,6] ; [0,2,5,6,7]
multidigit_addition
multidigit_addition:right-to-left-carry
358+398
d2:8+8+0=16→w6,c1 ; d1:5+9+1=15→w5,c1 ; d0:3+3+1=7→w7,c0 ; sum=756
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,0) ; G=(5,1)
R:(4,1) ; D:(5,1)
sorting_algorithms
sorting_algorithms:heap-sort
2, 6, 3, 8, 1
[2,8,3,6,1] ; [8,2,3,6,1] ; [8,6,3,2,1] ; [1,6,3,2,8] ; [6,1,3,2,8] ; [6,2,3,1,8] ; [1,2,3,6,8] ; [3,2,1,6,8] ; [1,2,3,6,8] ; [2,1,3,6,8] ; [1,2,3,6,8]
list_summation
list_summation:pairwise
0, 7, 5, 1
0+7=7 ; 5+1=6 ; 7+6=13
linear_equation_solving
linear_equation_solving:inverse-ops
5x+25=55
5x+25=55 ; x=(55-25)/5 ; x=30/5 ; x=6
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(3,5)
R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5)
sorting_algorithms
sorting_algorithms:heap-sort
9, 5, 1, 4, 0
[0,5,1,4,9] ; [5,0,1,4,9] ; [5,4,1,0,9] ; [0,4,1,5,9] ; [4,0,1,5,9] ; [1,0,4,5,9] ; [0,1,4,5,9]
list_summation
list_summation:left-to-right
1, 4, 5, 5
1+4=5 ; 5+5=10 ; 10+5=15
base_conversion
base_conversion:repeated-division
n=63,base=2
DIV:63/2=31,r:1 ; 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:111111
base_conversion
base_conversion:repeated-division
n=123,base=16
DIV:123/16=7,r:11 ; DIV:7/16=0,r:7 ; OUT:7B
sorting_algorithms
sorting_algorithms:heap-sort
4, 0, 5, 8, 7
[4,8,5,0,7] ; [8,4,5,0,7] ; [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]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,1) ; G=(4,3)
D:(1,1) ; D:(2,1) ; D:(3,1) ; D:(4,1) ; R:(4,2) ; R:(4,3)
multidigit_addition
multidigit_addition:left-to-right-partials
692+445
p100:600+400=1000 ; p10:90+40=130 ; p1:2+5=7 ; sum=1000+130+7=1137
sorting_algorithms
sorting_algorithms:heap-sort
1, 3, 0, 9, 7
[1,9,0,3,7] ; [9,1,0,3,7] ; [9,7,0,3,1] ; [1,7,0,3,9] ; [7,1,0,3,9] ; [7,3,0,1,9] ; [1,3,0,7,9] ; [3,1,0,7,9] ; [0,1,3,7,9] ; [1,0,3,7,9] ; [0,1,3,7,9]
list_summation
list_summation:left-to-right
5, 0, 5, 6
5+0=5 ; 5+5=10 ; 10+6=16
multidigit_addition
multidigit_addition:rounding-decomposition
381+617
round:390+617=1007 ; adjust:1007-9=998 ; sum=998
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
list_summation
list_summation:right-to-left
6, 5, 5, 5
5+5=10 ; 5+10=15 ; 6+15=21
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,0) ; G=(4,4)
R:(1,1) ; R:(1,2) ; R:(1,3) ; R:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4)
sorting_algorithms
sorting_algorithms:selection-sort
3, 8, 5, 6, 0
[0,8,5,6,3] ; [0,3,5,6,8] ; [0,3,5,6,8] ; [0,3,5,6,8]
multidigit_addition
multidigit_addition:right-to-left-carry
986+922
d2:6+2+0=8→w8,c0 ; d1:8+2+0=10→w0,c1 ; d0:9+9+1=19→w9,c1 ; sum=1908
list_summation
list_summation:left-to-right
8, 3, 2, 1
8+3=11 ; 11+2=13 ; 13+1=14
sorting_algorithms
sorting_algorithms:insertion-sort
8, 9, 4, 1, 6
[8,9,4,1,6] ; [4,8,9,1,6] ; [1,4,8,9,6] ; [1,4,6,8,9]
base_conversion
base_conversion:via-binary
n=139,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:0 ; CHUNK:2:2 ; CHUNK:3:3 ; OUT:2023
base_conversion
base_conversion:decomposition
n=12,base=4
TERM:3*4^1=12 ; TERM:0*4^0=0 ; OUT:30
sorting_algorithms
sorting_algorithms:insertion-sort
1, 5, 0, 3, 8
[1,5,0,3,8] ; [0,1,5,3,8] ; [0,1,3,5,8] ; [0,1,3,5,8]
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-12=-18
3x-12=-18 ; x+-4=-6 ; x=-6--4 ; x=-2
sorting_algorithms
sorting_algorithms:bubble-sort
0, 7, 1, 8, 3
[0,1,7,8,3] ; [0,1,7,3,8] ; [0,1,3,7,8]
multidigit_addition
multidigit_addition:rounding-decomposition
402+301
round:410+301=711 ; adjust:711-8=703 ; sum=703
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(5,5)
D:(2,0) ; D:(3,0) ; D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,0) ; G=(3,2)
D:(3,0) ; R:(3,1) ; R:(3,2)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,0) ; G=(5,5)
R:(3,1) ; D:(4,1) ; R:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,0) ; G=(3,4)
R:(0,1) ; R:(0,2) ; R:(0,3) ; R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4)
sorting_algorithms
sorting_algorithms:heap-sort
0, 3, 4, 7, 2
[0,7,4,3,2] ; [7,0,4,3,2] ; [7,3,4,0,2] ; [2,3,4,0,7] ; [4,3,2,0,7] ; [0,3,2,4,7] ; [3,0,2,4,7] ; [2,0,3,4,7] ; [0,2,3,4,7]
list_summation
list_summation:pairwise
5, 8, 3, 6
5+8=13 ; 3+6=9 ; 13+9=22
list_summation
list_summation:pairwise
7, 9, 8, 2
7+9=16 ; 8+2=10 ; 16+10=26
base_conversion
base_conversion:repeated-division
n=35,base=4
DIV:35/4=8,r:3 ; DIV:8/4=2,r:0 ; DIV:2/4=0,r:2 ; OUT:203
multidigit_addition
multidigit_addition:rounding-decomposition
467+860
round:470+860=1330 ; adjust:1330-3=1327 ; sum=1327
multidigit_addition
multidigit_addition:rounding-decomposition
175+348
round:180+348=528 ; adjust:528-5=523 ; sum=523
multidigit_addition
multidigit_addition:rounding-decomposition
187+120
round:190+120=310 ; adjust:310-3=307 ; sum=307
base_conversion
base_conversion:via-binary
n=183,base=16
BINLEN:8 ; CHUNK:0:11 ; CHUNK:1:7 ; OUT:B7
base_conversion
base_conversion:via-binary
n=63,base=16
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:15 ; OUT:3F
base_conversion
base_conversion:via-binary
n=131,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:0 ; CHUNK:6:1 ; CHUNK:7:1 ; OUT:10000011
list_summation
list_summation:right-to-left
0, 6, 2, 9
2+9=11 ; 6+11=17 ; 0+17=17
multidigit_addition
multidigit_addition:right-to-left-carry
483+911
d2:3+1+0=4→w4,c0 ; d1:8+1+0=9→w9,c0 ; d0:4+9+0=13→w3,c1 ; sum=1394
sorting_algorithms
sorting_algorithms:heap-sort
2, 9, 0, 3, 1
[9,2,0,3,1] ; [9,3,0,2,1] ; [1,3,0,2,9] ; [3,1,0,2,9] ; [3,2,0,1,9] ; [1,2,0,3,9] ; [2,1,0,3,9] ; [0,1,2,3,9] ; [1,0,2,3,9] ; [0,1,2,3,9]
multidigit_addition
multidigit_addition:right-to-left-carry
283+616
d2:3+6+0=9→w9,c0 ; d1:8+1+0=9→w9,c0 ; d0:2+6+0=8→w8,c0 ; sum=899
sorting_algorithms
sorting_algorithms:selection-sort
1, 9, 0, 6, 5
[0,9,1,6,5] ; [0,1,9,6,5] ; [0,1,5,6,9] ; [0,1,5,6,9]
multidigit_addition
multidigit_addition:rounding-decomposition
152+220
round:160+220=380 ; adjust:380-8=372 ; sum=372
linear_equation_solving
linear_equation_solving:inverse-ops
8x+64=128
8x+64=128 ; x=(128-64)/8 ; x=64/8 ; x=8
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-12=-18
3x-12=-18 ; x+-4=-6 ; x=-6--4 ; x=-2
list_summation
list_summation:left-to-right
4, 3, 6, 3
4+3=7 ; 7+6=13 ; 13+3=16
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(3,5)
R:(0,2) ; D:(1,2) ; R:(1,3) ; D:(2,3) ; R:(2,4) ; D:(3,4) ; R:(3,5)
list_summation
list_summation:right-to-left
5, 0, 4, 3
4+3=7 ; 0+7=7 ; 5+7=12
multidigit_addition
multidigit_addition:left-to-right-partials
246+611
p100:200+600=800 ; p10:40+10=50 ; p1:6+1=7 ; sum=800+50+7=857
linear_equation_solving
linear_equation_solving:inverse-ops
3x-6=-24
3x-6=-24 ; x=(-24--6)/3 ; x=-18/3 ; x=-6