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;
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
#define FOR(x, a, b) for (int x = a; x < (b); ++x)
ll possibilities(ll N, ll D, vii UV);
int main() {
ll N, D;
cin >> N >> D;
vii UV(N);
FOR(i, 0, N) {
ll a, b;
cin >> a >> b;
UV[i] = make_pair(a, b);
}
cout << possibilities(N, D, UV) << '\n';
}
ll M = 1000000007;
ll modpow(ll b, ll e, ll m) {
ll r = 1;
while (e) {
if (e & 1) {
r *= b;
r %= m;
}
b *= b;
b %= m;
e >>= 1;
}
return r;
}
ll possibilities(ll N, ll D, vii UV) {
return modpow(4, D, M);
}
# | 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... |
# | 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... |