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:inverse-ops
6x-48=-66
6x-48=-66 ; x=(-66--48)/6 ; x=-18/6 ; x=-3
sorting_algorithms
sorting_algorithms:insertion-sort
6, 7, 0, 5, 9
[6,7,0,5,9] ; [0,6,7,5,9] ; [0,5,6,7,9] ; [0,5,6,7,9]
linear_equation_solving
linear_equation_solving:inverse-ops
2x-10=-20
2x-10=-20 ; x=(-20--10)/2 ; x=-10/2 ; x=-5
base_conversion
base_conversion:via-binary
n=92,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:3 ; CHUNK:3:0 ; OUT:1130
list_summation
list_summation:pairwise
7, 3, 9, 7
7+3=10 ; 9+7=16 ; 10+16=26
list_summation
list_summation:left-to-right
8, 9, 5, 0
8+9=17 ; 17+5=22 ; 22+0=22
list_summation
list_summation:right-to-left
9, 9, 9, 7
9+7=16 ; 9+16=25 ; 9+25=34
linear_equation_solving
linear_equation_solving:inverse-ops
2x+10=2
2x+10=2 ; x=(2-10)/2 ; x=-8/2 ; x=-4
list_summation
list_summation:left-to-right
5, 8, 9, 5
5+8=13 ; 13+9=22 ; 22+5=27
list_summation
list_summation:left-to-right
4, 1, 8, 2
4+1=5 ; 5+8=13 ; 13+2=15
base_conversion
base_conversion:decomposition
n=158,base=4
TERM:2*4^3=128 ; TERM:1*4^2=16 ; TERM:3*4^1=12 ; TERM:2*4^0=2 ; OUT:2132
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-9=54
9x-9=54 ; x+-1=6 ; x=6--1 ; x=7
sorting_algorithms
sorting_algorithms:selection-sort
7, 1, 4, 9, 0
[0,1,4,9,7] ; [0,1,4,9,7] ; [0,1,4,9,7] ; [0,1,4,7,9]
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-30=6
6x-30=6 ; 6x=36 ; x=6
multidigit_addition
multidigit_addition:left-to-right-partials
193+344
p100:100+300=400 ; p10:90+40=130 ; p1:3+4=7 ; sum=400+130+7=537
sorting_algorithms
sorting_algorithms:bubble-sort
9, 8, 4, 7, 0
[8,9,4,7,0] ; [8,4,9,7,0] ; [8,4,7,9,0] ; [8,4,7,0,9] ; [4,8,7,0,9] ; [4,7,8,0,9] ; [4,7,0,8,9] ; [4,0,7,8,9] ; [0,4,7,8,9]
list_summation
list_summation:pairwise
6, 8, 9, 8
6+8=14 ; 9+8=17 ; 14+17=31
list_summation
list_summation:right-to-left
3, 0, 6, 0
6+0=6 ; 0+6=6 ; 3+6=9
list_summation
list_summation:pairwise
6, 1, 0, 3
6+1=7 ; 0+3=3 ; 7+3=10
sorting_algorithms
sorting_algorithms:insertion-sort
3, 7, 9, 2, 8
[3,7,9,2,8] ; [3,7,9,2,8] ; [2,3,7,9,8] ; [2,3,7,8,9]
base_conversion
base_conversion:repeated-division
n=47,base=4
DIV:47/4=11,r:3 ; DIV:11/4=2,r:3 ; DIV:2/4=0,r:2 ; OUT:233
sorting_algorithms
sorting_algorithms:bubble-sort
1, 5, 8, 4, 0
[1,5,4,8,0] ; [1,5,4,0,8] ; [1,4,5,0,8] ; [1,4,0,5,8] ; [1,0,4,5,8] ; [0,1,4,5,8]
sorting_algorithms
sorting_algorithms:selection-sort
5, 9, 2, 6, 7
[2,9,5,6,7] ; [2,5,9,6,7] ; [2,5,6,9,7] ; [2,5,6,7,9]
linear_equation_solving
linear_equation_solving:inverse-ops
9x+54=63
9x+54=63 ; x=(63-54)/9 ; x=9/9 ; x=1
base_conversion
base_conversion:repeated-division
n=166,base=8
DIV:166/8=20,r:6 ; DIV:20/8=2,r:4 ; DIV:2/8=0,r:2 ; OUT:246
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)
base_conversion
base_conversion:decomposition
n=76,base=2
TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:0*2^1=0 ; TERM:0*2^0=0 ; OUT:1001100
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(4,3)
R:(2,1) ; D:(3,1) ; R:(3,2) ; D:(4,2) ; R:(4,3)
base_conversion
base_conversion:decomposition
n=44,base=16
TERM:2*16^1=32 ; TERM:12*16^0=12 ; OUT:2C
sorting_algorithms
sorting_algorithms:heap-sort
6, 0, 8, 3, 1
[6,3,8,0,1] ; [8,3,6,0,1] ; [1,3,6,0,8] ; [6,3,1,0,8] ; [0,3,1,6,8] ; [3,0,1,6,8] ; [1,0,3,6,8] ; [0,1,3,6,8]
base_conversion
base_conversion:repeated-division
n=204,base=2
DIV:204/2=102,r:0 ; DIV:102/2=51,r:0 ; DIV:51/2=25,r:1 ; DIV:25/2=12,r:1 ; DIV:12/2=6,r:0 ; DIV:6/2=3,r:0 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11001100
multidigit_addition
multidigit_addition:right-to-left-carry
983+735
d2:3+5+0=8→w8,c0 ; d1:8+3+0=11→w1,c1 ; d0:9+7+1=17→w7,c1 ; sum=1718
base_conversion
base_conversion:repeated-division
n=60,base=4
DIV:60/4=15,r:0 ; DIV:15/4=3,r:3 ; DIV:3/4=0,r:3 ; OUT:330
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,4) ; G=(2,5)
R:(1,5) ; D:(2,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
base_conversion
base_conversion:repeated-division
n=38,base=2
DIV:38/2=19,r:0 ; DIV:19/2=9,r:1 ; DIV:9/2=4,r:1 ; DIV:4/2=2,r:0 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:100110
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)
list_summation
list_summation:left-to-right
7, 5, 8, 8
7+5=12 ; 12+8=20 ; 20+8=28
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,3) ; G=(4,4)
D:(4,3) ; R:(4,4)
sorting_algorithms
sorting_algorithms:merge-sort
6, 2, 5, 4, 9
[2,6,5,4,9] ; [2,6,4,5,9] ; [2,4,5,6,9]
list_summation
list_summation:right-to-left
9, 6, 5, 0
5+0=5 ; 6+5=11 ; 9+11=20
base_conversion
base_conversion:repeated-division
n=6,base=8
DIV:6/8=0,r:6 ; OUT:6
multidigit_addition
multidigit_addition:left-to-right-partials
287+919
p100:200+900=1100 ; p10:80+10=90 ; p1:7+9=16 ; sum=1100+90+16=1206
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+36=60
6x+36=60 ; x+6=10 ; x=10-6 ; x=4
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+27=-54
9x+27=-54 ; 9x=-81 ; x=-9
base_conversion
base_conversion:via-binary
n=243,base=16
BINLEN:8 ; CHUNK:0:15 ; CHUNK:1:3 ; OUT:F3
multidigit_addition
multidigit_addition:rounding-decomposition
305+504
round:310+504=814 ; adjust:814-5=809 ; sum=809
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,0) ; G=(5,5)
R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
list_summation
list_summation:pairwise
4, 4, 7, 8
4+4=8 ; 7+8=15 ; 8+15=23
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+30=50
5x+30=50 ; 5x=20 ; x=4
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(5,3)
R:(2,1) ; D:(3,1) ; R:(3,2) ; D:(4,2) ; R:(4,3) ; D:(5,3)
multidigit_addition
multidigit_addition:left-to-right-partials
594+772
p100:500+700=1200 ; p10:90+70=160 ; p1:4+2=6 ; sum=1200+160+6=1366
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,3) ; G=(4,5)
R:(3,4) ; D:(4,4) ; R:(4,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,1) ; G=(5,3)
R:(0,2) ; R:(0,3) ; D:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(5,5)
D:(4,4) ; D:(5,4) ; R:(5,5)
sorting_algorithms
sorting_algorithms:selection-sort
0, 4, 9, 5, 3
[0,4,9,5,3] ; [0,3,9,5,4] ; [0,3,4,5,9] ; [0,3,4,5,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(4,3)
R:(0,3) ; D:(1,3) ; D:(2,3) ; D:(3,3) ; D:(4,3)
base_conversion
base_conversion:via-binary
n=248,base=16
BINLEN:8 ; CHUNK:0:15 ; CHUNK:1:8 ; OUT:F8
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-8=-10
2x-8=-10 ; 2x=-2 ; x=-1
sorting_algorithms
sorting_algorithms:insertion-sort
2, 9, 3, 0, 4
[2,9,3,0,4] ; [2,3,9,0,4] ; [0,2,3,9,4] ; [0,2,3,4,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,3) ; G=(2,5)
R:(0,4) ; D:(1,4) ; R:(1,5) ; D:(2,5)
sorting_algorithms
sorting_algorithms:bubble-sort
4, 5, 9, 3, 1
[4,5,3,9,1] ; [4,5,3,1,9] ; [4,3,5,1,9] ; [4,3,1,5,9] ; [3,4,1,5,9] ; [3,1,4,5,9] ; [1,3,4,5,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,3) ; G=(4,4)
R:(2,4) ; D:(3,4) ; D:(4,4)
list_summation
list_summation:right-to-left
0, 3, 5, 6
5+6=11 ; 3+11=14 ; 0+14=14
sorting_algorithms
sorting_algorithms:insertion-sort
5, 6, 2, 3, 0
[5,6,2,3,0] ; [2,5,6,3,0] ; [2,3,5,6,0] ; [0,2,3,5,6]
multidigit_addition
multidigit_addition:left-to-right-partials
979+915
p100:900+900=1800 ; p10:70+10=80 ; p1:9+5=14 ; sum=1800+80+14=1894
base_conversion
base_conversion:decomposition
n=218,base=2
TERM:1*2^7=128 ; TERM:1*2^6=64 ; TERM:0*2^5=0 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:11011010
base_conversion
base_conversion:decomposition
n=219,base=16
TERM:13*16^1=208 ; TERM:11*16^0=11 ; OUT:DB
sorting_algorithms
sorting_algorithms:heap-sort
3, 6, 7, 4, 1
[7,6,3,4,1] ; [1,6,3,4,7] ; [6,1,3,4,7] ; [6,4,3,1,7] ; [1,4,3,6,7] ; [4,1,3,6,7] ; [3,1,4,6,7] ; [1,3,4,6,7]
base_conversion
base_conversion:repeated-division
n=172,base=2
DIV:172/2=86,r:0 ; DIV:86/2=43,r:0 ; DIV:43/2=21,r:1 ; 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:10101100
multidigit_addition
multidigit_addition:rounding-decomposition
385+701
round:390+701=1091 ; adjust:1091-5=1086 ; sum=1086
base_conversion
base_conversion:repeated-division
n=8,base=2
DIV:8/2=4,r:0 ; DIV:4/2=2,r:0 ; DIV:2/2=1,r:0 ; DIV:1/2=0,r:1 ; OUT:1000
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,1) ; G=(2,4)
D:(1,1) ; D:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4)
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-12=6
6x-12=6 ; x+-2=1 ; x=1--2 ; x=3
multidigit_addition
multidigit_addition:right-to-left-carry
386+653
d2:6+3+0=9→w9,c0 ; d1:8+5+0=13→w3,c1 ; d0:3+6+1=10→w0,c1 ; sum=1039
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,3) ; G=(5,5)
R:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:inverse-ops
6x-42=-72
6x-42=-72 ; x=(-72--42)/6 ; x=-30/6 ; x=-5
sorting_algorithms
sorting_algorithms:merge-sort
4, 0, 5, 3, 1
[0,4,5,3,1] ; [0,4,3,5,1] ; [0,3,4,5,1] ; [0,1,3,4,5]
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+12=-24
4x+12=-24 ; 4x=-36 ; x=-9
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,2) ; G=(5,4)
R:(0,3) ; R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
list_summation
list_summation:pairwise
7, 3, 2, 9
7+3=10 ; 2+9=11 ; 10+11=21
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,4) ; G=(3,5)
R:(2,5) ; D:(3,5)
sorting_algorithms
sorting_algorithms:heap-sort
1, 5, 0, 3, 6
[1,6,0,3,5] ; [6,1,0,3,5] ; [6,5,0,3,1] ; [1,5,0,3,6] ; [5,1,0,3,6] ; [5,3,0,1,6] ; [1,3,0,5,6] ; [3,1,0,5,6] ; [0,1,3,5,6] ; [1,0,3,5,6] ; [0,1,3,5,6]
linear_equation_solving
linear_equation_solving:inverse-ops
7x+63=28
7x+63=28 ; x=(28-63)/7 ; x=-35/7 ; x=-5
multidigit_addition
multidigit_addition:rounding-decomposition
970+992
round:970+992=1962 ; adjust:1962-0=1962 ; sum=1962
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)
sorting_algorithms
sorting_algorithms:heap-sort
0, 3, 9, 1, 8
[0,8,9,1,3] ; [9,8,0,1,3] ; [3,8,0,1,9] ; [8,3,0,1,9] ; [1,3,0,8,9] ; [3,1,0,8,9] ; [0,1,3,8,9] ; [1,0,3,8,9] ; [0,1,3,8,9]
sorting_algorithms
sorting_algorithms:insertion-sort
4, 3, 0, 1, 8
[3,4,0,1,8] ; [0,3,4,1,8] ; [0,1,3,4,8] ; [0,1,3,4,8]
sorting_algorithms
sorting_algorithms:insertion-sort
4, 3, 0, 9, 6
[3,4,0,9,6] ; [0,3,4,9,6] ; [0,3,4,9,6] ; [0,3,4,6,9]
base_conversion
base_conversion:decomposition
n=255,base=16
TERM:15*16^1=240 ; TERM:15*16^0=15 ; OUT:FF
sorting_algorithms
sorting_algorithms:merge-sort
1, 6, 8, 4, 5
[1,6,4,8,5] ; [1,4,6,8,5] ; [1,4,5,6,8]
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)
list_summation
list_summation:pairwise
4, 6, 1, 1
4+6=10 ; 1+1=2 ; 10+2=12
list_summation
list_summation:right-to-left
0, 6, 0, 6
0+6=6 ; 6+6=12 ; 0+12=12
list_summation
list_summation:left-to-right
9, 8, 7, 5
9+8=17 ; 17+7=24 ; 24+5=29
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-21=-30
3x-21=-30 ; x+-7=-10 ; x=-10--7 ; x=-3
base_conversion
base_conversion:via-binary
n=103,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:1 ; OUT:1100111
multidigit_addition
multidigit_addition:rounding-decomposition
504+385
round:510+385=895 ; adjust:895-6=889 ; sum=889
sorting_algorithms
sorting_algorithms:merge-sort
6, 1, 2, 9, 5
[1,6,2,9,5] ; [1,2,6,9,5] ; [1,2,5,6,9]
sorting_algorithms
sorting_algorithms:insertion-sort
5, 1, 9, 2, 0
[1,5,9,2,0] ; [1,5,9,2,0] ; [1,2,5,9,0] ; [0,1,2,5,9]