Submission #791455

#TimeUsernameProblemLanguageResultExecution timeMemory
791455petezaStar Trek (CEOI20_startrek)C++14
7 / 100
1 ms308 KiB
#include <bits/stdc++.h> using namespace std; long long mod = 1e9+7; int n; long long d; long long custompow(long long x, long long y) { long long res = 1; for(;y;y>>=1,x=x*x%mod) if(y&1) res = res*x%mod; return res; } int main() { cin >> n >> d; cout << custompow(2, 2*d); }
#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...