mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-24 03:31:59 +00:00
819. 递归求阶乘
https://www.acwing.com/problem/content/submission/code_detail/14063914/
This commit is contained in:
parent
0f16821fad
commit
35ed69f23a
20
AcWing/819/819.cpp
Normal file
20
AcWing/819/819.cpp
Normal file
@ -0,0 +1,20 @@
|
||||
#include <iostream>
|
||||
|
||||
using std::cin;
|
||||
using std::cout;
|
||||
const char endl = '\n';
|
||||
|
||||
int f(int x) {
|
||||
return x == 1 ? 1 : x * f(x - 1);
|
||||
}
|
||||
|
||||
int n;
|
||||
|
||||
int main() {
|
||||
std::ios::sync_with_stdio(false);
|
||||
|
||||
cin >> n;
|
||||
cout << f(n) << endl;
|
||||
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user