답안 #19610

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
19610 2016-02-25T01:27:30 Z chan492811 Α (kriii4_P1) C++
100 / 100
0 ms 1084 KB
#include <cstdio>
#include <algorithm>
#define mod 1000000007
#define ll long long
using namespace std;
ll table[100];
void make_table(ll a){
    ll i;
    table[0]=a%mod;
    for(i=1;i<100;i++) table[i]=(table[i-1]*table[i-1])%mod;
}
int main(){
    ll i,a,s,res=1,now;
    scanf("%lld %lld",&a,&s);
    make_table(a); now=1;
    for(i=0;s;i++){
        if(s&now) res*=table[i],res%=mod,s-=now;
        now*=2;
    }
    printf("%lld",res);
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct
11 Correct 0 ms 1084 KB Output is correct
12 Correct 0 ms 1084 KB Output is correct
13 Correct 0 ms 1084 KB Output is correct
14 Correct 0 ms 1084 KB Output is correct
15 Correct 0 ms 1084 KB Output is correct
16 Correct 0 ms 1084 KB Output is correct
17 Correct 0 ms 1084 KB Output is correct
18 Correct 0 ms 1084 KB Output is correct
19 Correct 0 ms 1084 KB Output is correct
20 Correct 0 ms 1084 KB Output is correct