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
sorting_algorithms
sorting_algorithms:insertion-sort
4, 1, 5, 0, 9
[1,4,5,0,9] ; [1,4,5,0,9] ; [0,1,4,5,9] ; [0,1,4,5,9]
linear_equation_solving
linear_equation_solving:inverse-ops
4x+24=4
4x+24=4 ; x=(4-24)/4 ; x=-20/4 ; x=-5
sorting_algorithms
sorting_algorithms:merge-sort
4, 2, 3, 5, 7
[2,4,3,5,7] ; [2,3,4,5,7]
multidigit_addition
multidigit_addition:left-to-right-partials
508+189
p100:500+100=600 ; p10:0+80=80 ; p1:8+9=17 ; sum=600+80+17=697
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
base_conversion
base_conversion:decomposition
n=235,base=4
TERM:3*4^3=192 ; TERM:2*4^2=32 ; TERM:2*4^1=8 ; TERM:3*4^0=3 ; OUT:3223
sorting_algorithms
sorting_algorithms:bubble-sort
1, 0, 9, 8, 6
[0,1,9,8,6] ; [0,1,8,9,6] ; [0,1,8,6,9] ; [0,1,6,8,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(5,5)
R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
list_summation
list_summation:left-to-right
3, 5, 6, 2
3+5=8 ; 8+6=14 ; 14+2=16
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(2,3)
R:(0,3) ; D:(1,3) ; D:(2,3)
list_summation
list_summation:left-to-right
7, 9, 2, 8
7+9=16 ; 16+2=18 ; 18+8=26
base_conversion
base_conversion:decomposition
n=147,base=16
TERM:9*16^1=144 ; TERM:3*16^0=3 ; OUT:93
multidigit_addition
multidigit_addition:rounding-decomposition
863+681
round:870+681=1551 ; adjust:1551-7=1544 ; sum=1544
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)
list_summation
list_summation:right-to-left
8, 7, 9, 0
9+0=9 ; 7+9=16 ; 8+16=24
list_summation
list_summation:left-to-right
7, 1, 7, 7
7+1=8 ; 8+7=15 ; 15+7=22
linear_equation_solving
linear_equation_solving:subtract-then-divide
3x-9=12
3x-9=12 ; 3x=21 ; x=7
sorting_algorithms
sorting_algorithms:selection-sort
0, 1, 4, 5, 2
[0,1,4,5,2] ; [0,1,4,5,2] ; [0,1,2,5,4] ; [0,1,2,4,5]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(4,2)
R:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2)
sorting_algorithms
sorting_algorithms:heap-sort
4, 3, 6, 0, 9
[4,9,6,0,3] ; [9,4,6,0,3] ; [3,4,6,0,9] ; [6,4,3,0,9] ; [0,4,3,6,9] ; [4,0,3,6,9] ; [3,0,4,6,9] ; [0,3,4,6,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,0) ; G=(5,1)
R:(4,1) ; D:(5,1)
sorting_algorithms
sorting_algorithms:heap-sort
6, 9, 0, 3, 8
[9,6,0,3,8] ; [9,8,0,3,6] ; [6,8,0,3,9] ; [8,6,0,3,9] ; [3,6,0,8,9] ; [6,3,0,8,9] ; [0,3,6,8,9] ; [3,0,6,8,9] ; [0,3,6,8,9]
list_summation
list_summation:right-to-left
4, 6, 2, 2
2+2=4 ; 6+4=10 ; 4+10=14
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+18=36
6x+18=36 ; x+3=6 ; x=6-3 ; x=3
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-30=-12
6x-30=-12 ; x+-5=-2 ; x=-2--5 ; x=3
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x+0=21
3x+0=21 ; x+0=7 ; x=7-0 ; x=7
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+8=26
2x+8=26 ; 2x=18 ; x=9
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,2)
D:(5,1) ; R:(5,2)
list_summation
list_summation:left-to-right
2, 3, 2, 9
2+3=5 ; 5+2=7 ; 7+9=16
base_conversion
base_conversion:decomposition
n=149,base=8
TERM:2*8^2=128 ; TERM:2*8^1=16 ; TERM:5*8^0=5 ; OUT:225
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,2) ; G=(5,3)
R:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3)
multidigit_addition
multidigit_addition:right-to-left-carry
403+930
d2:3+0+0=3→w3,c0 ; d1:0+3+0=3→w3,c0 ; d0:4+9+0=13→w3,c1 ; sum=1333
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,3) ; G=(4,4)
R:(2,4) ; D:(3,4) ; D:(4,4)
base_conversion
base_conversion:repeated-division
n=84,base=2
DIV:84/2=42,r:0 ; DIV:42/2=21,r:0 ; DIV:21/2=10,r:1 ; DIV:10/2=5,r:0 ; DIV:5/2=2,r:1 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:1010100
base_conversion
base_conversion:decomposition
n=75,base=16
TERM:4*16^1=64 ; TERM:11*16^0=11 ; OUT:4B
multidigit_addition
multidigit_addition:right-to-left-carry
131+474
d2:1+4+0=5→w5,c0 ; d1:3+7+0=10→w0,c1 ; d0:1+4+1=6→w6,c0 ; sum=605
base_conversion
base_conversion:decomposition
n=77,base=8
TERM:1*8^2=64 ; TERM:1*8^1=8 ; TERM:5*8^0=5 ; OUT:115
list_summation
list_summation:left-to-right
3, 4, 1, 7
3+4=7 ; 7+1=8 ; 8+7=15
list_summation
list_summation:right-to-left
8, 4, 8, 5
8+5=13 ; 4+13=17 ; 8+17=25
list_summation
list_summation:right-to-left
3, 2, 0, 4
0+4=4 ; 2+4=6 ; 3+6=9
base_conversion
base_conversion:via-binary
n=88,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:3 ; CHUNK:2:0 ; OUT:130
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,2) ; G=(5,4)
R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,1) ; G=(4,4)
R:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(5,4)
D:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4)
list_summation
list_summation:right-to-left
9, 2, 9, 0
9+0=9 ; 2+9=11 ; 9+11=20
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,0) ; G=(2,2)
D:(1,0) ; D:(2,0) ; R:(2,1) ; R:(2,2)
linear_equation_solving
linear_equation_solving:inverse-ops
5x+10=10
5x+10=10 ; x=(10-10)/5 ; x=0/5 ; x=0
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)
linear_equation_solving
linear_equation_solving:inverse-ops
5x+0=35
5x+0=35 ; x=(35-0)/5 ; x=35/5 ; x=7
list_summation
list_summation:left-to-right
7, 5, 0, 1
7+5=12 ; 12+0=12 ; 12+1=13
sorting_algorithms
sorting_algorithms:heap-sort
2, 7, 1, 0, 5
[7,2,1,0,5] ; [7,5,1,0,2] ; [2,5,1,0,7] ; [5,2,1,0,7] ; [0,2,1,5,7] ; [2,0,1,5,7] ; [1,0,2,5,7] ; [0,1,2,5,7]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,2) ; G=(5,4)
D:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4)
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+81=0
9x+81=0 ; x+9=0 ; x=0-9 ; x=-9
base_conversion
base_conversion:repeated-division
n=23,base=8
DIV:23/8=2,r:7 ; DIV:2/8=0,r:2 ; OUT:27
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,0) ; G=(2,3)
R:(1,1) ; R:(1,2) ; R:(1,3) ; D:(2,3)
multidigit_addition
multidigit_addition:left-to-right-partials
259+430
p100:200+400=600 ; p10:50+30=80 ; p1:9+0=9 ; sum=600+80+9=689
multidigit_addition
multidigit_addition:left-to-right-partials
889+351
p100:800+300=1100 ; p10:80+50=130 ; p1:9+1=10 ; sum=1100+130+10=1240
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,0) ; G=(2,2)
R:(0,1) ; D:(1,1) ; R:(1,2) ; D:(2,2)
base_conversion
base_conversion:via-binary
n=197,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:1 ; CHUNK:6:0 ; CHUNK:7:1 ; OUT:11000101
list_summation
list_summation:pairwise
2, 3, 7, 6
2+3=5 ; 7+6=13 ; 5+13=18
multidigit_addition
multidigit_addition:left-to-right-partials
787+724
p100:700+700=1400 ; p10:80+20=100 ; p1:7+4=11 ; sum=1400+100+11=1511
sorting_algorithms
sorting_algorithms:heap-sort
3, 9, 7, 4, 0
[9,3,7,4,0] ; [9,4,7,3,0] ; [0,4,7,3,9] ; [7,4,0,3,9] ; [3,4,0,7,9] ; [4,3,0,7,9] ; [0,3,4,7,9] ; [3,0,4,7,9] ; [0,3,4,7,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,4) ; G=(2,5)
R:(0,5) ; D:(1,5) ; D:(2,5)
list_summation
list_summation:right-to-left
3, 3, 8, 8
8+8=16 ; 3+16=19 ; 3+19=22
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+12=12
4x+12=12 ; 4x=0 ; x=0
sorting_algorithms
sorting_algorithms:bubble-sort
5, 8, 0, 9, 4
[5,0,8,9,4] ; [5,0,8,4,9] ; [0,5,8,4,9] ; [0,5,4,8,9] ; [0,4,5,8,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,1) ; G=(5,2)
R:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,3) ; G=(5,5)
D:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3) ; R:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,0) ; G=(4,4)
R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4)
multidigit_addition
multidigit_addition:left-to-right-partials
723+849
p100:700+800=1500 ; p10:20+40=60 ; p1:3+9=12 ; sum=1500+60+12=1572
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,0) ; G=(5,4)
R:(0,1) ; D:(1,1) ; R:(1,2) ; D:(2,2) ; R:(2,3) ; D:(3,3) ; R:(3,4) ; D:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(5,2)
R:(2,1) ; D:(3,1) ; R:(3,2) ; D:(4,2) ; D:(5,2)
sorting_algorithms
sorting_algorithms:merge-sort
5, 3, 8, 1, 4
[3,5,8,1,4] ; [3,5,1,8,4] ; [1,3,5,8,4] ; [1,3,4,5,8]
linear_equation_solving
linear_equation_solving:inverse-ops
3x+15=6
3x+15=6 ; x=(6-15)/3 ; x=-9/3 ; x=-3
list_summation
list_summation:pairwise
3, 1, 7, 1
3+1=4 ; 7+1=8 ; 4+8=12
sorting_algorithms
sorting_algorithms:insertion-sort
3, 9, 5, 7, 1
[3,9,5,7,1] ; [3,5,9,7,1] ; [3,5,7,9,1] ; [1,3,5,7,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+18=22
2x+18=22 ; x+9=11 ; x=11-9 ; x=2
base_conversion
base_conversion:decomposition
n=122,base=16
TERM:7*16^1=112 ; TERM:10*16^0=10 ; OUT:7A
base_conversion
base_conversion:repeated-division
n=252,base=8
DIV:252/8=31,r:4 ; DIV:31/8=3,r:7 ; DIV:3/8=0,r:3 ; OUT:374
list_summation
list_summation:right-to-left
9, 8, 1, 1
1+1=2 ; 8+2=10 ; 9+10=19
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,2) ; G=(5,4)
R:(3,3) ; R:(3,4) ; D:(4,4) ; D:(5,4)
base_conversion
base_conversion:repeated-division
n=132,base=4
DIV:132/4=33,r:0 ; DIV:33/4=8,r:1 ; DIV:8/4=2,r:0 ; DIV:2/4=0,r:2 ; OUT:2010
sorting_algorithms
sorting_algorithms:insertion-sort
2, 9, 6, 1, 7
[2,9,6,1,7] ; [2,6,9,1,7] ; [1,2,6,9,7] ; [1,2,6,7,9]
sorting_algorithms
sorting_algorithms:merge-sort
0, 5, 3, 4, 7
[0,3,4,5,7]
sorting_algorithms
sorting_algorithms:selection-sort
3, 6, 9, 1, 5
[1,6,9,3,5] ; [1,3,9,6,5] ; [1,3,5,6,9] ; [1,3,5,6,9]
list_summation
list_summation:pairwise
5, 2, 7, 0
5+2=7 ; 7+0=7 ; 7+7=14
list_summation
list_summation:pairwise
2, 3, 7, 9
2+3=5 ; 7+9=16 ; 5+16=21
sorting_algorithms
sorting_algorithms:bubble-sort
7, 0, 3, 1, 9
[0,7,3,1,9] ; [0,3,7,1,9] ; [0,3,1,7,9] ; [0,1,3,7,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+9=-45
9x+9=-45 ; 9x=-54 ; x=-6
list_summation
list_summation:left-to-right
9, 7, 9, 2
9+7=16 ; 16+9=25 ; 25+2=27
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+18=36
2x+18=36 ; x+9=18 ; x=18-9 ; x=9
sorting_algorithms
sorting_algorithms:selection-sort
1, 4, 0, 3, 7
[0,4,1,3,7] ; [0,1,4,3,7] ; [0,1,3,4,7] ; [0,1,3,4,7]
linear_equation_solving
linear_equation_solving:inverse-ops
3x+9=24
3x+9=24 ; x=(24-9)/3 ; x=15/3 ; x=5
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
2, 2, 5, 4
2+2=4 ; 5+4=9 ; 4+9=13
linear_equation_solving
linear_equation_solving:inverse-ops
7x-42=0
7x-42=0 ; x=(0--42)/7 ; x=42/7 ; x=6
sorting_algorithms
sorting_algorithms:selection-sort
0, 2, 5, 3, 8
[0,2,5,3,8] ; [0,2,5,3,8] ; [0,2,3,5,8] ; [0,2,3,5,8]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(4,4)
D:(2,2) ; D:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4)
sorting_algorithms
sorting_algorithms:merge-sort
2, 8, 4, 3, 5
[2,8,3,4,5] ; [2,3,4,8,5] ; [2,3,4,5,8]