Submission #577327

#TimeUsernameProblemLanguageResultExecution timeMemory
577327piOOEStar Trek (CEOI20_startrek)C++17
7 / 100
2 ms2672 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 100000, mod = 1e9 + 7; int add(int a, int b) { return a + b < mod ? a + b : a + b - mod; } int mul(int a, int b) { return a * (ll)b % mod; } int binpow(int a, ll p) { int ans = 1; for (; p > 0; p >>= 1, a = mul(a, a)) { if (p & 1) { ans = mul(ans, a); } } return ans; } int n; ll d; vector<int> g[N]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> d; if (n == 2) { cout << binpow(4, d); return 0; } return 0; }
#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...