using namespace std;
int s = 1; //Serial number.
Should I use recursion for factorial function?
int Factorial (int n)
int k = 1;
for (int i = 1; i <= n; ++ i)
k = k * i;
How can I do this in one loop instead of the 3 while loops?
int main ()
int a = 1;
int b = 1;
int c = 1;
while (a <11)
Fact1 = Factorial (a);
while (b <11)
Fact2 = Factorial (b);
as long as (c <11)
Fact3 = Factorial (c);
cost << s << ":";
int LHS = Fact1 + Fact2 + Fact3;
if (LHS == a * b * c)
cost << "Pass:" << "" << << << << << << << << c << endl;
cost << "Fail" / * << "" << Fact1 << "" << Fact2 << "" << Fact3 * / << endl;
c = 1;
b = 1;
Also, I would like some variable naming tips.
Figure: The required triangle and the given conditions
As stated in the title, I'm looking for the fastest way to transform
a[b][c]. I am sure that there must be a convenient way that I have neglected.
In my case
c can be any expression with any complicated internal structure that they like.
The triangle ABC has a perimeter of 22cm. AB = 8 BC = 5cm Deduce, by calculation, if ABC is a right triangle
I want a Testnet tap from the ABC chain (BCHABC) in bitcoin silver.
Since November 15, existing BCH faucets no longer work. Even the questions that arise here are not at the rendezvous https://github.com/Bitcoin-ABC/bitcoin-abc/issues?utf8=%E2%9C%93&q=faucet