Submission #896049

#TimeUsernameProblemLanguageResultExecution timeMemory
896049vjudge1Calvinball championship (CEOI15_teams)C++17
0 / 100
1 ms604 KiB
#include <bits/stdc++.h> using namespace std; const long long maxn =41; const long long maxs=1e6+20; const long long mod=1e6+7; const long long logn=25; int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n; cin>>n; vector<long long>x; for(long long i=0;i<n;i++) { long long num; cin>>num; x.push_back(num); } vector<long long>pom; pom=x; bool ok=true; for(long long i=0;i<n;i++) { if(x[i]!=pom[i]) { ok=false; break; } } if(ok) { long long ans=1; long long kol=1; n-=2; while(n>=0) { ans+=kol; ans%=mod; kol*=3; kol%=mod; n--; } cout<<ans<<endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...