Run Code
|
API
|
Code Wall
|
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
Dar
Synchro#1
Weighted Average
Procesos estocasticos Beta 2.0
Meeting Time
can be zero
typedef
Kth smallest element
c1
Biggest even palindrom