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:via-binary
n=248,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:7 ; CHUNK:2:0 ; OUT:370
sorting_algorithms
sorting_algorithms:merge-sort
5, 2, 1, 4, 8
[2,5,1,4,8] ; [1,2,4,5,8]
list_summation
list_summation:left-to-right
7, 5, 6, 4
7+5=12 ; 12+6=18 ; 18+4=22
base_conversion
base_conversion:repeated-division
n=40,base=8
DIV:40/8=5,r:0 ; DIV:5/8=0,r:5 ; OUT:50
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,0) ; G=(5,4)
D:(1,0) ; D:(2,0) ; D:(3,0) ; D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,4) ; G=(1,5)
R:(0,5) ; D:(1,5)
base_conversion
base_conversion:repeated-division
n=160,base=8
DIV:160/8=20,r:0 ; DIV:20/8=2,r:4 ; DIV:2/8=0,r:2 ; OUT:240
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(2,4)
D:(2,2) ; R:(2,3) ; R:(2,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,0) ; G=(3,2)
R:(0,1) ; R:(0,2) ; D:(1,2) ; D:(2,2) ; D:(3,2)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,3) ; G=(4,4)
D:(3,3) ; D:(4,3) ; R:(4,4)
list_summation
list_summation:left-to-right
7, 9, 3, 4
7+9=16 ; 16+3=19 ; 19+4=23
sorting_algorithms
sorting_algorithms:heap-sort
9, 8, 1, 6, 7
[7,8,1,6,9] ; [8,7,1,6,9] ; [6,7,1,8,9] ; [7,6,1,8,9] ; [1,6,7,8,9] ; [6,1,7,8,9] ; [1,6,7,8,9]
sorting_algorithms
sorting_algorithms:bubble-sort
3, 0, 7, 6, 9
[0,3,7,6,9] ; [0,3,6,7,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,4) ; G=(4,5)
R:(2,5) ; D:(3,5) ; D:(4,5)
base_conversion
base_conversion:decomposition
n=28,base=4
TERM:1*4^2=16 ; TERM:3*4^1=12 ; TERM:0*4^0=0 ; OUT:130
linear_equation_solving
linear_equation_solving:inverse-ops
6x+24=-12
6x+24=-12 ; x=(-12-24)/6 ; x=-36/6 ; x=-6
list_summation
list_summation:pairwise
9, 0, 1, 4
9+0=9 ; 1+4=5 ; 9+5=14
base_conversion
base_conversion:repeated-division
n=202,base=8
DIV:202/8=25,r:2 ; DIV:25/8=3,r:1 ; DIV:3/8=0,r:3 ; OUT:312
base_conversion
base_conversion:via-binary
n=43,base=2
BINLEN:6 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:1 ; OUT:101011
sorting_algorithms
sorting_algorithms:selection-sort
7, 0, 6, 4, 3
[0,7,6,4,3] ; [0,3,6,4,7] ; [0,3,4,6,7] ; [0,3,4,6,7]
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-54=-72
6x-54=-72 ; x+-9=-12 ; x=-12--9 ; x=-3
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+63=119
7x+63=119 ; x+9=17 ; x=17-9 ; x=8
list_summation
list_summation:right-to-left
5, 3, 4, 9
4+9=13 ; 3+13=16 ; 5+16=21
list_summation
list_summation:left-to-right
7, 2, 7, 3
7+2=9 ; 9+7=16 ; 16+3=19
base_conversion
base_conversion:repeated-division
n=145,base=8
DIV:145/8=18,r:1 ; DIV:18/8=2,r:2 ; DIV:2/8=0,r:2 ; OUT:221
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; R:(4,5) ; D:(5,5)
sorting_algorithms
sorting_algorithms:merge-sort
7, 8, 5, 6, 2
[5,6,7,8,2] ; [2,5,6,7,8]
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=(3,4) ; G=(4,5)
D:(4,4) ; R:(4,5)
base_conversion
base_conversion:decomposition
n=110,base=8
TERM:1*8^2=64 ; TERM:5*8^1=40 ; TERM:6*8^0=6 ; OUT:156
sorting_algorithms
sorting_algorithms:merge-sort
3, 2, 0, 5, 1
[2,3,0,5,1] ; [0,2,3,5,1] ; [0,1,2,3,5]
linear_equation_solving
linear_equation_solving:inverse-ops
8x+24=-40
8x+24=-40 ; x=(-40-24)/8 ; x=-64/8 ; x=-8
base_conversion
base_conversion:decomposition
n=11,base=4
TERM:2*4^1=8 ; TERM:3*4^0=3 ; OUT:23
list_summation
list_summation:left-to-right
6, 2, 4, 4
6+2=8 ; 8+4=12 ; 12+4=16
list_summation
list_summation:pairwise
5, 4, 5, 7
5+4=9 ; 5+7=12 ; 9+12=21
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:selection-sort
3, 1, 6, 0, 2
[0,1,6,3,2] ; [0,1,6,3,2] ; [0,1,2,3,6] ; [0,1,2,3,6]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(2,5)
R:(0,5) ; D:(1,5) ; D:(2,5)
sorting_algorithms
sorting_algorithms:bubble-sort
8, 3, 2, 5, 9
[3,8,2,5,9] ; [3,2,8,5,9] ; [3,2,5,8,9] ; [2,3,5,8,9]
multidigit_addition
multidigit_addition:left-to-right-partials
264+249
p100:200+200=400 ; p10:60+40=100 ; p1:4+9=13 ; sum=400+100+13=513
multidigit_addition
multidigit_addition:right-to-left-carry
236+876
d2:6+6+0=12→w2,c1 ; d1:3+7+1=11→w1,c1 ; d0:2+8+1=11→w1,c1 ; sum=1112
base_conversion
base_conversion:via-binary
n=43,base=16
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:11 ; OUT:2B
list_summation
list_summation:pairwise
3, 5, 1, 7
3+5=8 ; 1+7=8 ; 8+8=16
sorting_algorithms
sorting_algorithms:insertion-sort
1, 3, 4, 0, 5
[1,3,4,0,5] ; [1,3,4,0,5] ; [0,1,3,4,5] ; [0,1,3,4,5]
base_conversion
base_conversion:decomposition
n=218,base=8
TERM:3*8^2=192 ; TERM:3*8^1=24 ; TERM:2*8^0=2 ; OUT:332
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,4) ; G=(5,5)
R:(3,5) ; D:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x-28=-64
4x-28=-64 ; 4x=-36 ; x=-9
sorting_algorithms
sorting_algorithms:bubble-sort
4, 1, 7, 2, 6
[1,4,7,2,6] ; [1,4,2,7,6] ; [1,4,2,6,7] ; [1,2,4,6,7]
multidigit_addition
multidigit_addition:left-to-right-partials
745+378
p100:700+300=1000 ; p10:40+70=110 ; p1:5+8=13 ; sum=1000+110+13=1123
list_summation
list_summation:pairwise
1, 4, 8, 2
1+4=5 ; 8+2=10 ; 5+10=15
multidigit_addition
multidigit_addition:right-to-left-carry
249+970
d2:9+0+0=9→w9,c0 ; d1:4+7+0=11→w1,c1 ; d0:2+9+1=12→w2,c1 ; sum=1219
multidigit_addition
multidigit_addition:rounding-decomposition
698+791
round:700+791=1491 ; adjust:1491-2=1489 ; sum=1489
linear_equation_solving
linear_equation_solving:inverse-ops
8x+8=-32
8x+8=-32 ; x=(-32-8)/8 ; x=-40/8 ; x=-5
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,4) ; G=(4,5)
R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
sorting_algorithms
sorting_algorithms:bubble-sort
9, 6, 1, 8, 4
[6,9,1,8,4] ; [6,1,9,8,4] ; [6,1,8,9,4] ; [6,1,8,4,9] ; [1,6,8,4,9] ; [1,6,4,8,9] ; [1,4,6,8,9]
base_conversion
base_conversion:decomposition
n=183,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:10110111
sorting_algorithms
sorting_algorithms:merge-sort
0, 4, 2, 6, 5
[0,2,4,6,5] ; [0,2,4,5,6]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,4) ; G=(2,5)
R:(1,5) ; D:(2,5)
base_conversion
base_conversion:repeated-division
n=84,base=16
DIV:84/16=5,r:4 ; DIV:5/16=0,r:5 ; OUT:54
list_summation
list_summation:right-to-left
8, 8, 8, 9
8+9=17 ; 8+17=25 ; 8+25=33
sorting_algorithms
sorting_algorithms:insertion-sort
0, 4, 6, 1, 3
[0,4,6,1,3] ; [0,4,6,1,3] ; [0,1,4,6,3] ; [0,1,3,4,6]
list_summation
list_summation:right-to-left
8, 3, 8, 7
8+7=15 ; 3+15=18 ; 8+18=26
linear_equation_solving
linear_equation_solving:inverse-ops
9x-27=45
9x-27=45 ; x=(45--27)/9 ; x=72/9 ; x=8
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,4) ; G=(4,5)
R:(2,5) ; D:(3,5) ; D:(4,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,1) ; G=(5,5)
D:(2,1) ; D:(3,1) ; D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
base_conversion
base_conversion:repeated-division
n=127,base=8
DIV:127/8=15,r:7 ; DIV:15/8=1,r:7 ; DIV:1/8=0,r:1 ; OUT:177
linear_equation_solving
linear_equation_solving:inverse-ops
8x+32=104
8x+32=104 ; x=(104-32)/8 ; x=72/8 ; x=9
multidigit_addition
multidigit_addition:right-to-left-carry
773+203
d2:3+3+0=6→w6,c0 ; d1:7+0+0=7→w7,c0 ; d0:7+2+0=9→w9,c0 ; sum=976
base_conversion
base_conversion:via-binary
n=195,base=16
BINLEN:8 ; CHUNK:0:12 ; CHUNK:1:3 ; OUT:C3
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,3) ; G=(5,4)
R:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(5,2)
D:(2,0) ; D:(3,0) ; D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2)
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)
sorting_algorithms
sorting_algorithms:merge-sort
0, 6, 2, 7, 4
[0,2,6,7,4] ; [0,2,4,6,7]
list_summation
list_summation:pairwise
2, 6, 2, 6
2+6=8 ; 2+6=8 ; 8+8=16
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,0) ; G=(4,3)
R:(3,1) ; D:(4,1) ; R:(4,2) ; R:(4,3)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,0) ; G=(3,5)
R:(0,1) ; R:(0,2) ; R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5)
linear_equation_solving
linear_equation_solving:inverse-ops
7x+63=35
7x+63=35 ; x=(35-63)/7 ; x=-28/7 ; x=-4
base_conversion
base_conversion:decomposition
n=148,base=4
TERM:2*4^3=128 ; TERM:1*4^2=16 ; TERM:1*4^1=4 ; TERM:0*4^0=0 ; OUT:2110
list_summation
list_summation:right-to-left
3, 6, 0, 3
0+3=3 ; 6+3=9 ; 3+9=12
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,4) ; G=(2,5)
D:(1,4) ; D:(2,4) ; R:(2,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,3) ; G=(1,5)
R:(0,4) ; R:(0,5) ; D:(1,5)
base_conversion
base_conversion:repeated-division
n=112,base=2
DIV:112/2=56,r:0 ; DIV:56/2=28,r:0 ; 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:1110000
multidigit_addition
multidigit_addition:rounding-decomposition
548+987
round:550+987=1537 ; adjust:1537-2=1535 ; sum=1535
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-12=-42
6x-12=-42 ; 6x=-30 ; x=-5
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+24=-16
8x+24=-16 ; 8x=-40 ; x=-5
multidigit_addition
multidigit_addition:left-to-right-partials
487+363
p100:400+300=700 ; p10:80+60=140 ; p1:7+3=10 ; sum=700+140+10=850
list_summation
list_summation:right-to-left
7, 0, 8, 6
8+6=14 ; 0+14=14 ; 7+14=21
multidigit_addition
multidigit_addition:left-to-right-partials
672+818
p100:600+800=1400 ; p10:70+10=80 ; p1:2+8=10 ; sum=1400+80+10=1490
base_conversion
base_conversion:repeated-division
n=234,base=4
DIV:234/4=58,r:2 ; DIV:58/4=14,r:2 ; DIV:14/4=3,r:2 ; DIV:3/4=0,r:3 ; OUT:3222
base_conversion
base_conversion:repeated-division
n=203,base=16
DIV:203/16=12,r:11 ; DIV:12/16=0,r:12 ; OUT:CB
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(5,3)
R:(2,2) ; R:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,4)
R:(4,3) ; D:(5,3) ; R:(5,4)
list_summation
list_summation:right-to-left
4, 3, 0, 3
0+3=3 ; 3+3=6 ; 4+6=10
sorting_algorithms
sorting_algorithms:insertion-sort
2, 1, 3, 4, 9
[1,2,3,4,9] ; [1,2,3,4,9] ; [1,2,3,4,9] ; [1,2,3,4,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-12=36
6x-12=36 ; 6x=48 ; x=8
base_conversion
base_conversion:via-binary
n=107,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:0 ; CHUNK:5:1 ; CHUNK:6:1 ; OUT:1101011
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(4,3)
D:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; R:(4,3)
base_conversion
base_conversion:via-binary
n=45,base=16
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:13 ; OUT:2D
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,2) ; G=(4,4)
R:(0,3) ; D:(1,3) ; R:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4)