You are viewing a single comment's thread. Return to all comments →
using namespace std; int m=1000000000+7;
long power(unsigned long long a,int n) { if(n==0) return 1; if(n%2==0) return (power((a%m*a%m)%m,n/2))%m; else { return (a%m*power((a%m*a%m)%m,n/2)%m)%m; } }
int main() { int n; cin>>n; long a=1; vector ans; int arr[n]; for(int i=0;i>arr[i]; ans.push_back(1+power(2,arr[i]));
} for(int i=0;i<n;i++) { a=(ans[i]%m * a%m)%m; } cout<<a-1;
}
Seems like cookies are disabled on this browser, please enable them to open this website
Shashank and List
You are viewing a single comment's thread. Return to all comments →
include
using namespace std; int m=1000000000+7;
long power(unsigned long long a,int n) { if(n==0) return 1; if(n%2==0) return (power((a%m*a%m)%m,n/2))%m; else { return (a%m*power((a%m*a%m)%m,n/2)%m)%m; } }
int main() { int n; cin>>n; long a=1; vector ans; int arr[n]; for(int i=0;i>arr[i]; ans.push_back(1+power(2,arr[i]));
}