The Binet formula is a closed form expression for the \$n\$'th Fibonacci number:
$$F_n = \frac {\phi^n - (1-\phi)^n} {\sqrt 5}$$
where \$\phi = \frac {1 + \sqrt 5} 2\$ is the golden ratio. This formula works even when \$n\$ is negative or rational, and so can be a basis to calculating "complex Fi...
Take the string abcdfghjk. To overwrite it, starting from f, with the string efgh, you would continue along the original, replacing each character with the one from the replacement string. The result would be abcdefghk.
Now, consider a string which would be too long to fit, like efghijkl. Startin...
Trying to figure out how to get the minimum and maximum arrays with the names displayed next to them. Also trying to have them in descending order. Thanks for the help!
#include
#include
using namespace std;
int main()
{
int sum = 0;
int myScore[2];
string myName[2];
int i, k;
int avg;
int max ...
Create the shortest program or function that finds the factorial of a non-negative integer.
The factorial, represented with ! is defined as such
$$n!:=\begin{cases}1 & n=0\\n\cdot(n-1)!&n>0\end{cases}$$
In plain English the factorial of 0 is 1 and the factorial of n, where n is larger than 0 i...
Python - 54 bytes
n=int(input())
j=1
i=1
while i <= n:
j*=i
i+=1
print(j)
This calculated n=125 very quickly. so I'm confident it works. Multiplies the return value of j (why am I saying return lol) by i as i ranges from 1 to n, and can even do 0!
Each term in the squaring sequence, \$x_n\$, is created by taking \$x_{n-1}\$, squaring it, and removing all but the first four digits.
The sequence always begins with \$x_1 = 1111\$. Squaring this yields \$1234321\$, so \$x_2 = 1234\$
The first few terms are:
1111
1234
1522
2316
5363
...
The C...
