Submission #492508

#TimeUsernameProblemLanguageResultExecution timeMemory
492508LittleCubeStar Trek (CEOI20_startrek)C++14
0 / 100
1084 ms5196 KiB
#include <bits/stdc++.h> #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> #define F first #define S second using namespace std; const ll MOD = 1000000007; ll N, D, ans = 1; vector<int> E[100005]; signed main() { cin >> N >> D; assert(N == 2); for (int i = 1; i <= D % (MOD - 1); i++) ans = (ans * 4) % MOD; cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...