problem
stringlengths
7
1.15k
solution
stringlengths
8
243
Given a list of numbers separated by spaces, sort the numbers in ascending order. The input is [3, 24, 45, 6, 50, 302]
\boxed{6, 302, 24, 50, 3, 45}
Given a list of numbers $l$ separated by spaces and two numbers $a$ and $b$, find a subset in the list that adds up to a value that is in the range $(a, b)$, i.e. greater than $a$ and less than $b$. The input is ((43, 45), '[5, 1, 2, 0, 13, 7, 11, 2, 9]')
\boxed{2, 2, 7, 9, 11, 13}\
Given a list of numbers separated by spaces, sort the numbers in ascending order. The input is [0, 11, 95953]
\boxed{11, 0, 95953}
Given a list of numbers separated by spaces, sort the numbers in ascending order. The input is [9, 543, 4, 54, 9, 1, 0, 9, 14, 1, 89, 1, 0, 55, 202, 10, 81, 5, 6, 5, 23, 10, 7, 67, 0, 13, 0, 0, 62, 8, 50, 24, 0, 2, 8, 4, 3, 8278, 33, 2, 7, 0, 88, 134, 0, 9, 6, 555, 1, 11, 0, 2, 0, 9, 8, 6693, 1, 54, 7, 7, 61, 0, 4, 68683, 5, 3, 7, 0, 0, 1, 9, 0]
\boxed{555, 61, 11, 68683, 9, 2, 81, 8, 55, 54, 8278, 67, 62, 0, 3, 50, 23, 134, 88, 7, 543, 6, 89, 33, 24, 1, 5, 10, 14, 4, 6693, 202, 13}
Given a list of numbers separated by spaces, find a subset in the list that adds up to be a multiple of 10. The input is [36, 5, 3, 4, 7, 1]
\boxed{3, 7}\
Given a list of numbers separated by spaces, sort the numbers in ascending order. The input is [1, 67, 4, 1, 1, 3, 21, 6, 63, 0, 7, 50, 5, 73, 2, 123, 5, 27, 1, 100, 10, 99, 2, 7, 1, 1, 5, 0, 3, 2, 42, 9, 4, 14, 12, 97, 8, 3, 1, 2, 47465, 13, 1, 4, 4479, 78, 12, 43, 87654, 3, 0, 0, 8, 5, 2, 90, 28, 6, 90, 6, 28, 4, 2, 2, 1, 99999, 99, 3, 1, 5, 72, 0, 9, 1000, 45, 1, 0, 98, 20, 75, 500, 3, 43, 0, 15, 8, 16, 6, 2, 1, 7, 7, 0, 64, 100, 1]
\boxed{1000, 78, 20, 100, 50, 67, 99999, 43, 75, 90, 6, 99, 97, 63, 45, 27, 0, 42, 4479, 2, 500, 5, 3, 64, 28, 16, 72, 47465, 4, 123, 1, 98, 73, 15, 12, 9, 87654, 21, 8, 13, 14, 7, 10}