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
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-5=-25
5x-5=-25 ; 5x=-20 ; x=-4
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,2) ; G=(4,3)
D:(4,2) ; R:(4,3)
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:inverse-ops
4x-8=24
4x-8=24 ; x=(24--8)/4 ; x=32/4 ; x=8
sorting_algorithms
sorting_algorithms:selection-sort
2, 8, 9, 3, 1
[1,8,9,3,2] ; [1,2,9,3,8] ; [1,2,3,9,8] ; [1,2,3,8,9]
base_conversion
base_conversion:decomposition
n=154,base=16
TERM:9*16^1=144 ; TERM:10*16^0=10 ; OUT:9A
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,1) ; G=(2,2)
D:(2,1) ; R:(2,2)
multidigit_addition
multidigit_addition:left-to-right-partials
180+721
p100:100+700=800 ; p10:80+20=100 ; p1:0+1=1 ; sum=800+100+1=901
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,1) ; G=(1,5)
D:(1,1) ; R:(1,2) ; R:(1,3) ; R:(1,4) ; R:(1,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,0) ; G=(5,1)
R:(1,1) ; D:(2,1) ; D:(3,1) ; D:(4,1) ; D:(5,1)
list_summation
list_summation:right-to-left
1, 1, 6, 1
6+1=7 ; 1+7=8 ; 1+8=9
base_conversion
base_conversion:repeated-division
n=17,base=16
DIV:17/16=1,r:1 ; DIV:1/16=0,r:1 ; OUT:11
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,2) ; G=(4,4)
D:(4,2) ; R:(4,3) ; R:(4,4)
sorting_algorithms
sorting_algorithms:bubble-sort
5, 3, 7, 1, 6
[3,5,7,1,6] ; [3,5,1,7,6] ; [3,5,1,6,7] ; [3,1,5,6,7] ; [1,3,5,6,7]
multidigit_addition
multidigit_addition:rounding-decomposition
635+240
round:640+240=880 ; adjust:880-5=875 ; sum=875
linear_equation_solving
linear_equation_solving:inverse-ops
8x+40=56
8x+40=56 ; x=(56-40)/8 ; x=16/8 ; x=2
list_summation
list_summation:pairwise
4, 6, 3, 0
4+6=10 ; 3+0=3 ; 10+3=13
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,0) ; G=(5,1)
D:(4,0) ; D:(5,0) ; R:(5,1)
base_conversion
base_conversion:repeated-division
n=110,base=4
DIV:110/4=27,r:2 ; DIV:27/4=6,r:3 ; DIV:6/4=1,r:2 ; DIV:1/4=0,r:1 ; OUT:1232
list_summation
list_summation:left-to-right
1, 1, 8, 7
1+1=2 ; 2+8=10 ; 10+7=17
list_summation
list_summation:right-to-left
1, 9, 6, 8
6+8=14 ; 9+14=23 ; 1+23=24
base_conversion
base_conversion:via-binary
n=68,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:0 ; OUT:1010
multidigit_addition
multidigit_addition:rounding-decomposition
826+373
round:830+373=1203 ; adjust:1203-4=1199 ; sum=1199
list_summation
list_summation:pairwise
1, 8, 0, 7
1+8=9 ; 0+7=7 ; 9+7=16
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; R:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+9=-9
9x+9=-9 ; x+1=-1 ; x=-1-1 ; x=-2
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(5,4)
R:(1,2) ; D:(2,2) ; R:(2,3) ; D:(3,3) ; R:(3,4) ; D:(4,4) ; D:(5,4)
base_conversion
base_conversion:via-binary
n=250,base=16
BINLEN:8 ; CHUNK:0:15 ; CHUNK:1:10 ; OUT:FA
linear_equation_solving
linear_equation_solving:inverse-ops
6x+36=78
6x+36=78 ; x=(78-36)/6 ; x=42/6 ; x=7
linear_equation_solving
linear_equation_solving:inverse-ops
6x+24=0
6x+24=0 ; x=(0-24)/6 ; x=-24/6 ; x=-4
multidigit_addition
multidigit_addition:right-to-left-carry
657+511
d2:7+1+0=8→w8,c0 ; d1:5+1+0=6→w6,c0 ; d0:6+5+0=11→w1,c1 ; sum=1168
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+4=-12
4x+4=-12 ; 4x=-16 ; x=-4
linear_equation_solving
linear_equation_solving:inverse-ops
3x-15=-21
3x-15=-21 ; x=(-21--15)/3 ; x=-6/3 ; x=-2
list_summation
list_summation:left-to-right
3, 9, 5, 1
3+9=12 ; 12+5=17 ; 17+1=18
list_summation
list_summation:pairwise
2, 8, 8, 3
2+8=10 ; 8+3=11 ; 10+11=21
base_conversion
base_conversion:repeated-division
n=223,base=4
DIV:223/4=55,r:3 ; DIV:55/4=13,r:3 ; DIV:13/4=3,r:1 ; DIV:3/4=0,r:3 ; OUT:3133
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,4) ; G=(5,5)
R:(3,5) ; D:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,3) ; G=(3,4)
D:(2,3) ; D:(3,3) ; R:(3,4)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,0) ; G=(4,3)
D:(1,0) ; D:(2,0) ; D:(3,0) ; D:(4,0) ; R:(4,1) ; R:(4,2) ; R:(4,3)
sorting_algorithms
sorting_algorithms:heap-sort
1, 8, 9, 6, 7
[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]
base_conversion
base_conversion:repeated-division
n=190,base=4
DIV:190/4=47,r:2 ; DIV:47/4=11,r:3 ; DIV:11/4=2,r:3 ; DIV:2/4=0,r:2 ; OUT:2332
multidigit_addition
multidigit_addition:left-to-right-partials
876+118
p100:800+100=900 ; p10:70+10=80 ; p1:6+8=14 ; sum=900+80+14=994
multidigit_addition
multidigit_addition:left-to-right-partials
198+910
p100:100+900=1000 ; p10:90+10=100 ; p1:8+0=8 ; sum=1000+100+8=1108
base_conversion
base_conversion:decomposition
n=66,base=4
TERM:1*4^3=64 ; TERM:0*4^2=0 ; TERM:0*4^1=0 ; TERM:2*4^0=2 ; OUT:1002
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-63=-77
7x-63=-77 ; 7x=-14 ; x=-2
list_summation
list_summation:left-to-right
9, 3, 5, 5
9+3=12 ; 12+5=17 ; 17+5=22
list_summation
list_summation:right-to-left
6, 6, 3, 5
3+5=8 ; 6+8=14 ; 6+14=20
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
sorting_algorithms
sorting_algorithms:selection-sort
6, 2, 8, 5, 9
[2,6,8,5,9] ; [2,5,8,6,9] ; [2,5,6,8,9] ; [2,5,6,8,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; R:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(4,4)
D:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4)
multidigit_addition
multidigit_addition:left-to-right-partials
356+102
p100:300+100=400 ; p10:50+0=50 ; p1:6+2=8 ; sum=400+50+8=458
linear_equation_solving
linear_equation_solving:inverse-ops
7x-56=-70
7x-56=-70 ; x=(-70--56)/7 ; x=-14/7 ; x=-2
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,3) ; G=(4,4)
D:(4,3) ; R:(4,4)
list_summation
list_summation:left-to-right
4, 3, 4, 4
4+3=7 ; 7+4=11 ; 11+4=15
sorting_algorithms
sorting_algorithms:insertion-sort
4, 0, 2, 7, 8
[0,4,2,7,8] ; [0,2,4,7,8] ; [0,2,4,7,8] ; [0,2,4,7,8]
list_summation
list_summation:right-to-left
5, 5, 9, 1
9+1=10 ; 5+10=15 ; 5+15=20
multidigit_addition
multidigit_addition:rounding-decomposition
613+285
round:620+285=905 ; adjust:905-7=898 ; sum=898
sorting_algorithms
sorting_algorithms:merge-sort
2, 3, 6, 4, 1
[2,3,4,6,1] ; [1,2,3,4,6]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,3) ; G=(3,5)
D:(2,3) ; D:(3,3) ; R:(3,4) ; R:(3,5)
list_summation
list_summation:right-to-left
6, 8, 5, 5
5+5=10 ; 8+10=18 ; 6+18=24
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)
base_conversion
base_conversion:repeated-division
n=57,base=4
DIV:57/4=14,r:1 ; DIV:14/4=3,r:2 ; DIV:3/4=0,r:3 ; OUT:321
base_conversion
base_conversion:decomposition
n=144,base=8
TERM:2*8^2=128 ; TERM:2*8^1=16 ; TERM:0*8^0=0 ; OUT:220
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(2,4)
R:(1,4) ; D:(2,4)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,4) ; G=(5,5)
D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:insertion-sort
2, 6, 0, 5, 7
[2,6,0,5,7] ; [0,2,6,5,7] ; [0,2,5,6,7] ; [0,2,5,6,7]
base_conversion
base_conversion:decomposition
n=127,base=2
TERM:1*2^6=64 ; 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:1111111
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(2,4)
R:(1,4) ; D:(2,4)
list_summation
list_summation:pairwise
6, 3, 4, 9
6+3=9 ; 4+9=13 ; 9+13=22
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-18=-33
3x-18=-33 ; x+-6=-11 ; x=-11--6 ; x=-5
multidigit_addition
multidigit_addition:left-to-right-partials
139+892
p100:100+800=900 ; p10:30+90=120 ; p1:9+2=11 ; sum=900+120+11=1031
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+40=0
8x+40=0 ; 8x=-40 ; x=-5
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+32=0
8x+32=0 ; x+4=0 ; x=0-4 ; x=-4
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(2,5)
R:(1,5) ; D:(2,5)
multidigit_addition
multidigit_addition:rounding-decomposition
851+823
round:860+823=1683 ; adjust:1683-9=1674 ; sum=1674
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)
linear_equation_solving
linear_equation_solving:inverse-ops
8x+64=112
8x+64=112 ; x=(112-64)/8 ; x=48/8 ; x=6
sorting_algorithms
sorting_algorithms:heap-sort
6, 8, 5, 9, 4
[6,9,5,8,4] ; [9,6,5,8,4] ; [9,8,5,6,4] ; [4,8,5,6,9] ; [8,4,5,6,9] ; [8,6,5,4,9] ; [4,6,5,8,9] ; [6,4,5,8,9] ; [5,4,6,8,9] ; [4,5,6,8,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x-48=-48
8x-48=-48 ; x+-6=-6 ; x=-6--6 ; x=0
base_conversion
base_conversion:via-binary
n=219,base=8
BINLEN:8 ; CHUNK:0:3 ; CHUNK:1:3 ; CHUNK:2:3 ; OUT:333
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,0) ; G=(3,1)
D:(1,0) ; D:(2,0) ; D:(3,0) ; R:(3,1)
base_conversion
base_conversion:decomposition
n=151,base=8
TERM:2*8^2=128 ; TERM:2*8^1=16 ; TERM:7*8^0=7 ; OUT:227
sorting_algorithms
sorting_algorithms:selection-sort
9, 5, 4, 8, 6
[4,5,9,8,6] ; [4,5,9,8,6] ; [4,5,6,8,9] ; [4,5,6,8,9]
sorting_algorithms
sorting_algorithms:merge-sort
8, 0, 1, 5, 9
[0,8,1,5,9] ; [0,1,5,8,9]
sorting_algorithms
sorting_algorithms:merge-sort
4, 6, 9, 7, 8
[4,6,7,9,8] ; [4,6,7,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
832+123
d2:2+3+0=5→w5,c0 ; d1:3+2+0=5→w5,c0 ; d0:8+1+0=9→w9,c0 ; sum=955
multidigit_addition
multidigit_addition:right-to-left-carry
359+598
d2:9+8+0=17→w7,c1 ; d1:5+9+1=15→w5,c1 ; d0:3+5+1=9→w9,c0 ; sum=957
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,2)
D:(5,1) ; R:(5,2)
base_conversion
base_conversion:via-binary
n=169,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:0 ; CHUNK:7:1 ; OUT:10101001
list_summation
list_summation:left-to-right
6, 6, 1, 8
6+6=12 ; 12+1=13 ; 13+8=21
sorting_algorithms
sorting_algorithms:heap-sort
8, 7, 6, 1, 3
[3,7,6,1,8] ; [7,3,6,1,8] ; [1,3,6,7,8] ; [6,3,1,7,8] ; [1,3,6,7,8] ; [3,1,6,7,8] ; [1,3,6,7,8]
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+14=16
2x+14=16 ; 2x=2 ; x=1
sorting_algorithms
sorting_algorithms:merge-sort
9, 6, 3, 5, 7
[6,9,3,5,7] ; [3,5,6,9,7] ; [3,5,6,7,9]
list_summation
list_summation:left-to-right
7, 6, 5, 7
7+6=13 ; 13+5=18 ; 18+7=25
multidigit_addition
multidigit_addition:left-to-right-partials
670+400
p100:600+400=1000 ; p10:70+0=70 ; p1:0+0=0 ; sum=1000+70+0=1070
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(4,5)
D:(2,2) ; D:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
base_conversion
base_conversion:repeated-division
n=99,base=16
DIV:99/16=6,r:3 ; DIV:6/16=0,r:6 ; OUT:63
list_summation
list_summation:right-to-left
1, 5, 3, 6
3+6=9 ; 5+9=14 ; 1+14=15
linear_equation_solving
linear_equation_solving:inverse-ops
8x+48=32
8x+48=32 ; x=(32-48)/8 ; x=-16/8 ; x=-2