제출 #19494

#제출 시각아이디문제언어결과실행 시간메모리
19494sung927Α (kriii4_P1)C++98
0 / 100
0 ms1280 KiB
#include<stdio.h> #include<math.h> long long A; int perA; long long X; long long arr[65]; bool Tr[65]; int max; unsigned long long ans = 1; void finish(int y, int dex) { if((y%2)) Tr[dex] = 1; if(y/2>=1) finish(y/2, dex+1); } void solve(int k) { arr[k] = (int)((unsigned long long)(arr[k-1]*arr[k-1]) % 1000000007); if(pow(2,k)<=X) solve(k+1); else {max = k; finish(X, 1);} } int main () { scanf("%lld %lld", &A, &X); perA = A % 1000000007; arr[1] = perA; solve(2); for(int i=1; i<=max+1; i++) {if(Tr[i]) ans*= arr[i]; if(ans>1000000007) ans%=1000000007;} printf("%lld", ans); }
#Verdict Execution timeMemoryGrader output
Fetching results...