Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
21071 | 2024-09-13 22:44:33 | saiful_104 | Maria and her number! | C++ 17 | 242 ms | 11212 kb | Accepted |
Source Code
#include<bits/stdc++.h> using namespace std; //#define long long int const int mod=1e9+7; const int N=1e6+50; int main() { int t; cin>>t; int i=1; long long arr[N]; arr[2]=1; for(int j=3;j<N;j++){ arr[j]=(arr[j-1]*j)%mod; } while(t--){ int n; cin>>n; long long ans=arr[n]; cout<<"Case "<<i<<": "<<ans<<endl; i++; } }