Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Vishruth-S/CompetitiveCode
/ factorial
Function
factorial
Codeforces_problems/Dreamoon and WIFI/solution.cpp:23–30 ·
view source on GitHub ↗
Source
from the content-addressed store, hash-verified
21
#include <iomanip>
22
using namespace std;
23
long long int factorial(int n) {
24
long long int result = 1;
25
while (n != 0) {
26
result *= n;
27
n--;
28
}
29
return result;
30
}
31
int main() {
32
string str1, str2;
33
cin >> str1 >> str2;
Callers
1
main
Function · 0.70
Calls
no outgoing calls
Tested by
no test coverage detected