Submission #19724

#TimeUsernameProblemLanguageResultExecution timeMemory
19724yukariko괄호 (kriii4_R)C++98
0 / 100
0 ms1720 KiB
#include <bits/stdc++.h> using namespace std; #define MOD 1000000007 #define INF 987654321 typedef long long lld; lld gpow(lld a, lld x){ if(x == 0) return 1; if(x < 1) return a%MOD; lld r = gpow(a, x/2)%MOD; if(x&1) return ((r*r)%MOD * (a%MOD))%MOD; return (r*r)%MOD; } int main(){ lld n, k; while(~scanf("%lld %lld", &n, &k)){ lld x = (n+1)/2; printf("%lld\n", (gpow(2, x)+MOD-(n%2!=0))%MOD); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...