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:divide-then-subtract
4x+0=-36
4x+0=-36 ; x+0=-9 ; x=-9-0 ; x=-9
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,4) ; G=(2,5)
D:(1,4) ; D:(2,4) ; R:(2,5)
base_conversion
base_conversion:repeated-division
n=28,base=2
DIV:28/2=14,r:0 ; 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:11100
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-63=-81
9x-63=-81 ; x+-7=-9 ; x=-9--7 ; x=-2
sorting_algorithms
sorting_algorithms:bubble-sort
3, 2, 0, 8, 4
[2,3,0,8,4] ; [2,0,3,8,4] ; [2,0,3,4,8] ; [0,2,3,4,8]
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-14=-30
2x-14=-30 ; 2x=-16 ; x=-8
sorting_algorithms
sorting_algorithms:heap-sort
9, 2, 3, 1, 8
[9,8,3,1,2] ; [2,8,3,1,9] ; [8,2,3,1,9] ; [1,2,3,8,9] ; [3,2,1,8,9] ; [1,2,3,8,9] ; [2,1,3,8,9] ; [1,2,3,8,9]
base_conversion
base_conversion:repeated-division
n=34,base=8
DIV:34/8=4,r:2 ; DIV:4/8=0,r:4 ; OUT:42
multidigit_addition
multidigit_addition:rounding-decomposition
420+942
round:420+942=1362 ; adjust:1362-0=1362 ; sum=1362
linear_equation_solving
linear_equation_solving:inverse-ops
3x+6=-6
3x+6=-6 ; x=(-6-6)/3 ; x=-12/3 ; x=-4
base_conversion
base_conversion:via-binary
n=207,base=2
BINLEN:8 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:1 ; CHUNK:5:1 ; CHUNK:6:1 ; CHUNK:7:1 ; OUT:11001111
multidigit_addition
multidigit_addition:right-to-left-carry
732+667
d2:2+7+0=9→w9,c0 ; d1:3+6+0=9→w9,c0 ; d0:7+6+0=13→w3,c1 ; sum=1399
sorting_algorithms
sorting_algorithms:merge-sort
6, 7, 2, 8, 3
[2,6,7,8,3] ; [2,3,6,7,8]
list_summation
list_summation:left-to-right
3, 4, 8, 1
3+4=7 ; 7+8=15 ; 15+1=16
list_summation
list_summation:left-to-right
1, 2, 4, 3
1+2=3 ; 3+4=7 ; 7+3=10
multidigit_addition
multidigit_addition:rounding-decomposition
600+645
round:600+645=1245 ; adjust:1245-0=1245 ; sum=1245
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,1) ; G=(5,2)
R:(4,2) ; D:(5,2)
list_summation
list_summation:right-to-left
1, 0, 4, 8
4+8=12 ; 0+12=12 ; 1+12=13
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,0) ; G=(5,4)
R:(1,1) ; D:(2,1) ; R:(2,2) ; D:(3,2) ; R:(3,3) ; D:(4,3) ; R:(4,4) ; D:(5,4)
list_summation
list_summation:left-to-right
7, 4, 9, 5
7+4=11 ; 11+9=20 ; 20+5=25
base_conversion
base_conversion:repeated-division
n=85,base=4
DIV:85/4=21,r:1 ; DIV:21/4=5,r:1 ; DIV:5/4=1,r:1 ; DIV:1/4=0,r:1 ; OUT:1111
sorting_algorithms
sorting_algorithms:bubble-sort
3, 2, 4, 1, 6
[2,3,4,1,6] ; [2,3,1,4,6] ; [2,1,3,4,6] ; [1,2,3,4,6]
multidigit_addition
multidigit_addition:left-to-right-partials
129+632
p100:100+600=700 ; p10:20+30=50 ; p1:9+2=11 ; sum=700+50+11=761
sorting_algorithms
sorting_algorithms:insertion-sort
4, 6, 0, 5, 2
[4,6,0,5,2] ; [0,4,6,5,2] ; [0,4,5,6,2] ; [0,2,4,5,6]
base_conversion
base_conversion:repeated-division
n=96,base=8
DIV:96/8=12,r:0 ; DIV:12/8=1,r:4 ; DIV:1/8=0,r:1 ; OUT:140
sorting_algorithms
sorting_algorithms:heap-sort
8, 4, 7, 2, 0
[0,4,7,2,8] ; [7,4,0,2,8] ; [2,4,0,7,8] ; [4,2,0,7,8] ; [0,2,4,7,8] ; [2,0,4,7,8] ; [0,2,4,7,8]
base_conversion
base_conversion:via-binary
n=65,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:1 ; OUT:1001
list_summation
list_summation:left-to-right
4, 3, 1, 0
4+3=7 ; 7+1=8 ; 8+0=8
sorting_algorithms
sorting_algorithms:bubble-sort
8, 9, 4, 5, 0
[8,4,9,5,0] ; [8,4,5,9,0] ; [8,4,5,0,9] ; [4,8,5,0,9] ; [4,5,8,0,9] ; [4,5,0,8,9] ; [4,0,5,8,9] ; [0,4,5,8,9]
base_conversion
base_conversion:repeated-division
n=118,base=8
DIV:118/8=14,r:6 ; DIV:14/8=1,r:6 ; DIV:1/8=0,r:1 ; OUT:166
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,1) ; G=(4,5)
D:(3,1) ; D:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; R:(4,5)
sorting_algorithms
sorting_algorithms:insertion-sort
3, 9, 1, 6, 8
[3,9,1,6,8] ; [1,3,9,6,8] ; [1,3,6,9,8] ; [1,3,6,8,9]
multidigit_addition
multidigit_addition:right-to-left-carry
380+942
d2:0+2+0=2→w2,c0 ; d1:8+4+0=12→w2,c1 ; d0:3+9+1=13→w3,c1 ; sum=1322
base_conversion
base_conversion:repeated-division
n=77,base=8
DIV:77/8=9,r:5 ; DIV:9/8=1,r:1 ; DIV:1/8=0,r:1 ; OUT:115
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,3) ; G=(2,5)
R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5)
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-21=-70
7x-21=-70 ; 7x=-49 ; x=-7
multidigit_addition
multidigit_addition:rounding-decomposition
482+990
round:490+990=1480 ; adjust:1480-8=1472 ; sum=1472
base_conversion
base_conversion:via-binary
n=144,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:0 ; OUT:2100
list_summation
list_summation:right-to-left
9, 8, 6, 1
6+1=7 ; 8+7=15 ; 9+15=24
sorting_algorithms
sorting_algorithms:insertion-sort
5, 9, 4, 8, 3
[5,9,4,8,3] ; [4,5,9,8,3] ; [4,5,8,9,3] ; [3,4,5,8,9]
list_summation
list_summation:right-to-left
6, 1, 1, 9
1+9=10 ; 1+10=11 ; 6+11=17
multidigit_addition
multidigit_addition:right-to-left-carry
215+153
d2:5+3+0=8→w8,c0 ; d1:1+5+0=6→w6,c0 ; d0:2+1+0=3→w3,c0 ; sum=368
linear_equation_solving
linear_equation_solving:inverse-ops
9x+72=72
9x+72=72 ; x=(72-72)/9 ; x=0/9 ; x=0
sorting_algorithms
sorting_algorithms:insertion-sort
5, 2, 9, 0, 3
[2,5,9,0,3] ; [2,5,9,0,3] ; [0,2,5,9,3] ; [0,2,3,5,9]
sorting_algorithms
sorting_algorithms:insertion-sort
2, 4, 9, 0, 1
[2,4,9,0,1] ; [2,4,9,0,1] ; [0,2,4,9,1] ; [0,1,2,4,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(4,2)
R:(2,1) ; D:(3,1) ; R:(3,2) ; D:(4,2)
multidigit_addition
multidigit_addition:left-to-right-partials
529+876
p100:500+800=1300 ; p10:20+70=90 ; p1:9+6=15 ; sum=1300+90+15=1405
base_conversion
base_conversion:via-binary
n=88,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:2 ; CHUNK:3:0 ; OUT:1120
list_summation
list_summation:right-to-left
7, 6, 2, 5
2+5=7 ; 6+7=13 ; 7+13=20
base_conversion
base_conversion:repeated-division
n=168,base=8
DIV:168/8=21,r:0 ; DIV:21/8=2,r:5 ; DIV:2/8=0,r:2 ; OUT:250
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x+15=20
5x+15=20 ; 5x=5 ; x=1
base_conversion
base_conversion:decomposition
n=179,base=16
TERM:11*16^1=176 ; TERM:3*16^0=3 ; OUT:B3
sorting_algorithms
sorting_algorithms:heap-sort
1, 9, 8, 0, 6
[9,1,8,0,6] ; [9,6,8,0,1] ; [1,6,8,0,9] ; [8,6,1,0,9] ; [0,6,1,8,9] ; [6,0,1,8,9] ; [1,0,6,8,9] ; [0,1,6,8,9]
base_conversion
base_conversion:repeated-division
n=253,base=16
DIV:253/16=15,r:13 ; DIV:15/16=0,r:15 ; OUT:FD
base_conversion
base_conversion:decomposition
n=15,base=16
TERM:15*16^0=15 ; OUT:F
list_summation
list_summation:left-to-right
7, 7, 0, 7
7+7=14 ; 14+0=14 ; 14+7=21
list_summation
list_summation:left-to-right
5, 3, 3, 1
5+3=8 ; 8+3=11 ; 11+1=12
base_conversion
base_conversion:decomposition
n=170,base=16
TERM:10*16^1=160 ; TERM:10*16^0=10 ; OUT:AA
list_summation
list_summation:right-to-left
6, 3, 4, 0
4+0=4 ; 3+4=7 ; 6+7=13
linear_equation_solving
linear_equation_solving:inverse-ops
4x+24=-8
4x+24=-8 ; x=(-8-24)/4 ; x=-32/4 ; x=-8
linear_equation_solving
linear_equation_solving:inverse-ops
3x-3=-6
3x-3=-6 ; x=(-6--3)/3 ; x=-3/3 ; x=-1
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+14=22
2x+14=22 ; x+7=11 ; x=11-7 ; x=4
list_summation
list_summation:left-to-right
0, 1, 9, 6
0+1=1 ; 1+9=10 ; 10+6=16
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,3) ; G=(4,5)
R:(0,4) ; D:(1,4) ; R:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5)
list_summation
list_summation:pairwise
6, 1, 1, 7
6+1=7 ; 1+7=8 ; 7+8=15
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,2) ; G=(3,5)
D:(1,2) ; D:(2,2) ; D:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
base_conversion
base_conversion:via-binary
n=106,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:5 ; CHUNK:2:2 ; OUT:152
list_summation
list_summation:left-to-right
4, 9, 9, 4
4+9=13 ; 13+9=22 ; 22+4=26
sorting_algorithms
sorting_algorithms:insertion-sort
2, 0, 6, 9, 7
[0,2,6,9,7] ; [0,2,6,9,7] ; [0,2,6,9,7] ; [0,2,6,7,9]
sorting_algorithms
sorting_algorithms:heap-sort
5, 7, 6, 0, 3
[7,5,6,0,3] ; [3,5,6,0,7] ; [6,5,3,0,7] ; [0,5,3,6,7] ; [5,0,3,6,7] ; [3,0,5,6,7] ; [0,3,5,6,7]
sorting_algorithms
sorting_algorithms:selection-sort
5, 0, 9, 3, 1
[0,5,9,3,1] ; [0,1,9,3,5] ; [0,1,3,9,5] ; [0,1,3,5,9]
multidigit_addition
multidigit_addition:right-to-left-carry
444+553
d2:4+3+0=7→w7,c0 ; d1:4+5+0=9→w9,c0 ; d0:4+5+0=9→w9,c0 ; sum=997
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x+12=66
6x+12=66 ; 6x=54 ; x=9
base_conversion
base_conversion:repeated-division
n=104,base=4
DIV:104/4=26,r:0 ; DIV:26/4=6,r:2 ; DIV:6/4=1,r:2 ; DIV:1/4=0,r:1 ; OUT:1220
sorting_algorithms
sorting_algorithms:merge-sort
8, 2, 1, 3, 9
[2,8,1,3,9] ; [1,2,3,8,9]
sorting_algorithms
sorting_algorithms:heap-sort
8, 0, 2, 5, 9
[8,9,2,5,0] ; [9,8,2,5,0] ; [0,8,2,5,9] ; [8,0,2,5,9] ; [8,5,2,0,9] ; [0,5,2,8,9] ; [5,0,2,8,9] ; [2,0,5,8,9] ; [0,2,5,8,9]
list_summation
list_summation:pairwise
6, 7, 1, 8
6+7=13 ; 1+8=9 ; 13+9=22
sorting_algorithms
sorting_algorithms:bubble-sort
2, 7, 0, 8, 5
[2,0,7,8,5] ; [2,0,7,5,8] ; [0,2,7,5,8] ; [0,2,5,7,8]
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)
sorting_algorithms
sorting_algorithms:selection-sort
6, 7, 0, 5, 4
[0,7,6,5,4] ; [0,4,6,5,7] ; [0,4,5,6,7] ; [0,4,5,6,7]
multidigit_addition
multidigit_addition:rounding-decomposition
616+572
round:620+572=1192 ; adjust:1192-4=1188 ; sum=1188
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
multidigit_addition
multidigit_addition:left-to-right-partials
685+499
p100:600+400=1000 ; p10:80+90=170 ; p1:5+9=14 ; sum=1000+170+14=1184
base_conversion
base_conversion:decomposition
n=200,base=4
TERM:3*4^3=192 ; TERM:0*4^2=0 ; TERM:2*4^1=8 ; TERM:0*4^0=0 ; OUT:3020
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,3) ; G=(5,4)
R:(4,4) ; D:(5,4)
base_conversion
base_conversion:decomposition
n=184,base=4
TERM:2*4^3=128 ; TERM:3*4^2=48 ; TERM:2*4^1=8 ; TERM:0*4^0=0 ; OUT:2320
base_conversion
base_conversion:repeated-division
n=194,base=8
DIV:194/8=24,r:2 ; DIV:24/8=3,r:0 ; DIV:3/8=0,r:3 ; OUT:302
multidigit_addition
multidigit_addition:rounding-decomposition
256+408
round:260+408=668 ; adjust:668-4=664 ; sum=664
base_conversion
base_conversion:decomposition
n=156,base=4
TERM:2*4^3=128 ; TERM:1*4^2=16 ; TERM:3*4^1=12 ; TERM:0*4^0=0 ; OUT:2130
linear_equation_solving
linear_equation_solving:inverse-ops
5x+5=30
5x+5=30 ; x=(30-5)/5 ; x=25/5 ; x=5
sorting_algorithms
sorting_algorithms:insertion-sort
8, 6, 7, 5, 1
[6,8,7,5,1] ; [6,7,8,5,1] ; [5,6,7,8,1] ; [1,5,6,7,8]
base_conversion
base_conversion:decomposition
n=129,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:0*2^5=0 ; 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:10000001
sorting_algorithms
sorting_algorithms:heap-sort
3, 5, 4, 6, 9
[3,9,4,6,5] ; [9,3,4,6,5] ; [9,6,4,3,5] ; [5,6,4,3,9] ; [6,5,4,3,9] ; [3,5,4,6,9] ; [5,3,4,6,9] ; [4,3,5,6,9] ; [3,4,5,6,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,1) ; G=(2,3)
R:(0,2) ; R:(0,3) ; D:(1,3) ; D:(2,3)
multidigit_addition
multidigit_addition:rounding-decomposition
111+715
round:120+715=835 ; adjust:835-9=826 ; sum=826
linear_equation_solving
linear_equation_solving:inverse-ops
7x+7=63
7x+7=63 ; x=(63-7)/7 ; x=56/7 ; x=8
sorting_algorithms
sorting_algorithms:selection-sort
0, 3, 9, 1, 2
[0,3,9,1,2] ; [0,1,9,3,2] ; [0,1,2,3,9] ; [0,1,2,3,9]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(3,3) ; G=(5,4)
R:(3,4) ; D:(4,4) ; D:(5,4)