# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
962725 |
2024-04-14T07:30:04 Z |
SuPythony |
Boat (APIO16_boat) |
C++17 |
|
1 ms |
348 KB |
#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 |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |