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:left-to-right
8, 0, 5, 4
8+0=8 ; 8+5=13 ; 13+4=17
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,4) ; G=(3,5)
R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5)
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)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,2) ; G=(4,4)
D:(4,2) ; R:(4,3) ; R:(4,4)
list_summation
list_summation:left-to-right
7, 8, 7, 7
7+8=15 ; 15+7=22 ; 22+7=29
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+32=36
4x+32=36 ; 4x=4 ; x=1
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,0) ; G=(3,1)
R:(0,1) ; D:(1,1) ; D:(2,1) ; D:(3,1)
list_summation
list_summation:left-to-right
8, 3, 7, 3
8+3=11 ; 11+7=18 ; 18+3=21
list_summation
list_summation:pairwise
2, 4, 7, 5
2+4=6 ; 7+5=12 ; 6+12=18
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x-20=-65
5x-20=-65 ; x+-4=-13 ; x=-13--4 ; x=-9
sorting_algorithms
sorting_algorithms:bubble-sort
1, 8, 4, 5, 7
[1,4,8,5,7] ; [1,4,5,8,7] ; [1,4,5,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
6x-24=-6
6x-24=-6 ; x=(-6--24)/6 ; x=18/6 ; x=3
sorting_algorithms
sorting_algorithms:bubble-sort
0, 2, 9, 5, 8
[0,2,5,9,8] ; [0,2,5,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
755+202
d2:5+2+0=7→w7,c0 ; d1:5+0+0=5→w5,c0 ; d0:7+2+0=9→w9,c0 ; sum=957
sorting_algorithms
sorting_algorithms:heap-sort
0, 9, 8, 4, 2
[9,0,8,4,2] ; [9,4,8,0,2] ; [2,4,8,0,9] ; [8,4,2,0,9] ; [0,4,2,8,9] ; [4,0,2,8,9] ; [2,0,4,8,9] ; [0,2,4,8,9]
sorting_algorithms
sorting_algorithms:bubble-sort
1, 3, 4, 2, 6
[1,3,2,4,6] ; [1,2,3,4,6]
list_summation
list_summation:pairwise
3, 5, 9, 9
3+5=8 ; 9+9=18 ; 8+18=26
list_summation
list_summation:right-to-left
5, 6, 3, 4
3+4=7 ; 6+7=13 ; 5+13=18
sorting_algorithms
sorting_algorithms:heap-sort
6, 5, 1, 2, 9
[6,9,1,2,5] ; [9,6,1,2,5] ; [5,6,1,2,9] ; [6,5,1,2,9] ; [2,5,1,6,9] ; [5,2,1,6,9] ; [1,2,5,6,9] ; [2,1,5,6,9] ; [1,2,5,6,9]
base_conversion
base_conversion:decomposition
n=97,base=2
TERM:1*2^6=64 ; TERM:1*2^5=32 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:0*2^1=0 ; TERM:1*2^0=1 ; OUT:1100001
linear_equation_solving
linear_equation_solving:inverse-ops
5x+30=75
5x+30=75 ; x=(75-30)/5 ; x=45/5 ; x=9
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-30=18
6x-30=18 ; x+-5=3 ; x=3--5 ; x=8
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,4) ; G=(3,5)
R:(2,5) ; D:(3,5)
list_summation
list_summation:right-to-left
8, 9, 5, 0
5+0=5 ; 9+5=14 ; 8+14=22
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,1) ; G=(2,5)
D:(1,1) ; D:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5)
list_summation
list_summation:right-to-left
6, 1, 7, 9
7+9=16 ; 1+16=17 ; 6+17=23
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,3) ; G=(3,4)
R:(2,4) ; D:(3,4)
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
linear_equation_solving
linear_equation_solving:inverse-ops
3x+21=12
3x+21=12 ; x=(12-21)/3 ; x=-9/3 ; x=-3
sorting_algorithms
sorting_algorithms:heap-sort
2, 4, 0, 3, 7
[2,7,0,3,4] ; [7,2,0,3,4] ; [7,4,0,3,2] ; [2,4,0,3,7] ; [4,2,0,3,7] ; [4,3,0,2,7] ; [2,3,0,4,7] ; [3,2,0,4,7] ; [0,2,3,4,7] ; [2,0,3,4,7] ; [0,2,3,4,7]
multidigit_addition
multidigit_addition:rounding-decomposition
500+540
round:500+540=1040 ; adjust:1040-0=1040 ; sum=1040
linear_equation_solving
linear_equation_solving:inverse-ops
6x-6=6
6x-6=6 ; x=(6--6)/6 ; x=12/6 ; x=2
sorting_algorithms
sorting_algorithms:selection-sort
2, 4, 3, 0, 7
[0,4,3,2,7] ; [0,2,3,4,7] ; [0,2,3,4,7] ; [0,2,3,4,7]
base_conversion
base_conversion:via-binary
n=114,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:3 ; CHUNK:2:0 ; CHUNK:3:2 ; OUT:1302
sorting_algorithms
sorting_algorithms:heap-sort
8, 0, 7, 9, 2
[8,9,7,0,2] ; [9,8,7,0,2] ; [2,8,7,0,9] ; [8,2,7,0,9] ; [0,2,7,8,9] ; [7,2,0,8,9] ; [0,2,7,8,9] ; [2,0,7,8,9] ; [0,2,7,8,9]
sorting_algorithms
sorting_algorithms:heap-sort
3, 1, 5, 8, 7
[3,8,5,1,7] ; [8,3,5,1,7] ; [8,7,5,1,3] ; [3,7,5,1,8] ; [7,3,5,1,8] ; [1,3,5,7,8] ; [5,3,1,7,8] ; [1,3,5,7,8] ; [3,1,5,7,8] ; [1,3,5,7,8]
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x-35=-42
7x-35=-42 ; x+-5=-6 ; x=-6--5 ; x=-1
linear_equation_solving
linear_equation_solving:inverse-ops
9x-18=45
9x-18=45 ; x=(45--18)/9 ; x=63/9 ; x=7
multidigit_addition
multidigit_addition:left-to-right-partials
426+520
p100:400+500=900 ; p10:20+20=40 ; p1:6+0=6 ; sum=900+40+6=946
list_summation
list_summation:right-to-left
2, 7, 2, 1
2+1=3 ; 7+3=10 ; 2+10=12
list_summation
list_summation:right-to-left
3, 4, 5, 6
5+6=11 ; 4+11=15 ; 3+15=18
sorting_algorithms
sorting_algorithms:bubble-sort
2, 7, 6, 4, 0
[2,6,7,4,0] ; [2,6,4,7,0] ; [2,6,4,0,7] ; [2,4,6,0,7] ; [2,4,0,6,7] ; [2,0,4,6,7] ; [0,2,4,6,7]
sorting_algorithms
sorting_algorithms:merge-sort
7, 1, 9, 0, 6
[1,7,9,0,6] ; [1,7,0,9,6] ; [0,1,7,9,6] ; [0,1,6,7,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x-16=-34
2x-16=-34 ; x+-8=-17 ; x=-17--8 ; x=-9
base_conversion
base_conversion:via-binary
n=106,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:0 ; CHUNK:5:1 ; CHUNK:6:0 ; OUT:1101010
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(5,5)
R:(3,4) ; R:(3,5) ; D:(4,5) ; D:(5,5)
list_summation
list_summation:left-to-right
2, 0, 3, 8
2+0=2 ; 2+3=5 ; 5+8=13
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:pairwise
9, 5, 7, 6
9+5=14 ; 7+6=13 ; 14+13=27
base_conversion
base_conversion:decomposition
n=66,base=2
TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:1000010
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(3,2)
D:(2,0) ; D:(3,0) ; R:(3,1) ; R:(3,2)
base_conversion
base_conversion:decomposition
n=189,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:0*2^1=0 ; TERM:1*2^0=1 ; OUT:10111101
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=(2,2) ; G=(3,3)
R:(2,3) ; D:(3,3)
base_conversion
base_conversion:repeated-division
n=236,base=2
DIV:236/2=118,r:0 ; DIV:118/2=59,r:0 ; DIV:59/2=29,r:1 ; DIV:29/2=14,r:1 ; 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:11101100
sorting_algorithms
sorting_algorithms:insertion-sort
9, 1, 2, 6, 0
[1,9,2,6,0] ; [1,2,9,6,0] ; [1,2,6,9,0] ; [0,1,2,6,9]
list_summation
list_summation:left-to-right
6, 0, 6, 8
6+0=6 ; 6+6=12 ; 12+8=20
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+8=24
8x+8=24 ; 8x=16 ; x=2
sorting_algorithms
sorting_algorithms:merge-sort
3, 6, 4, 9, 1
[3,4,6,9,1] ; [1,3,4,6,9]
base_conversion
base_conversion:repeated-division
n=58,base=16
DIV:58/16=3,r:10 ; DIV:3/16=0,r:3 ; OUT:3A
list_summation
list_summation:pairwise
9, 4, 5, 4
9+4=13 ; 5+4=9 ; 13+9=22
base_conversion
base_conversion:decomposition
n=11,base=16
TERM:11*16^0=11 ; OUT:B
sorting_algorithms
sorting_algorithms:selection-sort
7, 0, 4, 9, 8
[0,7,4,9,8] ; [0,4,7,9,8] ; [0,4,7,9,8] ; [0,4,7,8,9]
base_conversion
base_conversion:decomposition
n=83,base=16
TERM:5*16^1=80 ; TERM:3*16^0=3 ; OUT:53
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(3,4)
D:(2,0) ; D:(3,0) ; R:(3,1) ; R:(3,2) ; R:(3,3) ; R:(3,4)
base_conversion
base_conversion:repeated-division
n=145,base=4
DIV:145/4=36,r:1 ; DIV:36/4=9,r:0 ; DIV:9/4=2,r:1 ; DIV:2/4=0,r:2 ; OUT:2101
base_conversion
base_conversion:repeated-division
n=164,base=4
DIV:164/4=41,r:0 ; DIV:41/4=10,r:1 ; DIV:10/4=2,r:2 ; DIV:2/4=0,r:2 ; OUT:2210
linear_equation_solving
linear_equation_solving:inverse-ops
2x+12=24
2x+12=24 ; x=(24-12)/2 ; x=12/2 ; x=6
list_summation
list_summation:right-to-left
9, 8, 6, 3
6+3=9 ; 8+9=17 ; 9+17=26
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,2) ; G=(4,5)
R:(3,3) ; D:(4,3) ; R:(4,4) ; R:(4,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(3,5)
R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5)
multidigit_addition
multidigit_addition:right-to-left-carry
597+311
d2:7+1+0=8→w8,c0 ; d1:9+1+0=10→w0,c1 ; d0:5+3+1=9→w9,c0 ; sum=908
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,1) ; G=(5,3)
D:(3,1) ; D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,1) ; G=(5,2)
R:(0,2) ; D:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-54=-54
6x-54=-54 ; 6x=0 ; x=0
sorting_algorithms
sorting_algorithms:insertion-sort
0, 3, 9, 1, 7
[0,3,9,1,7] ; [0,3,9,1,7] ; [0,1,3,9,7] ; [0,1,3,7,9]
multidigit_addition
multidigit_addition:right-to-left-carry
416+317
d2:6+7+0=13→w3,c1 ; d1:1+1+1=3→w3,c0 ; d0:4+3+0=7→w7,c0 ; sum=733
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:via-binary
n=133,base=16
BINLEN:8 ; CHUNK:0:8 ; CHUNK:1:5 ; OUT:85
list_summation
list_summation:right-to-left
7, 7, 2, 9
2+9=11 ; 7+11=18 ; 7+18=25
multidigit_addition
multidigit_addition:right-to-left-carry
841+265
d2:1+5+0=6→w6,c0 ; d1:4+6+0=10→w0,c1 ; d0:8+2+1=11→w1,c1 ; sum=1106
sorting_algorithms
sorting_algorithms:merge-sort
3, 8, 2, 5, 9
[2,3,5,8,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+14=-7
7x+14=-7 ; 7x=-21 ; x=-3
linear_equation_solving
linear_equation_solving:inverse-ops
6x-30=12
6x-30=12 ; x=(12--30)/6 ; x=42/6 ; x=7
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+18=-18
9x+18=-18 ; x+2=-2 ; x=-2-2 ; x=-4
list_summation
list_summation:pairwise
1, 2, 8, 4
1+2=3 ; 8+4=12 ; 3+12=15
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(4,3)
R:(2,2) ; R:(2,3) ; D:(3,3) ; D:(4,3)
list_summation
list_summation:pairwise
3, 5, 2, 4
3+5=8 ; 2+4=6 ; 8+6=14
list_summation
list_summation:left-to-right
6, 3, 0, 5
6+3=9 ; 9+0=9 ; 9+5=14
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,0) ; G=(5,5)
R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,2) ; G=(4,4)
R:(3,3) ; R:(3,4) ; D:(4,4)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:selection-sort
2, 5, 0, 9, 7
[0,5,2,9,7] ; [0,2,5,9,7] ; [0,2,5,9,7] ; [0,2,5,7,9]
base_conversion
base_conversion:repeated-division
n=80,base=2
DIV:80/2=40,r:0 ; DIV:40/2=20,r:0 ; DIV:20/2=10,r:0 ; 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:1010000
multidigit_addition
multidigit_addition:rounding-decomposition
615+870
round:620+870=1490 ; adjust:1490-5=1485 ; sum=1485
base_conversion
base_conversion:decomposition
n=59,base=4
TERM:3*4^2=48 ; TERM:2*4^1=8 ; TERM:3*4^0=3 ; OUT:323
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,0) ; G=(5,3)
R:(0,1) ; R:(0,2) ; R:(0,3) ; D:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3)
sorting_algorithms
sorting_algorithms:insertion-sort
4, 3, 5, 1, 2
[3,4,5,1,2] ; [3,4,5,1,2] ; [1,3,4,5,2] ; [1,2,3,4,5]
linear_equation_solving
linear_equation_solving:inverse-ops
7x+7=42
7x+7=42 ; x=(42-7)/7 ; x=35/7 ; x=5
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