# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25201 | gabrielsimoes | Boat (APIO16_boat) | C++14 | 179 ms | 2048 KiB |
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;
const ll MOD = 1000000007;
const int MAXN = 501;
const int MAX = 1e6+10;
#define mod(a, b) (((a)*(b)) % MOD)
ll invpow(ll a, ll b = MOD-2) {
ll ret = 1;
ll prod = a;
for (int i = 0; i <= 30; i++) {
if ((1LL << i) & b)
ret = (ret * prod) % MOD;
prod = (prod*prod) % MOD;
}
return ret;
}
int n;
ll a[MAXN], b[MAXN];
vector<ll> v;
ll inv[MAXN], c[MAXN];
ll dp[MAXN], sum[MAXN];
int main()
{
Compilation message (stderr)
# | 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... |