#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)( 1 000 007)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
if(a>b) swap(a,b);
if(a==0) return a+b;
return gcd(b%a,a);
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
bool is_prime(ll n){
ll k=sqrt(n);
if(n==2) return true;
if(n<2||n%2==0||k*k==n) return false;
for(int i=3;i<=k;i+=2){
if(n%i==0){
return false;
}
}
return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e4+5;
ll t=1,n,arr[mxn],p[mxn];
void solve(){
p[0]=1;
for(int i=1;i<=1e4;i++){
p[i]=(p[i-1]*2)%MOD;
}
cin>>n;
for(int i=1;i<=n;i++){
cin>>arr[i];
}
ll ans=0;
for(int i=1;i<=n;i+=2){
bool q=true;
for(int j=1;j<=n;j++){
if(arr[j]==i){
if(q){
ans=(ans+p[n-j]);
q=false;
}
else{
ans-=p[n-j];
if(ans<0){
ans+=MOD;
}
}
}
}
}
cout<<ans<<endl;
}
int main(){
IOS;
//cin>>t;
while(t--){
solve();
}
return 0;
}
Compilation message
teams.cpp: In function 'void solve()':
teams.cpp:16:21: error: expected ')' before numeric constant
16 | #define MOD (ll)( 1 000 007)
| ~ ^~~
teams.cpp:48:19: note: in expansion of macro 'MOD'
48 | p[i]=(p[i-1]*2)%MOD;
| ^~~
teams.cpp:16:21: error: expected ')' before numeric constant
16 | #define MOD (ll)( 1 000 007)
| ~ ^~~
teams.cpp:66:12: note: in expansion of macro 'MOD'
66 | ans+=MOD;
| ^~~
