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
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,4) ; G=(3,5)
D:(2,4) ; D:(3,4) ; R:(3,5)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(3,4)
R:(1,2) ; D:(2,2) ; R:(2,3) ; D:(3,3) ; R:(3,4)
list_summation
list_summation:left-to-right
3, 4, 5, 5
3+4=7 ; 7+5=12 ; 12+5=17
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(2,3)
D:(2,2) ; R:(2,3)
linear_equation_solving
linear_equation_solving:divide-then-subtract
2x+2=-16
2x+2=-16 ; x+1=-8 ; x=-8-1 ; x=-9
list_summation
list_summation:pairwise
6, 5, 9, 4
6+5=11 ; 9+4=13 ; 11+13=24
base_conversion
base_conversion:decomposition
n=170,base=4
TERM:2*4^3=128 ; TERM:2*4^2=32 ; TERM:2*4^1=8 ; TERM:2*4^0=2 ; OUT:2222
list_summation
list_summation:right-to-left
5, 7, 4, 7
4+7=11 ; 7+11=18 ; 5+18=23
sorting_algorithms
sorting_algorithms:insertion-sort
8, 5, 7, 4, 2
[5,8,7,4,2] ; [5,7,8,4,2] ; [4,5,7,8,2] ; [2,4,5,7,8]
multidigit_addition
multidigit_addition:rounding-decomposition
781+246
round:790+246=1036 ; adjust:1036-9=1027 ; sum=1027
sorting_algorithms
sorting_algorithms:insertion-sort
9, 7, 5, 6, 1
[7,9,5,6,1] ; [5,7,9,6,1] ; [5,6,7,9,1] ; [1,5,6,7,9]
multidigit_addition
multidigit_addition:rounding-decomposition
937+215
round:940+215=1155 ; adjust:1155-3=1152 ; sum=1152
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x-27=27
9x-27=27 ; x+-3=3 ; x=3--3 ; x=6
base_conversion
base_conversion:decomposition
n=206,base=4
TERM:3*4^3=192 ; TERM:0*4^2=0 ; TERM:3*4^1=12 ; TERM:2*4^0=2 ; OUT:3032
multidigit_addition
multidigit_addition:rounding-decomposition
262+168
round:270+168=438 ; adjust:438-8=430 ; sum=430
sorting_algorithms
sorting_algorithms:selection-sort
2, 5, 6, 7, 0
[0,5,6,7,2] ; [0,2,6,7,5] ; [0,2,5,7,6] ; [0,2,5,6,7]
list_summation
list_summation:right-to-left
5, 6, 1, 8
1+8=9 ; 6+9=15 ; 5+15=20
base_conversion
base_conversion:via-binary
n=52,base=4
BINLEN:6 ; CHUNK:0:3 ; CHUNK:1:1 ; CHUNK:2:0 ; OUT:310
linear_equation_solving
linear_equation_solving:subtract-then-divide
5x-40=-15
5x-40=-15 ; 5x=25 ; x=5
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x+8=72
8x+8=72 ; 8x=64 ; x=8
multidigit_addition
multidigit_addition:left-to-right-partials
299+730
p100:200+700=900 ; p10:90+30=120 ; p1:9+0=9 ; sum=900+120+9=1029
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(4,3)
D:(2,2) ; D:(3,2) ; D:(4,2) ; R:(4,3)
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x-6=-10
2x-6=-10 ; 2x=-4 ; x=-2
list_summation
list_summation:pairwise
2, 3, 7, 4
2+3=5 ; 7+4=11 ; 5+11=16
base_conversion
base_conversion:repeated-division
n=4,base=8
DIV:4/8=0,r:4 ; OUT:4
multidigit_addition
multidigit_addition:right-to-left-carry
683+143
d2:3+3+0=6→w6,c0 ; d1:8+4+0=12→w2,c1 ; d0:6+1+1=8→w8,c0 ; sum=826
multidigit_addition
multidigit_addition:left-to-right-partials
318+821
p100:300+800=1100 ; p10:10+20=30 ; p1:8+1=9 ; sum=1100+30+9=1139
base_conversion
base_conversion:repeated-division
n=99,base=2
DIV:99/2=49,r:1 ; DIV:49/2=24,r:1 ; DIV:24/2=12,r:0 ; 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:1100011
base_conversion
base_conversion:via-binary
n=109,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:1 ; CHUNK:2:0 ; CHUNK:3:1 ; CHUNK:4:1 ; CHUNK:5:0 ; CHUNK:6:1 ; OUT:1101101
multidigit_addition
multidigit_addition:right-to-left-carry
963+611
d2:3+1+0=4→w4,c0 ; d1:6+1+0=7→w7,c0 ; d0:9+6+0=15→w5,c1 ; sum=1574
sorting_algorithms
sorting_algorithms:insertion-sort
1, 4, 6, 9, 2
[1,4,6,9,2] ; [1,4,6,9,2] ; [1,4,6,9,2] ; [1,2,4,6,9]
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,4) ; G=(1,5)
R:(0,5) ; D:(1,5)
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)
linear_equation_solving
linear_equation_solving:divide-then-subtract
5x+5=5
5x+5=5 ; x+1=1 ; x=1-1 ; x=0
list_summation
list_summation:left-to-right
4, 8, 0, 5
4+8=12 ; 12+0=12 ; 12+5=17
linear_equation_solving
linear_equation_solving:subtract-then-divide
4x+36=44
4x+36=44 ; 4x=8 ; x=2
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,0) ; G=(5,4)
R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4) ; D:(5,4)
multidigit_addition
multidigit_addition:rounding-decomposition
823+864
round:830+864=1694 ; adjust:1694-7=1687 ; sum=1687
linear_equation_solving
linear_equation_solving:inverse-ops
2x-6=-6
2x-6=-6 ; x=(-6--6)/2 ; x=0/2 ; x=0
multidigit_addition
multidigit_addition:right-to-left-carry
805+269
d2:5+9+0=14→w4,c1 ; d1:0+6+1=7→w7,c0 ; d0:8+2+0=10→w0,c1 ; sum=1074
base_conversion
base_conversion:repeated-division
n=6,base=8
DIV:6/8=0,r:6 ; OUT:6
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,3) ; G=(4,5)
D:(2,3) ; D:(3,3) ; D:(4,3) ; R:(4,4) ; R:(4,5)
multidigit_addition
multidigit_addition:right-to-left-carry
228+227
d2:8+7+0=15→w5,c1 ; d1:2+2+1=5→w5,c0 ; d0:2+2+0=4→w4,c0 ; sum=455
multidigit_addition
multidigit_addition:rounding-decomposition
622+898
round:630+898=1528 ; adjust:1528-8=1520 ; sum=1520
multidigit_addition
multidigit_addition:left-to-right-partials
846+773
p100:800+700=1500 ; p10:40+70=110 ; p1:6+3=9 ; sum=1500+110+9=1619
multidigit_addition
multidigit_addition:left-to-right-partials
769+627
p100:700+600=1300 ; p10:60+20=80 ; p1:9+7=16 ; sum=1300+80+16=1396
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(0,4) ; G=(4,5)
D:(1,4) ; D:(2,4) ; D:(3,4) ; D:(4,4) ; R:(4,5)
list_summation
list_summation:pairwise
5, 2, 0, 2
5+2=7 ; 0+2=2 ; 7+2=9
sorting_algorithms
sorting_algorithms:insertion-sort
5, 8, 9, 0, 1
[5,8,9,0,1] ; [5,8,9,0,1] ; [0,5,8,9,1] ; [0,1,5,8,9]
base_conversion
base_conversion:decomposition
n=15,base=4
TERM:3*4^1=12 ; TERM:3*4^0=3 ; OUT:33
base_conversion
base_conversion:via-binary
n=115,base=4
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:3 ; CHUNK:2:0 ; CHUNK:3:3 ; OUT:1303
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+10=4
2x+10=4 ; 2x=-6 ; x=-3
base_conversion
base_conversion:decomposition
n=142,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:0*2^5=0 ; TERM:0*2^4=0 ; TERM:1*2^3=8 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:10001110
multidigit_addition
multidigit_addition:left-to-right-partials
575+694
p100:500+600=1100 ; p10:70+90=160 ; p1:5+4=9 ; sum=1100+160+9=1269
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,4) ; G=(5,5)
R:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,4) ; G=(3,5)
R:(2,5) ; D:(3,5)
list_summation
list_summation:pairwise
4, 8, 3, 1
4+8=12 ; 3+1=4 ; 12+4=16
multidigit_addition
multidigit_addition:left-to-right-partials
729+608
p100:700+600=1300 ; p10:20+0=20 ; p1:9+8=17 ; sum=1300+20+17=1337
base_conversion
base_conversion:decomposition
n=215,base=4
TERM:3*4^3=192 ; TERM:1*4^2=16 ; TERM:1*4^1=4 ; TERM:3*4^0=3 ; OUT:3113
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(2,4)
D:(2,0) ; R:(2,1) ; R:(2,2) ; R:(2,3) ; R:(2,4)
sorting_algorithms
sorting_algorithms:insertion-sort
8, 4, 2, 3, 0
[4,8,2,3,0] ; [2,4,8,3,0] ; [2,3,4,8,0] ; [0,2,3,4,8]
sorting_algorithms
sorting_algorithms:merge-sort
1, 4, 8, 7, 6
[1,4,7,8,6] ; [1,4,6,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
2x+14=12
2x+14=12 ; x=(12-14)/2 ; x=-2/2 ; x=-1
base_conversion
base_conversion:via-binary
n=185,base=4
BINLEN:8 ; CHUNK:0:2 ; CHUNK:1:3 ; CHUNK:2:2 ; CHUNK:3:1 ; OUT:2321
base_conversion
base_conversion:repeated-division
n=220,base=2
DIV:220/2=110,r:0 ; DIV:110/2=55,r:0 ; DIV:55/2=27,r:1 ; DIV:27/2=13,r:1 ; DIV:13/2=6,r:1 ; DIV:6/2=3,r:0 ; DIV:3/2=1,r:1 ; DIV:1/2=0,r:1 ; OUT:11011100
multidigit_addition
multidigit_addition:left-to-right-partials
815+786
p100:800+700=1500 ; p10:10+80=90 ; p1:5+6=11 ; sum=1500+90+11=1601
base_conversion
base_conversion:decomposition
n=131,base=4
TERM:2*4^3=128 ; TERM:0*4^2=0 ; TERM:0*4^1=0 ; TERM:3*4^0=3 ; OUT:2003
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(4,4) ; G=(5,5)
R:(4,5) ; D:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(4,4)
D:(2,0) ; D:(3,0) ; D:(4,0) ; R:(4,1) ; R:(4,2) ; R:(4,3) ; R:(4,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,0) ; G=(5,3)
R:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3)
linear_equation_solving
linear_equation_solving:inverse-ops
5x+45=0
5x+45=0 ; x=(0-45)/5 ; x=-45/5 ; x=-9
multidigit_addition
multidigit_addition:rounding-decomposition
748+357
round:750+357=1107 ; adjust:1107-2=1105 ; sum=1105
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,1) ; G=(2,2)
R:(1,2) ; D:(2,2)
multidigit_addition
multidigit_addition:left-to-right-partials
858+944
p100:800+900=1700 ; p10:50+40=90 ; p1:8+4=12 ; sum=1700+90+12=1802
list_summation
list_summation:pairwise
4, 9, 8, 5
4+9=13 ; 8+5=13 ; 13+13=26
multidigit_addition
multidigit_addition:rounding-decomposition
903+699
round:910+699=1609 ; adjust:1609-7=1602 ; sum=1602
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)
list_summation
list_summation:left-to-right
4, 7, 9, 2
4+7=11 ; 11+9=20 ; 20+2=22
base_conversion
base_conversion:decomposition
n=181,base=8
TERM:2*8^2=128 ; TERM:6*8^1=48 ; TERM:5*8^0=5 ; OUT:265
base_conversion
base_conversion:repeated-division
n=66,base=16
DIV:66/16=4,r:2 ; DIV:4/16=0,r:4 ; OUT:42
base_conversion
base_conversion:repeated-division
n=229,base=4
DIV:229/4=57,r:1 ; DIV:57/4=14,r:1 ; DIV:14/4=3,r:2 ; DIV:3/4=0,r:3 ; OUT:3211
sorting_algorithms
sorting_algorithms:insertion-sort
8, 2, 3, 5, 9
[2,8,3,5,9] ; [2,3,8,5,9] ; [2,3,5,8,9] ; [2,3,5,8,9]
base_conversion
base_conversion:decomposition
n=166,base=2
TERM:1*2^7=128 ; TERM:0*2^6=0 ; TERM:1*2^5=32 ; TERM:0*2^4=0 ; TERM:0*2^3=0 ; TERM:1*2^2=4 ; TERM:1*2^1=2 ; TERM:0*2^0=0 ; OUT:10100110
sorting_algorithms
sorting_algorithms:heap-sort
9, 8, 5, 1, 2
[2,8,5,1,9] ; [8,2,5,1,9] ; [1,2,5,8,9] ; [5,2,1,8,9] ; [1,2,5,8,9] ; [2,1,5,8,9] ; [1,2,5,8,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(4,5)
D:(4,4) ; R:(4,5)
sorting_algorithms
sorting_algorithms:selection-sort
1, 3, 7, 9, 2
[1,3,7,9,2] ; [1,2,7,9,3] ; [1,2,3,9,7] ; [1,2,3,7,9]
sorting_algorithms
sorting_algorithms:heap-sort
8, 4, 3, 2, 9
[8,9,3,2,4] ; [9,8,3,2,4] ; [4,8,3,2,9] ; [8,4,3,2,9] ; [2,4,3,8,9] ; [4,2,3,8,9] ; [3,2,4,8,9] ; [2,3,4,8,9]
sorting_algorithms
sorting_algorithms:merge-sort
1, 4, 7, 3, 5
[1,4,3,7,5] ; [1,3,4,7,5] ; [1,3,4,5,7]
base_conversion
base_conversion:repeated-division
n=76,base=8
DIV:76/8=9,r:4 ; DIV:9/8=1,r:1 ; DIV:1/8=0,r:1 ; OUT:114
list_summation
list_summation:left-to-right
3, 4, 3, 8
3+4=7 ; 7+3=10 ; 10+8=18
list_summation
list_summation:right-to-left
1, 6, 2, 0
2+0=2 ; 6+2=8 ; 1+8=9
base_conversion
base_conversion:repeated-division
n=210,base=16
DIV:210/16=13,r:2 ; DIV:13/16=0,r:13 ; OUT:D2
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+81=63
9x+81=63 ; x+9=7 ; x=7-9 ; x=-2
list_summation
list_summation:pairwise
7, 6, 8, 0
7+6=13 ; 8+0=8 ; 13+8=21
list_summation
list_summation:left-to-right
8, 8, 0, 7
8+8=16 ; 16+0=16 ; 16+7=23
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(5,2)
R:(2,2) ; D:(3,2) ; D:(4,2) ; D:(5,2)
list_summation
list_summation:right-to-left
1, 7, 0, 2
0+2=2 ; 7+2=9 ; 1+9=10
linear_equation_solving
linear_equation_solving:divide-then-subtract
6x+6=60
6x+6=60 ; x+1=10 ; x=10-1 ; x=9
list_summation
list_summation:right-to-left
3, 0, 6, 0
6+0=6 ; 0+6=6 ; 3+6=9
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x-81=-63
9x-81=-63 ; 9x=18 ; x=2