Question:
Given a String s of randomly-shuffled numbers from m to n such that -100,000 <= m < n < 1E9, your job is to find the number that is missing from the group. Note that the string can be (and generally is) randomly-generated/constructed, and the below cases are only an example of what that...
Ken Iverson, 1920–2020
Let's implement his favourite expression:
Given a row of Pascal's triangle, compute the next row.
This can for example be computed by taking the input padded with a zero on the left, and the input padded with a zero on the right, and then adding the two element...
Inspired by what I'm doing at work right now.
Your program should take one parameter, the path to the file
It should convert all the windows style newlines (\r\n) to unix style (\n) and write the result back to the file
Input: binary string
Output: binary string that represents the binary input + 1
Example: Given 10111 as an input, output 11000
Limitations: Can't use arithmetic operators or functions
I will preface this by saying that I made this for fun; I have absolutely no formal knowledge on cryptography or error correction. Do not use this algorithm in anything remotely important.
I was kind of bored a few days ago, so I decided to write a simple function to take some data and return an ...
Inspired by this challenge about creating a "Hello, world!" program which the npm tool sloc considers to have no lines of code, I thought it would be interesting to have a quine challenge around the same idea.
Quoting directly from the previous challenge,
NPM's sloc is a moderately popular tool ...
It's a well-known fact that Fermat's Last Theorem is true. More specifically, that for any integer \$n \ge 2\$, there are no three integers \$a, b, c\$ such that
$$a^n + b^n = c^n$$
However, there are a number of near misses. For example,
$$6^3 + 8^3 = 9^3 - 1$$
We'll call a triple of integers \$...
