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:right-first
grid=6 ; S=(4,3) ; G=(5,5)
R:(4,4) ; R:(4,5) ; D:(5,5)
linear_equation_solving
linear_equation_solving:inverse-ops
5x+20=30
5x+20=30 ; x=(30-20)/5 ; x=10/5 ; x=2
list_summation
list_summation:left-to-right
6, 7, 2, 5
6+7=13 ; 13+2=15 ; 15+5=20
base_conversion
base_conversion:decomposition
n=39,base=8
TERM:4*8^1=32 ; TERM:7*8^0=7 ; OUT:47
base_conversion
base_conversion:via-binary
n=81,base=8
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:2 ; CHUNK:2:1 ; OUT:121
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(0,3) ; G=(5,5)
R:(0,4) ; R:(0,5) ; D:(1,5) ; D:(2,5) ; D:(3,5) ; D:(4,5) ; D:(5,5)
base_conversion
base_conversion:repeated-division
n=229,base=2
DIV:229/2=114,r:1 ; DIV:114/2=57,r:0 ; DIV:57/2=28,r:1 ; 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:11100101
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(1,0) ; G=(5,1)
R:(1,1) ; D:(2,1) ; D:(3,1) ; D:(4,1) ; D:(5,1)
linear_equation_solving
linear_equation_solving:inverse-ops
9x+63=36
9x+63=36 ; x=(36-63)/9 ; x=-27/9 ; x=-3
base_conversion
base_conversion:repeated-division
n=193,base=4
DIV:193/4=48,r:1 ; DIV:48/4=12,r:0 ; DIV:12/4=3,r:0 ; DIV:3/4=0,r:3 ; OUT:3001
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x-63=-99
9x-63=-99 ; 9x=-36 ; x=-4
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,1) ; G=(5,4)
R:(4,2) ; D:(5,2) ; R:(5,3) ; R:(5,4)
linear_equation_solving
linear_equation_solving:subtract-then-divide
2x+18=22
2x+18=22 ; 2x=4 ; x=2
base_conversion
base_conversion:repeated-division
n=4,base=16
DIV:4/16=0,r:4 ; OUT:4
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:rounding-decomposition
162+536
round:170+536=706 ; adjust:706-8=698 ; sum=698
sorting_algorithms
sorting_algorithms:insertion-sort
1, 7, 8, 0, 5
[1,7,8,0,5] ; [1,7,8,0,5] ; [0,1,7,8,5] ; [0,1,5,7,8]
linear_equation_solving
linear_equation_solving:inverse-ops
4x+24=56
4x+24=56 ; x=(56-24)/4 ; x=32/4 ; x=8
sorting_algorithms
sorting_algorithms:insertion-sort
6, 8, 0, 4, 7
[6,8,0,4,7] ; [0,6,8,4,7] ; [0,4,6,8,7] ; [0,4,6,7,8]
base_conversion
base_conversion:decomposition
n=90,base=2
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:1011010
sorting_algorithms
sorting_algorithms:bubble-sort
6, 3, 5, 2, 1
[3,6,5,2,1] ; [3,5,6,2,1] ; [3,5,2,6,1] ; [3,5,2,1,6] ; [3,2,5,1,6] ; [3,2,1,5,6] ; [2,3,1,5,6] ; [2,1,3,5,6] ; [1,2,3,5,6]
sorting_algorithms
sorting_algorithms:heap-sort
6, 9, 7, 2, 0
[9,6,7,2,0] ; [0,6,7,2,9] ; [7,6,0,2,9] ; [2,6,0,7,9] ; [6,2,0,7,9] ; [0,2,6,7,9] ; [2,0,6,7,9] ; [0,2,6,7,9]
list_summation
list_summation:right-to-left
5, 5, 7, 0
7+0=7 ; 5+7=12 ; 5+12=17
list_summation
list_summation:pairwise
1, 5, 0, 1
1+5=6 ; 0+1=1 ; 6+1=7
sorting_algorithms
sorting_algorithms:insertion-sort
9, 5, 2, 1, 7
[5,9,2,1,7] ; [2,5,9,1,7] ; [1,2,5,9,7] ; [1,2,5,7,9]
multidigit_addition
multidigit_addition:rounding-decomposition
768+437
round:770+437=1207 ; adjust:1207-2=1205 ; sum=1205
multidigit_addition
multidigit_addition:left-to-right-partials
365+470
p100:300+400=700 ; p10:60+70=130 ; p1:5+0=5 ; sum=700+130+5=835
base_conversion
base_conversion:decomposition
n=200,base=8
TERM:3*8^2=192 ; TERM:1*8^1=8 ; TERM:0*8^0=0 ; OUT:310
base_conversion
base_conversion:via-binary
n=47,base=16
BINLEN:6 ; CHUNK:0:2 ; CHUNK:1:15 ; OUT:2F
sorting_algorithms
sorting_algorithms:selection-sort
1, 6, 3, 0, 4
[0,6,3,1,4] ; [0,1,3,6,4] ; [0,1,3,6,4] ; [0,1,3,4,6]
base_conversion
base_conversion:via-binary
n=67,base=2
BINLEN:7 ; CHUNK:0:1 ; CHUNK:1:0 ; CHUNK:2:0 ; CHUNK:3:0 ; CHUNK:4:0 ; CHUNK:5:1 ; CHUNK:6:1 ; OUT:1000011
list_summation
list_summation:pairwise
0, 7, 4, 3
0+7=7 ; 4+3=7 ; 7+7=14
base_conversion
base_conversion:repeated-division
n=128,base=4
DIV:128/4=32,r:0 ; DIV:32/4=8,r:0 ; DIV:8/4=2,r:0 ; DIV:2/4=0,r:2 ; OUT:2000
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)
linear_equation_solving
linear_equation_solving:divide-then-subtract
7x+7=-35
7x+7=-35 ; x+1=-5 ; x=-5-1 ; x=-6
linear_equation_solving
linear_equation_solving:divide-then-subtract
9x+27=72
9x+27=72 ; x+3=8 ; x=8-3 ; x=5
list_summation
list_summation:right-to-left
9, 8, 0, 6
0+6=6 ; 8+6=14 ; 9+14=23
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,1) ; G=(3,3)
R:(2,2) ; R:(2,3) ; D:(3,3)
list_summation
list_summation:right-to-left
0, 4, 5, 0
5+0=5 ; 4+5=9 ; 0+9=9
base_conversion
base_conversion:repeated-division
n=201,base=16
DIV:201/16=12,r:9 ; DIV:12/16=0,r:12 ; OUT:C9
multidigit_addition
multidigit_addition:left-to-right-partials
404+423
p100:400+400=800 ; p10:0+20=20 ; p1:4+3=7 ; sum=800+20+7=827
base_conversion
base_conversion:decomposition
n=44,base=4
TERM:2*4^2=32 ; TERM:3*4^1=12 ; TERM:0*4^0=0 ; OUT:230
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,0) ; G=(5,2)
D:(2,0) ; D:(3,0) ; D:(4,0) ; D:(5,0) ; R:(5,1) ; R:(5,2)
list_summation
list_summation:left-to-right
4, 6, 9, 0
4+6=10 ; 10+9=19 ; 19+0=19
sorting_algorithms
sorting_algorithms:merge-sort
5, 3, 7, 0, 1
[3,5,7,0,1] ; [3,5,0,7,1] ; [0,3,5,7,1] ; [0,1,3,5,7]
base_conversion
base_conversion:decomposition
n=75,base=4
TERM:1*4^3=64 ; TERM:0*4^2=0 ; TERM:2*4^1=8 ; TERM:3*4^0=3 ; OUT:1023
linear_equation_solving
linear_equation_solving:subtract-then-divide
6x-12=-54
6x-12=-54 ; 6x=-42 ; x=-7
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,1) ; G=(3,2)
R:(2,2) ; D:(3,2)
base_conversion
base_conversion:decomposition
n=148,base=8
TERM:2*8^2=128 ; TERM:2*8^1=16 ; TERM:4*8^0=4 ; OUT:224
linear_equation_solving
linear_equation_solving:inverse-ops
4x+32=28
4x+32=28 ; x=(28-32)/4 ; x=-4/4 ; x=-1
list_summation
list_summation:left-to-right
0, 6, 1, 5
0+6=6 ; 6+1=7 ; 7+5=12
multidigit_addition
multidigit_addition:left-to-right-partials
431+394
p100:400+300=700 ; p10:30+90=120 ; p1:1+4=5 ; sum=700+120+5=825
list_summation
list_summation:left-to-right
0, 3, 3, 0
0+3=3 ; 3+3=6 ; 6+0=6
list_summation
list_summation:right-to-left
8, 2, 9, 1
9+1=10 ; 2+10=12 ; 8+12=20
multidigit_addition
multidigit_addition:rounding-decomposition
921+858
round:930+858=1788 ; adjust:1788-9=1779 ; sum=1779
multidigit_addition
multidigit_addition:left-to-right-partials
666+496
p100:600+400=1000 ; p10:60+90=150 ; p1:6+6=12 ; sum=1000+150+12=1162
sorting_algorithms
sorting_algorithms:bubble-sort
3, 1, 8, 4, 5
[1,3,8,4,5] ; [1,3,4,8,5] ; [1,3,4,5,8]
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,2) ; G=(4,5)
R:(0,3) ; D:(1,3) ; R:(1,4) ; D:(2,4) ; R:(2,5) ; D:(3,5) ; D:(4,5)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,2) ; G=(3,4)
R:(2,3) ; R:(2,4) ; D:(3,4)
linear_equation_solving
linear_equation_solving:inverse-ops
9x-81=-153
9x-81=-153 ; x=(-153--81)/9 ; x=-72/9 ; x=-8
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(2,2) ; G=(5,4)
R:(2,3) ; R:(2,4) ; D:(3,4) ; D:(4,4) ; D:(5,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(0,0) ; G=(3,5)
R:(0,1) ; D:(1,1) ; R:(1,2) ; D:(2,2) ; R:(2,3) ; D:(3,3) ; R:(3,4) ; R:(3,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(5,5)
D:(4,4) ; D:(5,4) ; R:(5,5)
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:inverse-ops
4x-4=0
4x-4=0 ; x=(0--4)/4 ; x=4/4 ; x=1
multidigit_addition
multidigit_addition:rounding-decomposition
936+519
round:940+519=1459 ; adjust:1459-4=1455 ; sum=1455
list_summation
list_summation:pairwise
1, 4, 1, 5
1+4=5 ; 1+5=6 ; 5+6=11
list_summation
list_summation:left-to-right
0, 1, 0, 8
0+1=1 ; 1+0=1 ; 1+8=9
multidigit_addition
multidigit_addition:rounding-decomposition
555+167
round:560+167=727 ; adjust:727-5=722 ; sum=722
list_summation
list_summation:right-to-left
7, 2, 3, 5
3+5=8 ; 2+8=10 ; 7+10=17
base_conversion
base_conversion:decomposition
n=123,base=2
TERM:1*2^6=64 ; TERM:1*2^5=32 ; TERM:1*2^4=16 ; TERM:1*2^3=8 ; TERM:0*2^2=0 ; TERM:1*2^1=2 ; TERM:1*2^0=1 ; OUT:1111011
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(4,1)
R:(2,1) ; D:(3,1) ; D:(4,1)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(2,0) ; G=(5,2)
R:(2,1) ; D:(3,1) ; R:(3,2) ; D:(4,2) ; D:(5,2)
sorting_algorithms
sorting_algorithms:bubble-sort
4, 1, 2, 5, 6
[1,4,2,5,6] ; [1,2,4,5,6]
list_summation
list_summation:right-to-left
7, 4, 8, 9
8+9=17 ; 4+17=21 ; 7+21=28
sorting_algorithms
sorting_algorithms:heap-sort
4, 2, 1, 9, 5
[4,9,1,2,5] ; [9,4,1,2,5] ; [9,5,1,2,4] ; [4,5,1,2,9] ; [5,4,1,2,9] ; [2,4,1,5,9] ; [4,2,1,5,9] ; [1,2,4,5,9] ; [2,1,4,5,9] ; [1,2,4,5,9]
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(2,5)
D:(2,2) ; R:(2,3) ; R:(2,4) ; R:(2,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(1,2) ; G=(4,4)
D:(2,2) ; D:(3,2) ; D:(4,2) ; R:(4,3) ; R:(4,4)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,3) ; G=(4,4)
R:(3,4) ; D:(4,4)
sorting_algorithms
sorting_algorithms:heap-sort
2, 3, 7, 0, 5
[2,5,7,0,3] ; [7,5,2,0,3] ; [3,5,2,0,7] ; [5,3,2,0,7] ; [0,3,2,5,7] ; [3,0,2,5,7] ; [2,0,3,5,7] ; [0,2,3,5,7]
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)
grid_pathfinding
grid_pathfinding:right-first
grid=6 ; S=(3,1) ; G=(5,3)
R:(3,2) ; R:(3,3) ; D:(4,3) ; D:(5,3)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(4,5)
D:(4,4) ; R:(4,5)
linear_equation_solving
linear_equation_solving:divide-then-subtract
4x+32=56
4x+32=56 ; x+8=14 ; x=14-8 ; x=6
list_summation
list_summation:left-to-right
0, 7, 9, 7
0+7=7 ; 7+9=16 ; 16+7=23
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,1) ; G=(5,5)
D:(4,1) ; D:(5,1) ; R:(5,2) ; R:(5,3) ; R:(5,4) ; R:(5,5)
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(3,4) ; G=(4,5)
D:(4,4) ; R:(4,5)
list_summation
list_summation:right-to-left
0, 0, 6, 8
6+8=14 ; 0+14=14 ; 0+14=14
sorting_algorithms
sorting_algorithms:bubble-sort
8, 7, 9, 6, 1
[7,8,9,6,1] ; [7,8,6,9,1] ; [7,8,6,1,9] ; [7,6,8,1,9] ; [7,6,1,8,9] ; [6,7,1,8,9] ; [6,1,7,8,9] ; [1,6,7,8,9]
list_summation
list_summation:pairwise
7, 4, 2, 5
7+4=11 ; 2+5=7 ; 11+7=18
base_conversion
base_conversion:repeated-division
n=67,base=16
DIV:67/16=4,r:3 ; DIV:4/16=0,r:4 ; OUT:43
grid_pathfinding
grid_pathfinding:down-first
grid=6 ; S=(4,3) ; G=(5,4)
D:(5,3) ; R:(5,4)
grid_pathfinding
grid_pathfinding:alternating
grid=6 ; S=(4,2) ; G=(5,3)
R:(4,3) ; D:(5,3)
multidigit_addition
multidigit_addition:left-to-right-partials
554+163
p100:500+100=600 ; p10:50+60=110 ; p1:4+3=7 ; sum=600+110+7=717
list_summation
list_summation:right-to-left
7, 2, 8, 8
8+8=16 ; 2+16=18 ; 7+18=25
linear_equation_solving
linear_equation_solving:subtract-then-divide
7x-21=-35
7x-21=-35 ; 7x=-14 ; x=-2
list_summation
list_summation:right-to-left
1, 8, 2, 9
2+9=11 ; 8+11=19 ; 1+19=20
linear_equation_solving
linear_equation_solving:subtract-then-divide
8x-24=-24
8x-24=-24 ; 8x=0 ; x=0
linear_equation_solving
linear_equation_solving:subtract-then-divide
9x+72=63
9x+72=63 ; 9x=-9 ; x=-1
linear_equation_solving
linear_equation_solving:inverse-ops
9x+63=-18
9x+63=-18 ; x=(-18-63)/9 ; x=-81/9 ; x=-9