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: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
list_summation
list_summation:right-to-left
7, 6, 9, 4
9+4=13 ; 6+13=19 ; 7+19=26
base_conversion
base_conversion:repeated-division
n=181,base=8
DIV:181/8=22,r:5 ; DIV:22/8=2,r:6 ; DIV:2/8=0,r:2 ; OUT:265
base_conversion
base_conversion:via-binary
n=59,base=4
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:2 ; CHUNK:2:3 ; OUT:323
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,4)
R:(4,3) ; D:(5,3) ; R:(5,4)
multidigit_addition
multidigit_addition:right-to-left-carry
563+402
d2:3+2+0=5→w5,c0 ; d1:6+0+0=6→w6,c0 ; d0:5+4+0=9→w9,c0 ; sum=965
multidigit_addition
multidigit_addition:rounding-decomposition
543+130
round:550+130=680 ; adjust:680-7=673 ; sum=673
sorting_algorithms
sorting_algorithms:bubble-sort
7, 8, 3, 9, 1
[7,3,8,9,1] ; [7,3,8,1,9] ; [3,7,8,1,9] ; [3,7,1,8,9] ; [3,1,7,8,9] ; [1,3,7,8,9]
list_summation
list_summation:right-to-left
0, 0, 8, 8
8+8=16 ; 0+16=16 ; 0+16=16
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,2) ; G=(4,3)
R:(3,3) ; D:(4,3)
list_summation
list_summation:right-to-left
9, 4, 3, 3
3+3=6 ; 4+6=10 ; 9+10=19
sorting_algorithms
sorting_algorithms:selection-sort
9, 6, 0, 8, 7
[0,6,9,8,7] ; [0,6,9,8,7] ; [0,6,7,8,9] ; [0,6,7,8,9]
sorting_algorithms
sorting_algorithms:heap-sort
6, 4, 8, 3, 7
[6,7,8,3,4] ; [8,7,6,3,4] ; [4,7,6,3,8] ; [7,4,6,3,8] ; [3,4,6,7,8] ; [6,4,3,7,8] ; [3,4,6,7,8] ; [4,3,6,7,8] ; [3,4,6,7,8]
base_conversion
base_conversion:repeated-division
n=97,base=4
DIV:97/4=24,r:1 ; DIV:24/4=6,r:0 ; DIV:6/4=1,r:2 ; DIV:1/4=0,r:1 ; OUT:1201
multidigit_addition
multidigit_addition:right-to-left-carry
689+875
d2:9+5+0=14→w4,c1 ; d1:8+7+1=16→w6,c1 ; d0:6+8+1=15→w5,c1 ; sum=1564
sorting_algorithms
sorting_algorithms:insertion-sort
5, 1, 4, 3, 7
[1,5,4,3,7] ; [1,4,5,3,7] ; [1,3,4,5,7] ; [1,3,4,5,7]
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)
sorting_algorithms
sorting_algorithms:selection-sort
5, 7, 6, 9, 2
[2,7,6,9,5] ; [2,5,6,9,7] ; [2,5,6,9,7] ; [2,5,6,7,9]
base_conversion
base_conversion:via-binary
n=89,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:3 ; CHUNK:2:1 ; OUT:131
list_summation
list_summation:left-to-right
7, 0, 2, 3
7+0=7 ; 7+2=9 ; 9+3=12
base_conversion
base_conversion:decomposition
n=247,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:1*2^1=2 ; TERM:1*2^0=1 ; OUT:11110111
multidigit_addition
multidigit_addition:rounding-decomposition
143+446
round:150+446=596 ; adjust:596-7=589 ; sum=589
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
base_conversion
base_conversion:via-binary
n=245,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:6 ; CHUNK:2:5 ; OUT:365
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(1,5)
R:(0,5) ; D:(1,5)
multidigit_addition
multidigit_addition:left-to-right-partials
922+319
p100:900+300=1200 ; p10:20+10=30 ; p1:2+9=11 ; sum=1200+30+11=1241
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,3) ; G=(1,4)
D:(1,3) ; R:(1,4)
multidigit_addition
multidigit_addition:left-to-right-partials
453+205
p100:400+200=600 ; p10:50+0=50 ; p1:3+5=8 ; sum=600+50+8=658
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(1,4)
R:(0,2) ; D:(1,2) ; R:(1,3) ; R:(1,4)
multidigit_addition
multidigit_addition:rounding-decomposition
830+944
round:830+944=1774 ; adjust:1774-0=1774 ; sum=1774
sorting_algorithms
sorting_algorithms:merge-sort
4, 9, 2, 6, 0
[2,4,6,9,0] ; [0,2,4,6,9]
linear_equation_solving
linear_equation_solving:inverse-ops
2x+16=26
2x+16=26 ; x=(26-16)/2 ; x=10/2 ; x=5
base_conversion
base_conversion:via-binary
n=48,base=4
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:0 ; CHUNK:2:0 ; OUT:300
base_conversion
base_conversion:via-binary
n=210,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:2 ; CHUNK:2:2 ; OUT:322
base_conversion
base_conversion:repeated-division
n=251,base=8
DIV:251/8=31,r:3 ; DIV:31/8=3,r:7 ; DIV:3/8=0,r:3 ; OUT:373
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)
base_conversion
base_conversion:via-binary
n=133,base=8
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:0 ; CHUNK:2:5 ; OUT:205
base_conversion
base_conversion:decomposition
n=191,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:10111111
list_summation
list_summation:pairwise
4, 5, 3, 7
4+5=9 ; 3+7=10 ; 9+10=19
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-6=-24
3x-6=-24 ; x=(-24--6)/3 ; x=-18/3 ; x=-6
base_conversion
base_conversion:repeated-division
n=135,base=4
DIV:135/4=33,r:3 ; DIV:33/4=8,r:1 ; DIV:8/4=2,r:0 ; DIV:2/4=0,r:2 ; OUT:2013
sorting_algorithms
sorting_algorithms:merge-sort
7, 4, 9, 2, 3
[4,7,9,2,3] ; [4,7,2,9,3] ; [2,4,7,9,3] ; [2,3,4,7,9]
multidigit_addition
multidigit_addition:rounding-decomposition
800+168
round:800+168=968 ; adjust:968-0=968 ; sum=968
list_summation
list_summation:right-to-left
6, 3, 5, 3
5+3=8 ; 3+8=11 ; 6+11=17
sorting_algorithms
sorting_algorithms:merge-sort
6, 2, 4, 9, 8
[2,6,4,9,8] ; [2,4,6,9,8] ; [2,4,6,8,9]
list_summation
list_summation:right-to-left
3, 3, 7, 2
7+2=9 ; 3+9=12 ; 3+12=15
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,0) ; G=(3,1)
R:(1,1) ; D:(2,1) ; D:(3,1)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
base_conversion
base_conversion:via-binary
n=241,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:3 ; CHUNK:2:0 ; CHUNK:3:1 ; OUT:3301
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+72=96
8x+72=96 ; 8x=24 ; x=3
sorting_algorithms
sorting_algorithms:merge-sort
5, 3, 1, 6, 9
[3,5,1,6,9] ; [1,3,5,6,9]
list_summation
list_summation:left-to-right
4, 4, 7, 7
4+4=8 ; 8+7=15 ; 15+7=22
sorting_algorithms
sorting_algorithms:heap-sort
4, 6, 8, 7, 9
[4,9,8,7,6] ; [9,4,8,7,6] ; [9,7,8,4,6] ; [6,7,8,4,9] ; [8,7,6,4,9] ; [4,7,6,8,9] ; [7,4,6,8,9] ; [6,4,7,8,9] ; [4,6,7,8,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,3) ; G=(4,5)
R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-7=-63
7x-7=-63 ; x+-1=-9 ; x=-9--1 ; x=-8
list_summation
list_summation:right-to-left
7, 2, 6, 5
6+5=11 ; 2+11=13 ; 7+13=20
multidigit_addition
multidigit_addition:right-to-left-carry
798+354
d2:8+4+0=12→w2,c1 ; d1:9+5+1=15→w5,c1 ; d0:7+3+1=11→w1,c1 ; sum=1152
base_conversion
base_conversion:via-binary
n=193,base=4
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:1 ; OUT:3001
sorting_algorithms
sorting_algorithms:insertion-sort
0, 6, 7, 2, 4
[0,6,7,2,4] ; [0,6,7,2,4] ; [0,2,6,7,4] ; [0,2,4,6,7]
sorting_algorithms
sorting_algorithms:selection-sort
3, 5, 1, 0, 2
[0,5,1,3,2] ; [0,1,5,3,2] ; [0,1,2,3,5] ; [0,1,2,3,5]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,2) ; G=(4,3)
R:(3,3) ; D:(4,3)
list_summation
list_summation:right-to-left
4, 8, 5, 3
5+3=8 ; 8+8=16 ; 4+16=20
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-35=-45
5x-35=-45 ; x+-7=-9 ; x=-9--7 ; x=-2
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,1) ; G=(5,2)
R:(4,2) ; D:(5,2)
list_summation
list_summation:left-to-right
5, 0, 4, 6
5+0=5 ; 5+4=9 ; 9+6=15
linear_equation_solving
linear_equation_solving:inverse-ops
3x-6=-18
3x-6=-18 ; x=(-18--6)/3 ; x=-12/3 ; x=-4
list_summation
list_summation:pairwise
4, 7, 4, 6
4+7=11 ; 4+6=10 ; 11+10=21
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)
list_summation
list_summation:right-to-left
9, 3, 7, 4
7+4=11 ; 3+11=14 ; 9+14=23
list_summation
list_summation:pairwise
8, 9, 3, 5
8+9=17 ; 3+5=8 ; 17+8=25
list_summation
list_summation:left-to-right
5, 3, 9, 2
5+3=8 ; 8+9=17 ; 17+2=19
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,3) ; G=(4,4)
R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4)
list_summation
list_summation:right-to-left
2, 8, 5, 7
5+7=12 ; 8+12=20 ; 2+20=22
list_summation
list_summation:left-to-right
7, 2, 1, 5
7+2=9 ; 9+1=10 ; 10+5=15
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)
list_summation
list_summation:left-to-right
4, 6, 9, 9
4+6=10 ; 10+9=19 ; 19+9=28
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,0) ; G=(5,4)
R:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4)
sorting_algorithms
sorting_algorithms:insertion-sort
6, 7, 1, 8, 0
[6,7,1,8,0] ; [1,6,7,8,0] ; [1,6,7,8,0] ; [0,1,6,7,8]
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+36=72
9x+36=72 ; x+4=8 ; x=8-4 ; x=4
list_summation
list_summation:left-to-right
2, 2, 6, 7
2+2=4 ; 4+6=10 ; 10+7=17
sorting_algorithms
sorting_algorithms:insertion-sort
7, 0, 2, 3, 6
[0,7,2,3,6] ; [0,2,7,3,6] ; [0,2,3,7,6] ; [0,2,3,6,7]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,4) ; G=(4,5)
R:(3,5) ; D:(4,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+35=-10
5x+35=-10 ; x+7=-2 ; x=-2-7 ; x=-9
base_conversion
base_conversion:decomposition
n=41,base=4
TERM:2*4^2=32 ; TERM:2*4^1=8 ; TERM:1*4^0=1 ; OUT:221
sorting_algorithms
sorting_algorithms:heap-sort
1, 0, 2, 6, 4
[1,6,2,0,4] ; [6,1,2,0,4] ; [6,4,2,0,1] ; [1,4,2,0,6] ; [4,1,2,0,6] ; [0,1,2,4,6] ; [2,1,0,4,6] ; [0,1,2,4,6] ; [1,0,2,4,6] ; [0,1,2,4,6]
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x-32=-48
8x-32=-48 ; x+-4=-6 ; x=-6--4 ; x=-2
base_conversion
base_conversion:repeated-division
n=185,base=16
DIV:185/16=11,r:9 ; DIV:11/16=0,r:11 ; OUT:B9
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-6=18
6x-6=18 ; x+-1=3 ; x=3--1 ; x=4
multidigit_addition
multidigit_addition:right-to-left-carry
943+515
d2:3+5+0=8→w8,c0 ; d1:4+1+0=5→w5,c0 ; d0:9+5+0=14→w4,c1 ; sum=1458
base_conversion
base_conversion:repeated-division
n=233,base=4
DIV:233/4=58,r:1 ; DIV:58/4=14,r:2 ; DIV:14/4=3,r:2 ; DIV:3/4=0,r:3 ; OUT:3221
base_conversion
base_conversion:via-binary
n=198,base=16
BINLEN:8 ; CHUNK:0:12 ; CHUNK:1:6 ; OUT:C6
sorting_algorithms
sorting_algorithms:merge-sort
1, 2, 0, 5, 4
[0,1,2,5,4] ; [0,1,2,4,5]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,3) ; G=(1,5)
R:(0,4) ; R:(0,5) ; D:(1,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+27=6
3x+27=6 ; x+9=2 ; x=2-9 ; x=-7
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,1) ; G=(5,5)
R:(0,2) ; R:(0,3) ; R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
sorting_algorithms
sorting_algorithms:selection-sort
4, 9, 8, 6, 1
[1,9,8,6,4] ; [1,4,8,6,9] ; [1,4,6,8,9] ; [1,4,6,8,9]
sorting_algorithms
sorting_algorithms:heap-sort
3, 2, 0, 8, 9
[3,9,0,8,2] ; [9,3,0,8,2] ; [9,8,0,3,2] ; [2,8,0,3,9] ; [8,2,0,3,9] ; [8,3,0,2,9] ; [2,3,0,8,9] ; [3,2,0,8,9] ; [0,2,3,8,9] ; [2,0,3,8,9] ; [0,2,3,8,9]
list_summation
list_summation:left-to-right
6, 0, 4, 5
6+0=6 ; 6+4=10 ; 10+5=15
sorting_algorithms
sorting_algorithms:selection-sort
6, 8, 2, 7, 4
[2,8,6,7,4] ; [2,4,6,7,8] ; [2,4,6,7,8] ; [2,4,6,7,8]