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
multidigit_addition
multidigit_addition:right-to-left-carry
892+263
d2:2+3+0=5→w5,c0 ; d1:9+6+0=15→w5,c1 ; d0:8+2+1=11→w1,c1 ; sum=1155
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,1) ; G=(4,2)
R:(3,2) ; D:(4,2)
multidigit_addition
multidigit_addition:left-to-right-partials
699+871
p100:600+800=1400 ; p10:90+70=160 ; p1:9+1=10 ; sum=1400+160+10=1570
multidigit_addition
multidigit_addition:left-to-right-partials
362+430
p100:300+400=700 ; p10:60+30=90 ; p1:2+0=2 ; sum=700+90+2=792
multidigit_addition
multidigit_addition:rounding-decomposition
151+765
round:160+765=925 ; adjust:925-9=916 ; sum=916
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,4) ; G=(5,5)
D:(5,4) ; R:(5,5)
list_summation
list_summation:left-to-right
5, 5, 4, 0
5+5=10 ; 10+4=14 ; 14+0=14
multidigit_addition
multidigit_addition:rounding-decomposition
807+510
round:810+510=1320 ; adjust:1320-3=1317 ; sum=1317
sorting_algorithms
sorting_algorithms:heap-sort
6, 2, 5, 0, 3
[6,3,5,0,2] ; [2,3,5,0,6] ; [5,3,2,0,6] ; [0,3,2,5,6] ; [3,0,2,5,6] ; [2,0,3,5,6] ; [0,2,3,5,6]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,1) ; G=(3,5)
R:(2,2) ; D:(3,2) ; R:(3,3) ; R:(3,4) ; R:(3,5)
sorting_algorithms
sorting_algorithms:bubble-sort
5, 3, 1, 2, 4
[3,5,1,2,4] ; [3,1,5,2,4] ; [3,1,2,5,4] ; [3,1,2,4,5] ; [1,3,2,4,5] ; [1,2,3,4,5]
list_summation
list_summation:right-to-left
8, 3, 5, 4
5+4=9 ; 3+9=12 ; 8+12=20
multidigit_addition
multidigit_addition:left-to-right-partials
288+892
p100:200+800=1000 ; p10:80+90=170 ; p1:8+2=10 ; sum=1000+170+10=1180
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)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,4) ; G=(3,5)
D:(1,4) ; D:(2,4) ; D:(3,4) ; R:(3,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,0) ; G=(5,2)
R:(3,1) ; R:(3,2) ; D:(4,2) ; D:(5,2)
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-27=-9
3x-27=-9 ; x+-9=-3 ; x=-3--9 ; x=6
multidigit_addition
multidigit_addition:left-to-right-partials
948+173
p100:900+100=1000 ; p10:40+70=110 ; p1:8+3=11 ; sum=1000+110+11=1121
list_summation
list_summation:left-to-right
7, 8, 9, 0
7+8=15 ; 15+9=24 ; 24+0=24
linear_equation_solving
linear_equation_solving:inverse-ops
5x-15=-20
5x-15=-20 ; x=(-20--15)/5 ; x=-5/5 ; x=-1
multidigit_addition
multidigit_addition:left-to-right-partials
419+248
p100:400+200=600 ; p10:10+40=50 ; p1:9+8=17 ; sum=600+50+17=667
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,4)
D:(5,3) ; R:(5,4)
sorting_algorithms
sorting_algorithms:insertion-sort
6, 5, 1, 2, 3
[5,6,1,2,3] ; [1,5,6,2,3] ; [1,2,5,6,3] ; [1,2,3,5,6]
sorting_algorithms
sorting_algorithms:bubble-sort
4, 1, 8, 0, 7
[1,4,8,0,7] ; [1,4,0,8,7] ; [1,4,0,7,8] ; [1,0,4,7,8] ; [0,1,4,7,8]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,1) ; G=(5,5)
D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+21=56
7x+21=56 ; x+3=8 ; x=8-3 ; x=5
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+2=-6
2x+2=-6 ; x+1=-3 ; x=-3-1 ; x=-4
base_conversion
base_conversion:via-binary
n=82,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:2 ; OUT:1102
sorting_algorithms
sorting_algorithms:selection-sort
8, 6, 3, 0, 4
[0,6,3,8,4] ; [0,3,6,8,4] ; [0,3,4,8,6] ; [0,3,4,6,8]
linear_equation_solving
linear_equation_solving:divide-then-subtract
8x+72=32
8x+72=32 ; x+9=4 ; x=4-9 ; x=-5
sorting_algorithms
sorting_algorithms:insertion-sort
1, 2, 3, 7, 0
[1,2,3,7,0] ; [1,2,3,7,0] ; [1,2,3,7,0] ; [0,1,2,3,7]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,0) ; G=(3,4)
R:(1,1) ; R:(1,2) ; R:(1,3) ; R:(1,4) ; D:(2,4) ; D:(3,4)
multidigit_addition
multidigit_addition:rounding-decomposition
584+858
round:590+858=1448 ; adjust:1448-6=1442 ; sum=1442
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,1) ; G=(5,4)
R:(0,2) ; R:(0,3) ; R:(0,4) ; D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x-30=24
6x-30=24 ; x+-5=4 ; x=4--5 ; x=9
list_summation
list_summation:left-to-right
2, 3, 6, 6
2+3=5 ; 5+6=11 ; 11+6=17
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x+21=63
7x+21=63 ; 7x=42 ; x=6
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-8=-8
8x-8=-8 ; 8x=0 ; x=0
base_conversion
base_conversion:via-binary
n=72,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:2 ; CHUNK:3:0 ; OUT:1020
sorting_algorithms
sorting_algorithms:heap-sort
3, 0, 4, 5, 7
[3,7,4,5,0] ; [7,3,4,5,0] ; [7,5,4,3,0] ; [0,5,4,3,7] ; [5,0,4,3,7] ; [5,3,4,0,7] ; [0,3,4,5,7] ; [4,3,0,5,7] ; [0,3,4,5,7] ; [3,0,4,5,7] ; [0,3,4,5,7]
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-20=-48
4x-20=-48 ; x+-5=-12 ; x=-12--5 ; x=-7
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
sorting_algorithms
sorting_algorithms:insertion-sort
3, 4, 0, 1, 7
[3,4,0,1,7] ; [0,3,4,1,7] ; [0,1,3,4,7] ; [0,1,3,4,7]
base_conversion
base_conversion:via-binary
n=10,base=2
BINLEN:4 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:1 ; CHUNK:3:0 ; OUT:1010
list_summation
list_summation:pairwise
8, 7, 9, 7
8+7=15 ; 9+7=16 ; 15+16=31
multidigit_addition
multidigit_addition:rounding-decomposition
998+513
round:1000+513=1513 ; adjust:1513-2=1511 ; sum=1511
list_summation
list_summation:left-to-right
9, 5, 6, 7
9+5=14 ; 14+6=20 ; 20+7=27
multidigit_addition
multidigit_addition:left-to-right-partials
824+893
p100:800+800=1600 ; p10:20+90=110 ; p1:4+3=7 ; sum=1600+110+7=1717
linear_equation_solving
linear_equation_solving:inverse-ops
2x-4=-20
2x-4=-20 ; x=(-20--4)/2 ; x=-16/2 ; x=-8
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(2,2) ; G=(4,4)
D:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4)
sorting_algorithms
sorting_algorithms:heap-sort
3, 1, 6, 0, 4
[3,4,6,0,1] ; [6,4,3,0,1] ; [1,4,3,0,6] ; [4,1,3,0,6] ; [0,1,3,4,6] ; [3,1,0,4,6] ; [0,1,3,4,6] ; [1,0,3,4,6] ; [0,1,3,4,6]
sorting_algorithms
sorting_algorithms:merge-sort
9, 7, 1, 4, 6
[7,9,1,4,6] ; [1,4,7,9,6] ; [1,4,6,7,9]
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
6, 5, 2, 0, 3
[0,5,2,6,3] ; [0,2,5,6,3] ; [0,2,3,6,5] ; [0,2,3,5,6]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(5,1)
D:(2,0) ; D:(3,0) ; D:(4,0) ; D:(5,0) ; R:(5,1)
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
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-56=-16
8x-56=-16 ; 8x=40 ; x=5
base_conversion
base_conversion:via-binary
n=192,base=16
BINLEN:8 ; CHUNK:0:12 ; CHUNK:1:0 ; OUT:C0
base_conversion
base_conversion:decomposition
n=155,base=4
TERM:2*4^3=128 ; TERM:1*4^2=16 ; TERM:2*4^1=8 ; TERM:3*4^0=3 ; OUT:2123
list_summation
list_summation:left-to-right
3, 8, 3, 5
3+8=11 ; 11+3=14 ; 14+5=19
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+20=4
4x+20=4 ; 4x=-16 ; x=-4
sorting_algorithms
sorting_algorithms:insertion-sort
4, 8, 0, 7, 9
[4,8,0,7,9] ; [0,4,8,7,9] ; [0,4,7,8,9] ; [0,4,7,8,9]
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:via-binary
n=81,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; OUT:1101
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,3) ; G=(4,4)
D:(2,3) ; D:(3,3) ; D:(4,3) ; R:(4,4)
sorting_algorithms
sorting_algorithms:heap-sort
8, 9, 4, 6, 3
[9,8,4,6,3] ; [3,8,4,6,9] ; [8,3,4,6,9] ; [8,6,4,3,9] ; [3,6,4,8,9] ; [6,3,4,8,9] ; [4,3,6,8,9] ; [3,4,6,8,9]
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x-16=-20
4x-16=-20 ; x+-4=-5 ; x=-5--4 ; x=-1
list_summation
list_summation:left-to-right
9, 5, 9, 5
9+5=14 ; 14+9=23 ; 23+5=28
linear_equation_solving
linear_equation_solving:divide-then-subtract
3x-24=-51
3x-24=-51 ; x+-8=-17 ; x=-17--8 ; x=-9
base_conversion
base_conversion:via-binary
n=150,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:1 ; CHUNK:2:1 ; CHUNK:3:2 ; OUT:2112
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+9=0
9x+9=0 ; x+1=0 ; x=0-1 ; x=-1
base_conversion
base_conversion:decomposition
n=4,base=2
TERM:1*2^2=4 ; TERM:0*2^1=0 ; TERM:0*2^0=0 ; OUT:100
list_summation
list_summation:right-to-left
9, 3, 3, 7
3+7=10 ; 3+10=13 ; 9+13=22
base_conversion
base_conversion:decomposition
n=68,base=4
TERM:1*4^3=64 ; TERM:0*4^2=0 ; TERM:1*4^1=4 ; TERM:0*4^0=0 ; OUT:1010
base_conversion
base_conversion:decomposition
n=69,base=8
TERM:1*8^2=64 ; TERM:0*8^1=0 ; TERM:5*8^0=5 ; OUT:105
linear_equation_solving
linear_equation_solving:inverse-ops
9x+45=9
9x+45=9 ; x=(9-45)/9 ; x=-36/9 ; x=-4
multidigit_addition
multidigit_addition:right-to-left-carry
215+812
d2:5+2+0=7→w7,c0 ; d1:1+1+0=2→w2,c0 ; d0:2+8+0=10→w0,c1 ; sum=1027
list_summation
list_summation:right-to-left
0, 7, 3, 5
3+5=8 ; 7+8=15 ; 0+15=15
sorting_algorithms
sorting_algorithms:heap-sort
2, 5, 3, 4, 8
[2,8,3,4,5] ; [8,2,3,4,5] ; [8,5,3,4,2] ; [2,5,3,4,8] ; [5,2,3,4,8] ; [5,4,3,2,8] ; [2,4,3,5,8] ; [4,2,3,5,8] ; [3,2,4,5,8] ; [2,3,4,5,8]
base_conversion
base_conversion:repeated-division
n=106,base=16
DIV:106/16=6,r:10 ; DIV:6/16=0,r:6 ; OUT:6A
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(5,2)
R:(1,2) ; D:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
list_summation
list_summation:left-to-right
7, 7, 8, 9
7+7=14 ; 14+8=22 ; 22+9=31
list_summation
list_summation:left-to-right
2, 4, 1, 4
2+4=6 ; 6+1=7 ; 7+4=11
sorting_algorithms
sorting_algorithms:bubble-sort
9, 5, 4, 3, 8
[5,9,4,3,8] ; [5,4,9,3,8] ; [5,4,3,9,8] ; [5,4,3,8,9] ; [4,5,3,8,9] ; [4,3,5,8,9] ; [3,4,5,8,9]
multidigit_addition
multidigit_addition:rounding-decomposition
176+501
round:180+501=681 ; adjust:681-4=677 ; sum=677
sorting_algorithms
sorting_algorithms:insertion-sort
4, 3, 9, 2, 7
[3,4,9,2,7] ; [3,4,9,2,7] ; [2,3,4,9,7] ; [2,3,4,7,9]
sorting_algorithms
sorting_algorithms:selection-sort
9, 4, 0, 8, 2
[0,4,9,8,2] ; [0,2,9,8,4] ; [0,2,4,8,9] ; [0,2,4,8,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,0) ; G=(2,3)
R:(0,1) ; R:(0,2) ; R:(0,3) ; D:(1,3) ; D:(2,3)
sorting_algorithms
sorting_algorithms:insertion-sort
2, 6, 1, 5, 8
[2,6,1,5,8] ; [1,2,6,5,8] ; [1,2,5,6,8] ; [1,2,5,6,8]
sorting_algorithms
sorting_algorithms:bubble-sort
6, 0, 2, 9, 4
[0,6,2,9,4] ; [0,2,6,9,4] ; [0,2,6,4,9] ; [0,2,4,6,9]
multidigit_addition
multidigit_addition:right-to-left-carry
890+287
d2:0+7+0=7→w7,c0 ; d1:9+8+0=17→w7,c1 ; d0:8+2+1=11→w1,c1 ; sum=1177
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,3) ; G=(2,4)
R:(1,4) ; D:(2,4)
base_conversion
base_conversion:repeated-division
n=111,base=8
DIV:111/8=13,r:7 ; DIV:13/8=1,r:5 ; DIV:1/8=0,r:1 ; OUT:157
list_summation
list_summation:left-to-right
6, 1, 2, 9
6+1=7 ; 7+2=9 ; 9+9=18
sorting_algorithms
sorting_algorithms:merge-sort
1, 8, 6, 9, 0
[1,6,8,9,0] ; [0,1,6,8,9]
list_summation
list_summation:pairwise
3, 7, 1, 6
3+7=10 ; 1+6=7 ; 10+7=17
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(1,2) ; G=(2,3)
R:(1,3) ; D:(2,3)
list_summation
list_summation:left-to-right
8, 8, 8, 0
8+8=16 ; 16+8=24 ; 24+0=24
linear_equation_solving
linear_equation_solving:inverse-ops
6x-42=-90
6x-42=-90 ; x=(-90--42)/6 ; x=-48/6 ; x=-8
multidigit_addition
multidigit_addition:right-to-left-carry
509+755
d2:9+5+0=14→w4,c1 ; d1:0+5+1=6→w6,c0 ; d0:5+7+0=12→w2,c1 ; sum=1264