이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
using namespace std;
#include <iostream>
#include <vector>
#define pi pair<int,int>
#define vi vector<int>
#define ll long long
vector<vi> f(1e5);
ll m = 1e9 + 7;
ll pow(ll a, ll b) {
if (b == 0)
return 1;
ll ans = pow(a, b / 2);
ans = (ans * ans) % m;
if (b % 2) {
ans = (ans * a) % m;
}
return ans;
}
int main()
{
ll n,d;
cin >> n >> d;
for (int i = 0; i < n-1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
f[a].push_back(b);
f[b].push_back(a);
}
cout << pow(4, d) - 1;
}
# | 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... |