Dataset Viewer
Auto-converted to Parquet Duplicate
messages
listlengths
1
1
ground_truth
stringlengths
3
6
dataset
stringclasses
1 value
[ { "content": "In a 34x36 grid, how many different paths are there from the bottom left (0, 0) to the top right (33, 35), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (23, 1), (19, 31), (4, 3), (30, 16), (18, 17), (20, 10), (9, 15), (2...
777600
MATH
[ { "content": "In a 37x30 grid, how many different paths are there from the bottom left (0, 0) to the top right (36, 29), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (32, 21), (11, 1), (30, 16), (19, 26), (32, 26), (25, 6), (11, 22), ...
976200
MATH
[ { "content": "In a 35x38 grid, how many different paths are there from the bottom left (0, 0) to the top right (34, 37), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (23, 18), (22, 37), (10, 15), (27, 33), (29, 14), (4, 20), (16, 22),...
543244
MATH
[ { "content": "In a 39x34 grid, how many different paths are there from the bottom left (0, 0) to the top right (38, 33), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (33, 4), (22, 12), (2, 13), (6, 1), (26, 26), (5, 20), (24, 8), (5, ...
25632
MATH
[ { "content": "In a 36x38 grid, how many different paths are there from the bottom left (0, 0) to the top right (35, 37), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (22, 25), (6, 25), (25, 17), (26, 3), (13, 30), (27, 36), (7, 30), (...
792000
MATH
[ { "content": "In a 35x37 grid, how many different paths are there from the bottom left (0, 0) to the top right (34, 36), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (0, 25), (23, 6), (25, 18), (5, 5), (9, 5), (25, 11), (22, 36), (6, ...
657660
MATH
[ { "content": "In a 39x32 grid, how many different paths are there from the bottom left (0, 0) to the top right (38, 31), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (16, 4), (2, 5), (6, 29), (13, 10), (28, 15), (19, 18), (38, 1), (3,...
766080
MATH
[ { "content": "In a 33x38 grid, how many different paths are there from the bottom left (0, 0) to the top right (32, 37), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (11, 3), (14, 24), (1, 11), (24, 16), (9, 31), (31, 32), (12, 32), (...
838200
MATH
[ { "content": "In a 33x32 grid, how many different paths are there from the bottom left (0, 0) to the top right (32, 31), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (3, 0), (19, 19), (16, 10), (14, 3), (3, 31), (20, 29), (16, 28), (2...
949536
MATH
[ { "content": "In a 37x35 grid, how many different paths are there from the bottom left (0, 0) to the top right (36, 34), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (13, 14), (19, 30), (22, 29), (15, 17), (33, 24), (24, 2), (18, 16),...
677160
MATH
[ { "content": "In a 36x32 grid, how many different paths are there from the bottom left (0, 0) to the top right (35, 31), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (2, 30), (17, 22), (22, 16), (20, 7), (8, 10), (1, 26), (17, 26), (2...
277992
MATH
[ { "content": "In a 35x31 grid, how many different paths are there from the bottom left (0, 0) to the top right (34, 30), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (0, 8), (8, 4), (20, 9), (19, 13), (12, 27), (34, 26), (25, 20), (32...
660504
MATH
[ { "content": "In a 35x31 grid, how many different paths are there from the bottom left (0, 0) to the top right (34, 30), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (32, 17), (10, 5), (20, 3), (24, 18), (25, 23), (7, 14), (2, 29), (6...
738576
MATH
[ { "content": "In a 36x33 grid, how many different paths are there from the bottom left (0, 0) to the top right (35, 32), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (29, 11), (5, 23), (24, 3), (20, 11), (29, 26), (20, 7), (12, 0), (1...
767760
MATH
[ { "content": "In a 38x30 grid, how many different paths are there from the bottom left (0, 0) to the top right (37, 29), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (37, 6), (37, 16), (37, 13), (37, 15), (20, 15), (11, 18), (31, 12),...
748440
MATH
[ { "content": "In a 32x33 grid, how many different paths are there from the bottom left (0, 0) to the top right (31, 32), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (28, 28), (16, 16), (22, 16), (26, 16), (20, 7), (18, 8), (22, 31), ...
601600
MATH
[ { "content": "In a 36x32 grid, how many different paths are there from the bottom left (0, 0) to the top right (35, 31), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (3, 20), (35, 26), (14, 4), (14, 11), (13, 25), (33, 14), (11, 6), (...
476196
MATH
[ { "content": "In a 37x32 grid, how many different paths are there from the bottom left (0, 0) to the top right (36, 31), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (17, 23), (30, 29), (20, 29), (36, 9), (18, 11), (16, 26), (27, 2), ...
402300
MATH
[ { "content": "In a 36x30 grid, how many different paths are there from the bottom left (0, 0) to the top right (35, 29), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (35, 6), (12, 22), (32, 23), (4, 1), (12, 7), (21, 9), (30, 22), (9,...
850432
MATH
[ { "content": "In a 32x33 grid, how many different paths are there from the bottom left (0, 0) to the top right (31, 32), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (15, 30), (18, 4), (19, 13), (29, 25), (4, 6), (18, 25), (20, 19), (...
490960
MATH
[ { "content": "In a 35x37 grid, how many different paths are there from the bottom left (0, 0) to the top right (34, 36), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (5, 15), (17, 22), (26, 28), (27, 12), (30, 14), (18, 20), (6, 4), (...
944748
MATH
[ { "content": "In a 31x34 grid, how many different paths are there from the bottom left (0, 0) to the top right (30, 33), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (28, 27), (26, 18), (27, 30), (11, 3), (4, 26), (11, 15), (16, 1), (...
293876
MATH
[ { "content": "In a 30x37 grid, how many different paths are there from the bottom left (0, 0) to the top right (29, 36), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (7, 1), (13, 31), (10, 24), (7, 11), (5, 28), (27, 35), (29, 10), (1...
987840
MATH
[ { "content": "In a 37x33 grid, how many different paths are there from the bottom left (0, 0) to the top right (36, 32), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (2, 32), (1, 2), (0, 30), (1, 28), (20, 13), (15, 24), (1, 27), (19,...
623700
MATH
[ { "content": "In a 33x34 grid, how many different paths are there from the bottom left (0, 0) to the top right (32, 33), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (25, 22), (20, 23), (20, 6), (3, 20), (28, 17), (8, 16), (30, 20), (...
864000
MATH
[ { "content": "In a 35x32 grid, how many different paths are there from the bottom left (0, 0) to the top right (34, 31), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (20, 13), (10, 26), (9, 31), (21, 17), (19, 5), (9, 29), (29, 18), (...
724356
MATH
[ { "content": "In a 34x36 grid, how many different paths are there from the bottom left (0, 0) to the top right (33, 35), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (18, 14), (23, 28), (27, 19), (30, 15), (29, 20), (25, 31), (2, 34),...
795600
MATH
[ { "content": "In a 38x33 grid, how many different paths are there from the bottom left (0, 0) to the top right (37, 32), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (33, 21), (6, 1), (2, 4), (36, 25), (12, 16), (17, 15), (5, 12), (24...
303744
MATH
[ { "content": "In a 35x37 grid, how many different paths are there from the bottom left (0, 0) to the top right (34, 36), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (31, 25), (4, 22), (33, 23), (9, 8), (23, 22), (1, 11), (4, 19), (8,...
691200
MATH
[ { "content": "In a 36x33 grid, how many different paths are there from the bottom left (0, 0) to the top right (35, 32), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (33, 5), (28, 4), (20, 22), (4, 32), (34, 28), (3, 17), (16, 29), (0...
720450
MATH
[ { "content": "In a 39x33 grid, how many different paths are there from the bottom left (0, 0) to the top right (38, 32), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (24, 9), (38, 29), (0, 2), (33, 17), (2, 32), (14, 30), (6, 32), (6,...
706640
MATH
[ { "content": "In a 30x32 grid, how many different paths are there from the bottom left (0, 0) to the top right (29, 31), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (14, 13), (26, 27), (19, 12), (23, 10), (16, 24), (1, 21), (1, 4), (...
867672
MATH
[ { "content": "In a 38x30 grid, how many different paths are there from the bottom left (0, 0) to the top right (37, 29), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (15, 18), (22, 5), (7, 25), (34, 13), (20, 1), (11, 3), (25, 16), (8...
967680
MATH
[ { "content": "In a 36x31 grid, how many different paths are there from the bottom left (0, 0) to the top right (35, 30), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (25, 9), (10, 9), (12, 11), (19, 20), (4, 10), (28, 20), (35, 24), (...
209916
MATH
[ { "content": "In a 37x31 grid, how many different paths are there from the bottom left (0, 0) to the top right (36, 30), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (11, 1), (25, 22), (5, 12), (36, 12), (24, 9), (6, 22), (23, 14), (8...
943488
MATH
[ { "content": "In a 30x38 grid, how many different paths are there from the bottom left (0, 0) to the top right (29, 37), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (22, 16), (1, 3), (10, 26), (11, 28), (24, 28), (21, 28), (1, 18), (...
239184
MATH
[ { "content": "In a 30x39 grid, how many different paths are there from the bottom left (0, 0) to the top right (29, 38), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (7, 36), (25, 28), (19, 14), (0, 27), (5, 10), (3, 0), (6, 30), (7, ...
823680
MATH
[ { "content": "In a 38x38 grid, how many different paths are there from the bottom left (0, 0) to the top right (37, 37), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (34, 30), (32, 12), (15, 31), (21, 23), (28, 36), (4, 19), (20, 37),...
391680
MATH
[ { "content": "In a 39x34 grid, how many different paths are there from the bottom left (0, 0) to the top right (38, 33), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (11, 5), (14, 21), (35, 21), (0, 21), (24, 24), (18, 20), (12, 30), ...
742400
MATH
[ { "content": "In a 30x32 grid, how many different paths are there from the bottom left (0, 0) to the top right (29, 31), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (13, 27), (29, 3), (24, 27), (21, 24), (4, 6), (9, 24), (8, 4), (2, ...
921600
MATH
[ { "content": "In a 31x33 grid, how many different paths are there from the bottom left (0, 0) to the top right (30, 32), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (7, 20), (7, 2), (11, 31), (14, 24), (16, 7), (30, 31), (4, 2), (30,...
555738
MATH
[ { "content": "In a 35x37 grid, how many different paths are there from the bottom left (0, 0) to the top right (34, 36), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (11, 12), (1, 5), (18, 14), (12, 15), (31, 3), (24, 32), (29, 31), (...
449280
MATH
[ { "content": "In a 34x33 grid, how many different paths are there from the bottom left (0, 0) to the top right (33, 32), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (16, 26), (13, 21), (1, 4), (26, 14), (24, 10), (18, 27), (13, 20), ...
642024
MATH
[ { "content": "In a 31x31 grid, how many different paths are there from the bottom left (0, 0) to the top right (30, 30), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (4, 5), (29, 14), (19, 30), (28, 9), (13, 6), (3, 26), (18, 14), (12...
891000
MATH
[ { "content": "In a 34x38 grid, how many different paths are there from the bottom left (0, 0) to the top right (33, 37), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (13, 30), (11, 5), (6, 13), (21, 33), (30, 14), (24, 4), (17, 15), (...
967104
MATH
[ { "content": "In a 39x30 grid, how many different paths are there from the bottom left (0, 0) to the top right (38, 29), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (28, 2), (11, 22), (23, 25), (27, 17), (33, 26), (22, 26), (13, 21),...
8704
MATH
[ { "content": "In a 39x36 grid, how many different paths are there from the bottom left (0, 0) to the top right (38, 35), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (4, 16), (12, 3), (12, 25), (3, 13), (12, 22), (34, 1), (6, 9), (13,...
634368
MATH
[ { "content": "In a 31x38 grid, how many different paths are there from the bottom left (0, 0) to the top right (30, 37), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (5, 13), (13, 27), (11, 2), (9, 7), (9, 36), (14, 34), (5, 30), (13,...
918000
MATH
[ { "content": "In a 31x35 grid, how many different paths are there from the bottom left (0, 0) to the top right (30, 34), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (12, 18), (25, 25), (5, 19), (20, 21), (15, 6), (6, 6), (24, 13), (1...
758160
MATH
[ { "content": "In a 39x39 grid, how many different paths are there from the bottom left (0, 0) to the top right (38, 38), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (14, 3), (6, 34), (13, 33), (38, 5), (9, 15), (29, 13), (26, 10), (1...
467808
MATH
[ { "content": "In a 31x38 grid, how many different paths are there from the bottom left (0, 0) to the top right (30, 37), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (6, 20), (23, 22), (12, 15), (21, 24), (29, 20), (22, 35), (22, 17),...
535248
MATH
[ { "content": "In a 39x31 grid, how many different paths are there from the bottom left (0, 0) to the top right (38, 30), if you can only move right or up at each step, subject to the constraint that you cannot move through the following cells: (24, 16), (33, 2), (25, 8), (31, 22), (10, 24), (11, 22), (22, 0), (...
399360
MATH
End of preview. Expand in Data Studio

No dataset card yet

Downloads last month
13