Submission
Id | When | Author | Problem | Language | CPU | Memory | Verdict |
---|---|---|---|---|---|---|---|
21072 | 2024-09-14 00:18:24 | saiful_104 | Maria and her number! |
|
14 ms | 11176 kb | Wrong Answer - 1 |
Test Cases
CPU | Memory | Verdict | |||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
1 | 14 ms | 11176 kb | Wrong Answer | ||||||||
2 | - | - | Skipped | ||||||||
3 | - | - | Skipped | ||||||||
4 | - | - | Skipped | ||||||||
5 | - | - | Skipped | ||||||||
6 | - | - | Skipped | ||||||||
Source Code
program.cpp
#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[0]=1; for(int j=1;j<N;j++){ arr[j]=((arr[j-1]*j)%mod)/2; } while(t--){ int n; cin>>n; long long x=arr[n]; // long long ans=x/2; cout<<"Case "<<i<<": "<<x<<endl; i++; } }