Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
21062 | 2024-09-13 22:13:01 | saiful_104 | Maria and her number! | C++ 17 | 2 ms | 3216 kb | Wrong Answer - 1 |
Source Code
#include<bits/stdc++.h> using namespace std; //#define long long int int main() { int t; cin>>t; int i=1; while(t--){ int n; cin>>n; int mod=1e9+7; long long mul=1; for(int i=1;i<=n;i++){ mul*=i; mul%=mod; } cout<<"Case "<<i<<" "<<mul/2<<endl; i++; } }