C + + algorithm extreme (one line of code for 1+2+3+...+n, one line of code to find n!)

The solution of #include <iostream>//n! using namespace std;int giral (int n) {(n>2) && (N*=giral (n-1));//Cannot write n> here 0, because N=0 will return 0, the result of the multiplication will be converted into 0,n>2 than n>1 less once, the efficiency is higher. return n; int main () {cout<<giral (4) <<endl;} #include <iostream>//request 1+2+3+...+n//: Can not use multiplication method, for,while,if,else,switch,case and other keywords and conditional judgment statement (A? A:C) using namespace std;int giral (int n) {n && (n+=giral (n-1)),//n equivalent to a switch, when it is set up to execute the following code before recursion, it plays the role of If So there's no need for a logical judgment statement here. return n;} int main () {cout<<giral (Ten) <<endl;return 0;}

C + + algorithm extreme (one line of code for 1+2+3+...+n, one line of code to find n!)