이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |