# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48642 | nobik | Boat (APIO16_boat) | C++14 | 2065 ms | 8832 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;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SIZE(a) ((int)(a).size())
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
using K = long double;
const int inf = 1000*1000*1000 + 7;
const int mod = 1000*1000*1000 + 7;
const int N = 1005;
int power(int a, int n) {
int result = 1;
while (n > 0) {
if (n % 2) {
result = (1LL*result*a) % mod;
}
a = (1LL*a*a) % mod;
n /= 2;
}
return result;
}
int inv(int a) {
return power(a, mod-2);
}
# | 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... |