Input: Two binary numbers, separated by "+" Output: Sum of two numbers Constraint: 1 <= binary number length <= 5 Difference: binary number may starts with 0 I'm not sure the least lines, if you get the answer, please tell me. Current best is by カズエイ.
125 Steam results · Checked
Input: A string of "a", "b" and "c". Output: Double each "a". Swap "b" and "c". Constraint: 1 <= Input length <= 7
Input: A string of "a", "b" and "c". Output: The number of characters in this string in binary representation. Constraint: Input length >= 1
Input: A string of "a", "b" and "c". Output: Replace each "a" with "b". Constraint: 1 <= Input length <= 7
Input: A string of "R", "G" and "B". Output: A coloured triangle is created from a row of colours, each of which is red, green or blue. Successive rows, each containing one fewer colour than the last, are generated by considering the two touching colours i
Input: A string of "a", "b" and "c". Output: if there are three or more of a kind in a row, remove them. Constraint: 1 <= Input length <= 7
Input: A string of "". Output: Check if the input is a legal parenthesized string. I.e, every "" after it.
Input: A binary integer greater than 1. Output: Its binary prime factors in ascending order, separated by commas. Constraint: 2 <= Input number <= 100
Input: Nested lists consisting of "" Output: Maximum list depth as a decimal number Constraint: 1 <= depth <= 4
Input: Roll seven dice. Output: Return true if "pangu project" (sum = 40) is accessible, else return false.
Input: Two strings of "a". Output: The longest string of "a". Constraint: Each string is 1 <= length <= 10
Input: A decimal number: N. Output: N/2. Constraint: 1 <= N <= 999