This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
const int MOD=1e9+7;
int n; cin>>n;
vector<ll> a(n+1), b(n+1);
for (int i=1; i<=n; i++) {
cin>>a[i]>>b[i];
}
ll ans=1;
for (int i=0; i<n; i++) {
ans=(ans*2)%MOD;
}
ans=(ans-1)%MOD;
cout<<ans%MOD;
}
# | 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... |