0
Consider the following process:
Take some non-negative integer N.
e.g. N = 571
Express it in binary with no leading zeroes. (Zero itself is the only exception, becoming 0.)
e.g. 571 = 1000111011 in binary
Break apart consecutive runs of ones and zeroes in this binary representation.
e.g. 100...
CJam, 73 bytes
0ri:Re!Rm*{:Tz0=R,=[R,Te_]m!{~ff{T==}e_}/=&},{:T,e!{:PPff{T==P#}}%$}%Q|,+
The time complexity of the above code is worse than O(n!n).
Input n=4 is already to much for the online interpreter.
Using the Java interpreter, input n=5 could be possible, if you have enough RAM and pa...
Machine Learning
I want to see how well you can build a simple AI that learns.
The challenge is to create a program which:
(1) outputs 20 integers (1 at a time) and waits for input after each.
The input given will be 1 or 0 depending on whether the number is "good" or "bad" based on a predet...
Your task is to create an interpreter for a calculator. It has to parse commands like 5 + 5 and return the answer.
It has to be able to add, subtract, multiply, and divide. The interpreter only needs to accept two numbers (ex. 9 * 5 and 3 + 3)
Examples:
Input: 5 * 5
Output: 25
Input: 8 /...
Suppose I have an array {1, 2, 5, 4} and m = 3.
I need to find:
1*2*5 + 1*2*4 + 1*5*4 + 2*5*4
i.e Sum of multiplication of all combination of m element from an array of n elements.
Note i need to find for m=2,3,4. i.e. from m = 2 to n.
One of the solution possible is to find all combination a...
