# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
137990 | sebinkim | Remittance (JOI19_remittance) | C++14 | 533 ms | 44280 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 = 1e9 + 7;
ll A[1010101], B[1010101], X[1010101];
ll n, p, q, s, a, b, x, t;
void die() { printf("No\n"); exit(0); }
ll pow(ll a, ll b)
{
ll ret = 1;
for(; b; b>>=1){
if(b & 1) ret = ret * a % mod;
a = a * a % mod;
}
return ret;
}
void check()
{
ll i, j;
p = (pow(2ll, n) - 1 + mod) % mod;
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... |