-3
0
Q: Every positive integer is the sum of 3 palindromes, how to find the value of D in the Algorithms?
I have read the paper explaining the sum of all possible integers is 3 palindromes, but one thing still puzzles me. How do you find the value of D used in the algorithms? I tried some things but since it is only mentioned in one little part it doesn’t make much sense to me. Am I just being stupid...
SSD optimize
Given \$n\$ pages, each page containing \$m\$ sectors, write three functions: (Here x and y are sectors)
insert(x) that stores the input(temporary sector) into a sector,
remove(x) that removes one, and
get(x) that return a sector containing the element.
You can call these functions...
26
The challenge is to calculate the digit sum of the factorial of a number.
Example
Input: 10
Output: 27
10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,
and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27
You can expect the input to be an integer above 0.
Output can be of...
McCarthy's 1959 LISP
In early 1959, John McCarthy wrote a groundbreaking paper defining just nine primitive functions that when put together still form the basis for all LISP-like languages today. The paper is available digitized here:
http://www-formal.stanford.edu/jmc/recursive.pdf
Your job...
0
0
0
You're playing rock paper scissors against a computer... except it's really smart and always wins!
Reference implementation in Python:
print("rock paper scissors")
rps=input('type "rock", "paper", or "scissors"')
if rps=="rock":
print("paper, you lose")
if rps=="paper":
print("scissors, you lose
For example, given 3 sets of parenthesis, you have:
()()()
((()))
()(())
(())()
(()())
= 5 possible combinations.
Challenge
Program must:
• Take 1 number as an input
• Return one output, the number of possible combinations of parenthesis sets
Shortest number of bytes wins
