Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
RecursiveFact
//Title of this code #include <iostream> #include <string.h> using namespace std; int factorial(int n) { if (n==0) return 1; return n*factorial (n-1); } int main() { cout << "Hello, world!\n"; //-----------------factorial-------------------// int n=0,f; cin>>n; f=factorial(n); cout<<f; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Callback
Test 7(2020)
OTHER - Two robots
Dijkastra
DeepaC++
Working variables benchmark
stl_sizeof
Cotton Farm 0.0.1.0
Vector+Memory_Adv_C++_Tutorial
without HLD range Quey can be handled by just using segment tree on the FLATTENED TREE (euler tour)
Please log in to post a comment.