Submission #19547

#TimeUsernameProblemLanguageResultExecution timeMemory
19547NamnamseoΩ (kriii4_P3)C++14
0 / 100
0 ms1084 KiB
#include <cstdio> typedef long long ll; const int M=int(1e9)+7; ll pow(ll a,ll b){ if(b==0) return 1%M; ll ret=pow(a,b/2); ret=(ret*ret)%M; if(b&1) ret=(ret*a)%M; return ret; } int main() { int p,q,n,k; scanf("%d%d%d%d",&p,&q,&n,&k); ll bunja = (pow(2,k)+M-1)%M; ll bunmo = (pow(2,n)+M-1)%M; printf("%d\n",int( bunja*pow(bunmo,M-2)%M )); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...