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:pairwise
6, 7, 2, 8
6+7=13 ; 2+8=10 ; 13+10=23
multidigit_addition
multidigit_addition:right-to-left-carry
753+454
d2:3+4+0=7→w7,c0 ; d1:5+5+0=10→w0,c1 ; d0:7+4+1=12→w2,c1 ; sum=1207
base_conversion
base_conversion:repeated-division
n=70,base=2
DIV:70/2=35,r:0 ; DIV:35/2=17,r:1 ; DIV:17/2=8,r:1 ; DIV:8/2=4,r:0 ; DIV:4/2=2,r:0 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:1000110
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,2) ; G=(5,4)
D:(3,2) ; D:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4)
sorting_algorithms
sorting_algorithms:heap-sort
3, 8, 4, 5, 0
[8,3,4,5,0] ; [8,5,4,3,0] ; [0,5,4,3,8] ; [5,0,4,3,8] ; [5,3,4,0,8] ; [0,3,4,5,8] ; [4,3,0,5,8] ; [0,3,4,5,8] ; [3,0,4,5,8] ; [0,3,4,5,8]
sorting_algorithms
sorting_algorithms:bubble-sort
4, 6, 9, 3, 5
[4,6,3,9,5] ; [4,6,3,5,9] ; [4,3,6,5,9] ; [4,3,5,6,9] ; [3,4,5,6,9]
sorting_algorithms
sorting_algorithms:selection-sort
0, 2, 6, 4, 3
[0,2,6,4,3] ; [0,2,6,4,3] ; [0,2,3,4,6] ; [0,2,3,4,6]
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+72=8
8x+72=8 ; 8x=-64 ; x=-8
multidigit_addition
multidigit_addition:left-to-right-partials
997+763
p100:900+700=1600 ; p10:90+60=150 ; p1:7+3=10 ; sum=1600+150+10=1760
sorting_algorithms
sorting_algorithms:selection-sort
7, 0, 4, 1, 5
[0,7,4,1,5] ; [0,1,4,7,5] ; [0,1,4,7,5] ; [0,1,4,5,7]
base_conversion
base_conversion:repeated-division
n=84,base=8
DIV:84/8=10,r:4 ; DIV:10/8=1,r:2 ; DIV:1/8=0,r:1 ; OUT:124
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,0) ; G=(5,5)
D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:bubble-sort
7, 5, 2, 1, 3
[5,7,2,1,3] ; [5,2,7,1,3] ; [5,2,1,7,3] ; [5,2,1,3,7] ; [2,5,1,3,7] ; [2,1,5,3,7] ; [2,1,3,5,7] ; [1,2,3,5,7]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,3) ; G=(5,5)
R:(3,4) ; D:(4,4) ; R:(4,5) ; D:(5,5)
list_summation
list_summation:right-to-left
5, 9, 1, 5
1+5=6 ; 9+6=15 ; 5+15=20
linear_equation_solving
linear_equation_solving:inverse-ops
8x+48=48
8x+48=48 ; x=(48-48)/8 ; x=0/8 ; x=0
sorting_algorithms
sorting_algorithms:bubble-sort
7, 2, 9, 3, 4
[2,7,9,3,4] ; [2,7,3,9,4] ; [2,7,3,4,9] ; [2,3,7,4,9] ; [2,3,4,7,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,1) ; G=(5,2)
R:(3,2) ; D:(4,2) ; D:(5,2)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(3,1)
R:(2,1) ; D:(3,1)
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+24=88
8x+24=88 ; x+3=11 ; x=11-3 ; x=8
linear_equation_solving
linear_equation_solving:inverse-ops
8x+32=8
8x+32=8 ; x=(8-32)/8 ; x=-24/8 ; x=-3
list_summation
list_summation:pairwise
2, 8, 7, 7
2+8=10 ; 7+7=14 ; 10+14=24
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
base_conversion
base_conversion:via-binary
n=200,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:0 ; OUT:11001000
base_conversion
base_conversion:decomposition
n=133,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:1*2^2=4 ; TERM:0*2^1=0 ; TERM:1*2^0=1 ; OUT:10000101
sorting_algorithms
sorting_algorithms:insertion-sort
9, 6, 8, 5, 2
[6,9,8,5,2] ; [6,8,9,5,2] ; [5,6,8,9,2] ; [2,5,6,8,9]
base_conversion
base_conversion:decomposition
n=199,base=16
TERM:12*16^1=192 ; TERM:7*16^0=7 ; OUT:C7
linear_equation_solving
linear_equation_solving:inverse-ops
5x+0=-5
5x+0=-5 ; x=(-5-0)/5 ; x=-5/5 ; x=-1
base_conversion
base_conversion:decomposition
n=91,base=2
TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:1011011
linear_equation_solving
linear_equation_solving:inverse-ops
9x+18=-27
9x+18=-27 ; x=(-27-18)/9 ; x=-45/9 ; x=-5
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,0) ; G=(3,4)
D:(3,0) ; R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4)
multidigit_addition
multidigit_addition:left-to-right-partials
589+227
p100:500+200=700 ; p10:80+20=100 ; p1:9+7=16 ; sum=700+100+16=816
base_conversion
base_conversion:via-binary
n=6,base=16
BINLEN:3 ; CHUNK:0:6 ; OUT:6
base_conversion
base_conversion:decomposition
n=23,base=16
TERM:1*16^1=16 ; TERM:7*16^0=7 ; OUT:17
sorting_algorithms
sorting_algorithms:bubble-sort
9, 2, 5, 6, 8
[2,9,5,6,8] ; [2,5,9,6,8] ; [2,5,6,9,8] ; [2,5,6,8,9]
sorting_algorithms
sorting_algorithms:merge-sort
3, 5, 4, 9, 7
[3,4,5,9,7] ; [3,4,5,7,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,4) ; G=(3,5)
R:(2,5) ; D:(3,5)
multidigit_addition
multidigit_addition:right-to-left-carry
416+414
d2:6+4+0=10→w0,c1 ; d1:1+1+1=3→w3,c0 ; d0:4+4+0=8→w8,c0 ; sum=830
multidigit_addition
multidigit_addition:right-to-left-carry
578+657
d2:8+7+0=15→w5,c1 ; d1:7+5+1=13→w3,c1 ; d0:5+6+1=12→w2,c1 ; sum=1235
list_summation
list_summation:right-to-left
4, 8, 8, 1
8+1=9 ; 8+9=17 ; 4+17=21
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+2=16
2x+2=16 ; 2x=14 ; x=7
list_summation
list_summation:right-to-left
2, 8, 0, 3
0+3=3 ; 8+3=11 ; 2+11=13
sorting_algorithms
sorting_algorithms:merge-sort
1, 5, 9, 8, 2
[1,5,8,9,2] ; [1,2,5,8,9]
list_summation
list_summation:pairwise
0, 7, 3, 4
0+7=7 ; 3+4=7 ; 7+7=14
base_conversion
base_conversion:via-binary
n=54,base=4
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:2 ; OUT:312
base_conversion
base_conversion:via-binary
n=49,base=2
BINLEN:6 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:1 ; OUT:110001
linear_equation_solving
linear_equation_solving:inverse-ops
3x-3=21
3x-3=21 ; x=(21--3)/3 ; x=24/3 ; x=8
base_conversion
base_conversion:repeated-division
n=136,base=2
DIV:136/2=68,r:0 ; DIV:68/2=34,r:0 ; DIV:34/2=17,r:0 ; DIV:17/2=8,r:1 ; DIV:8/2=4,r:0 ; DIV:4/2=2,r:0 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:10001000
list_summation
list_summation:pairwise
0, 5, 3, 8
0+5=5 ; 3+8=11 ; 5+11=16
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,2)
D:(5,1) ; R:(5,2)
sorting_algorithms
sorting_algorithms:bubble-sort
6, 0, 7, 4, 8
[0,6,7,4,8] ; [0,6,4,7,8] ; [0,4,6,7,8]
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+35=55
5x+35=55 ; 5x=20 ; x=4
base_conversion
base_conversion:decomposition
n=105,base=16
TERM:6*16^1=96 ; TERM:9*16^0=9 ; OUT:69
list_summation
list_summation:right-to-left
7, 7, 9, 3
9+3=12 ; 7+12=19 ; 7+19=26
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+40=-5
5x+40=-5 ; 5x=-45 ; x=-9
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,2) ; G=(4,5)
R:(3,3) ; R:(3,4) ; R:(3,5) ; D:(4,5)
base_conversion
base_conversion:repeated-division
n=9,base=8
DIV:9/8=1,r:1 ; DIV:1/8=0,r:1 ; OUT:11
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-24=-4
4x-24=-4 ; x+-6=-1 ; x=-1--6 ; x=5
multidigit_addition
multidigit_addition:rounding-decomposition
624+583
round:630+583=1213 ; adjust:1213-6=1207 ; sum=1207
base_conversion
base_conversion:via-binary
n=98,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:1 ; CHUNK:6:0 ; OUT:1100010
sorting_algorithms
sorting_algorithms:bubble-sort
9, 3, 0, 6, 1
[3,9,0,6,1] ; [3,0,9,6,1] ; [3,0,6,9,1] ; [3,0,6,1,9] ; [0,3,6,1,9] ; [0,3,1,6,9] ; [0,1,3,6,9]
multidigit_addition
multidigit_addition:right-to-left-carry
304+926
d2:4+6+0=10→w0,c1 ; d1:0+2+1=3→w3,c0 ; d0:3+9+0=12→w2,c1 ; sum=1230
sorting_algorithms
sorting_algorithms:heap-sort
4, 1, 0, 5, 3
[4,5,0,1,3] ; [5,4,0,1,3] ; [3,4,0,1,5] ; [4,3,0,1,5] ; [1,3,0,4,5] ; [3,1,0,4,5] ; [0,1,3,4,5] ; [1,0,3,4,5] ; [0,1,3,4,5]
base_conversion
base_conversion:repeated-division
n=137,base=2
DIV:137/2=68,r:1 ; DIV:68/2=34,r:0 ; DIV:34/2=17,r:0 ; DIV:17/2=8,r:1 ; DIV:8/2=4,r:0 ; DIV:4/2=2,r:0 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:10001001
base_conversion
base_conversion:via-binary
n=252,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:7 ; CHUNK:2:4 ; OUT:374
base_conversion
base_conversion:repeated-division
n=231,base=2
DIV:231/2=115,r:1 ; DIV:115/2=57,r:1 ; DIV:57/2=28,r:1 ; DIV:28/2=14,r:0 ; 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:11100111
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; R:(4,5) ; D:(5,5)
base_conversion
base_conversion:decomposition
n=196,base=2
TERM:1*2^7=128 ; 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:0*2^1=0 ; TERM:0*2^0=0 ; OUT:11000100
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-40=-10
5x-40=-10 ; 5x=30 ; x=6
base_conversion
base_conversion:decomposition
n=15,base=8
TERM:1*8^1=8 ; TERM:7*8^0=7 ; OUT:17
list_summation
list_summation:left-to-right
8, 6, 3, 8
8+6=14 ; 14+3=17 ; 17+8=25
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)
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+6=22
2x+6=22 ; x+3=11 ; x=11-3 ; x=8
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x+3=30
3x+3=30 ; 3x=27 ; x=9
multidigit_addition
multidigit_addition:right-to-left-carry
762+591
d2:2+1+0=3→w3,c0 ; d1:6+9+0=15→w5,c1 ; d0:7+5+1=13→w3,c1 ; sum=1353
list_summation
list_summation:pairwise
4, 7, 2, 3
4+7=11 ; 2+3=5 ; 11+5=16
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:divide-then-subtract
5x+25=-5
5x+25=-5 ; x+5=-1 ; x=-1-5 ; x=-6
sorting_algorithms
sorting_algorithms:selection-sort
2, 1, 6, 3, 0
[0,1,6,3,2] ; [0,1,6,3,2] ; [0,1,2,3,6] ; [0,1,2,3,6]
sorting_algorithms
sorting_algorithms:insertion-sort
3, 1, 0, 5, 6
[1,3,0,5,6] ; [0,1,3,5,6] ; [0,1,3,5,6] ; [0,1,3,5,6]
sorting_algorithms
sorting_algorithms:bubble-sort
6, 8, 2, 4, 0
[6,2,8,4,0] ; [6,2,4,8,0] ; [6,2,4,0,8] ; [2,6,4,0,8] ; [2,4,6,0,8] ; [2,4,0,6,8] ; [2,0,4,6,8] ; [0,2,4,6,8]
list_summation
list_summation:right-to-left
5, 5, 3, 2
3+2=5 ; 5+5=10 ; 5+10=15
multidigit_addition
multidigit_addition:left-to-right-partials
912+481
p100:900+400=1300 ; p10:10+80=90 ; p1:2+1=3 ; sum=1300+90+3=1393
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,4) ; G=(2,5)
D:(1,4) ; D:(2,4) ; R:(2,5)
list_summation
list_summation:right-to-left
9, 9, 3, 8
3+8=11 ; 9+11=20 ; 9+20=29
list_summation
list_summation:pairwise
5, 1, 1, 9
5+1=6 ; 1+9=10 ; 6+10=16
base_conversion
base_conversion:decomposition
n=31,base=8
TERM:3*8^1=24 ; TERM:7*8^0=7 ; OUT:37
sorting_algorithms
sorting_algorithms:selection-sort
4, 7, 3, 2, 6
[2,7,3,4,6] ; [2,3,7,4,6] ; [2,3,4,7,6] ; [2,3,4,6,7]
multidigit_addition
multidigit_addition:left-to-right-partials
485+575
p100:400+500=900 ; p10:80+70=150 ; p1:5+5=10 ; sum=900+150+10=1060
multidigit_addition
multidigit_addition:right-to-left-carry
590+728
d2:0+8+0=8→w8,c0 ; d1:9+2+0=11→w1,c1 ; d0:5+7+1=13→w3,c1 ; sum=1318
linear_equation_solving
linear_equation_solving:inverse-ops
5x+0=-30
5x+0=-30 ; x=(-30-0)/5 ; x=-30/5 ; x=-6
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(3,5)
R:(1,5) ; D:(2,5) ; D:(3,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,1) ; G=(4,4)
D:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4)
list_summation
list_summation:pairwise
0, 1, 2, 6
0+1=1 ; 2+6=8 ; 1+8=9
sorting_algorithms
sorting_algorithms:bubble-sort
0, 3, 1, 6, 8
[0,1,3,6,8]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,1) ; G=(5,5)
D:(3,1) ; D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,2)
D:(5,1) ; R:(5,2)
multidigit_addition
multidigit_addition:right-to-left-carry
548+159
d2:8+9+0=17→w7,c1 ; d1:4+5+1=10→w0,c1 ; d0:5+1+1=7→w7,c0 ; sum=707
sorting_algorithms
sorting_algorithms:bubble-sort
3, 2, 6, 9, 7
[2,3,6,9,7] ; [2,3,6,7,9]
list_summation
list_summation:pairwise
2, 2, 9, 3
2+2=4 ; 9+3=12 ; 4+12=16