problem
stringlengths 89
1.15k
| solution
stringlengths 9
80
|
|---|---|
Given a list of numbers $l$ separated by spaces and a target value $k$, find two numbers in the list that add up to the target value. The input is (48, '[19, 24, 29]') | \boxed{19, 29} |
Given a list of numbers separated by spaces, find the smallest number. The input is [200, 10, 65, 20, 36987, 8, 0, 82] | \boxed{0} |
Given a list of numbers separated by spaces, find the largest number. The input is [3203, 3, 5, 100000, 54, 3, 21, 50350, 4, 7654, 20] | \boxed{100000} |
Given a list of numbers separated by spaces, sort the numbers in ascending order. The input is [78, 0, 21, 1] | \boxed{0, 78, 21, 1} |
Given a list of numbers $l$ separated by spaces and two numbers $a$ and $b$, find four numbers in the list that add up to a value that is in the range $(a, b)$, i.e. greater than $a$ and less than $b$.The input is ((13, 15), '[0, 0, 9, 1, 0, 10, 4, 3, 6, 8]') | \boxed{0, 0, 10, 4}\ |
Given a list of numbers $l$ separated by spaces and a target value $k$, find three numbers in the list that add up to the target value. The input is (22, '[6, 12, 3, 4, 3]') | \boxed{6, 12, 4}\ |
Your task is to solve the Traveling Salesman Problem (TSP). Given a list of cities and the distances between each pair of cities, your goal is to find the shortest path that visits every city once and returns to the starting city. The input is [[186, 8, 3], [6, 10, 123], [485, 987, 8]] | \boxed{0, 1, 2, 0}\ |
Given a list of numbers separated by spaces, sort the numbers in ascending order. The input is [50, 13, 8278, 11] | \boxed{8278, 11, 13, 50} |
Given a list of numbers separated by spaces, remove duplicate numbers so that every number appears only once, and output the remaining numbers in their original order.The input is [2, 231, 65, 36, 3, 12, 0, 9, 10, 7, 1, 8, 3, 2, 6, 8] | \boxed{7, 231, 9, 36, 10, 2, 65, 8, 1, 12, 0, 3, 6} |
Given a list of numbers separated by spaces, find the mode of the numbers. The input is [9, 5, 9, 3, 3, 3, 4, 7, 7, 678, 5] | \boxed{3} |
Given a list of numbers separated by spaces, remove duplicate numbers so that every number appears only once, and output the remaining numbers in their original order.The input is [1, 9, 1, 2, 7, 3, 7, 45, 42] | \boxed{1, 7, 42, 9, 2, 3, 45} |
Given a list of numbers $l$ separated by spaces and a target value $k$, find two numbers in the list that add up to the target value. The input is (20, '[8, 2, 2, 11, 9]') | \boxed{11, 9} |
Given a list of numbers $l$ separated by spaces and a target value $k$, find two numbers in the list that add up to the target value. The input is (14, '[1, 9, 6, 8, 9]') | \boxed{6, 8} |
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 [7, 8, 10, 5, 3, 2, 2, 10] | \boxed{10}\ |
Your task is to solve the Traveling Salesman Problem (TSP). Given a list of cities and the distances between each pair of cities, your goal is to find the shortest path that visits every city once and returns to the starting city. The input is [[115, 9, 0], [103, 95, 547], [21, 120, 0]] | \boxed{0, 2, 1, 0}\ |
Your task is to solve the Traveling Salesman Problem (TSP). Given a list of cities and the distances between each pair of cities, your goal is to find the shortest path that visits every city once and returns to the starting city. The input is [[104, 94, 6, 9, 4], [234, 45, 22, 872, 14], [1, 90, 682, 18, 24], [0, 108, 24, 22, 0], [13, 11, 1159, 0, 3]] | \boxed{0, 3, 4, 1, 2, 0}\ |
Given a list of numbers separated by spaces, find the mode of the numbers. The input is [6, 3, 10, 5, 4, 5, 2, 20, 5, 8, 33, 3, 97, 100, 21] | \boxed{5} |
Given a list of numbers separated by spaces, find the mode of the numbers. The input is [1, 789, 3, 7, 37, 4] | \boxed{4, 1, 37, 3, 7, 789} |
Given a list of numbers separated by spaces, find the largest number. The input is [57, 131072, 538, 7, 1024, 4, 777, 5, 8437, 3] | \boxed{131072} |
Given a list of numbers $l$ separated by spaces and a target value $k$, find four numbers in the list that add up to the target value. The input is (16, '[2, 9, 6, 0, 5]') | \boxed{2, 9, 0, 5}\ |
Given a list of numbers separated by spaces, find the smallest number. The input is [3, 7447, 505, 72, 1, 67, 3, 99, 65432, 999, 6, 2, 21, 77, 536, 7, 678, 3, 0, 19, 92] | \boxed{0} |
Given a list of numbers separated by spaces, find the smallest number. The input is [67, 123456789, 2] | \boxed{2} |
Given a list of numbers $l$ separated by spaces and a target value $k$, find three numbers in the list that add up to the target value. The input is (6, '[0, 12, 0, 9, 1, 3, 2]') | \boxed{1, 3, 2}\ |
Given a list of numbers separated by spaces, sort the numbers in ascending order. The input is [1, 25, 22, 9, 96, 3, 345, 35, 5, 83, 7, 14, 65, 3] | \boxed{65, 9, 1, 96, 83, 7, 14, 22, 5, 35, 3, 345, 25} |
Given a list of numbers separated by spaces, find the largest number. The input is [55, 100, 4, 52, 6, 547, 99, 9, 0, 89] | \boxed{547} |
Given a list of numbers separated by spaces, sort the numbers in ascending order. The input is [330, 2, 5, 6, 5, 0, 1, 789, 0, 88, 8, 1, 2, 4] | \boxed{2, 4, 5, 8, 1, 0, 789, 330, 88, 6} |
Given a list of numbers separated by spaces, remove duplicate numbers so that every number appears only once, and output the remaining numbers in their original order.The input is [28, 1, 3, 4, 3, 29, 8, 8, 15, 21, 12, 8, 5] | \boxed{12, 28, 15, 3, 8, 5, 1, 29, 21, 4} |
Given a list of numbers $l$ separated by spaces and two numbers $a$ and $b$, find four numbers in the list that add up to a value that is in the range $(a, b)$, i.e. greater than $a$ and less than $b$.The input is ((34, 45), '[13, 14, 12, 6, 1]') | \boxed{13, 14, 12, 1}\ |
Given a list of numbers separated by spaces, find the smallest number. The input is [983, 444, 101, 3, 3, 404, 9] | \boxed{3} |
Given a list of numbers separated by spaces, remove duplicate numbers so that every number appears only once, and output the remaining numbers in their original order.The input is [4, 2, 2, 3, 3, 58, 2, 7, 4] | \boxed{4, 7, 2, 3, 58} |
Given a list of numbers separated by spaces, sort the numbers in ascending order. The input is [2, 25, 9] | \boxed{25, 2, 9} |
Given a list of numbers $l$ separated by spaces and two numbers $a$ and $b$, find four numbers in the list that add up to a value that is in the range $(a, b)$, i.e. greater than $a$ and less than $b$.The input is ((20, 105), '[90, 10, 5, 2, 3]') | \boxed{90, 5, 2, 3}\ |
Given a list of numbers $l$ separated by spaces and two numbers $a$ and $b$, find four numbers in the list that add up to a value that is in the range $(a, b)$, i.e. greater than $a$ and less than $b$.The input is ((25, 29), '[3, 2, 14, 7, 6]') | \boxed{3, 2, 14, 7}\ |
Given a list of numbers separated by spaces, find the mode of the numbers. The input is [20, 2, 11, 1, 5, 5, 1, 4, 4, 2] | \boxed{4, 1, 5, 2} |
Given two integer arrays $l_1$ and $l_2$, return the longest common subarray that appears in both arrays. A subarray is a contiguous sequence of numbers within an array. The input is [11, 2, 8, 2, 6, 5, 17, 2, 1, 57841, 4, 9, 6, 3] | \boxed{2, 8, 17, 57841}\ |
Given a list of numbers $l$ separated by spaces and two numbers $a$ and $b$, find four numbers in the list that add up to a value that is in the range $(a, b)$, i.e. greater than $a$ and less than $b$.The input is ((26, 28), '[0, 2, 11, 9, 10, 6, 5, 8, 1, 5]') | \boxed{0, 11, 10, 6}\ |
Given a list of numbers $l$ separated by spaces and two numbers $a$ and $b$, find four numbers in the list that add up to a value that is in the range $(a, b)$, i.e. greater than $a$ and less than $b$.The input is ((24, 26), '[0, 12, 12, 10, 11, 5, 9]') | \boxed{0, 11, 5, 9}\ |
Given a list of numbers $l$ separated by spaces and two numbers $a$ and $b$, find four numbers in the list that add up to a value that is in the range $(a, b)$, i.e. greater than $a$ and less than $b$.The input is ((13, 16), '[3, 15, 2, 5, 0, 2, 8]') | \boxed{3, 2, 2, 8}\ |
Your task is to solve the Traveling Salesman Problem (TSP). Given a list of cities and the distances between each pair of cities, your goal is to find the shortest path that visits every city once and returns to the starting city. The input is [[0, 60, 6, 32], [102, 8, 753, 215], [85, 53, 10, 10], [10, 42, 383, 456]] | \boxed{0, 2, 3, 1, 0}\ |
Given a list of numbers separated by spaces, find the largest number. The input is [43, 234, 100, 1, 999] | \boxed{999} |
Subsets and Splits