oj.uz

Submission #19473

# Submission time Handle Problem Language Result Execution time Memory
19473 2016-02-24T13:32:23 Z min050820 Α (kriii4_P1) C++14
0 / 100
 0 ms 1716 KB 
#include <iostream>

using namespace std;

long long a,x;

const long long mod=1000000007;

// dp[n] = N ^ (2^n)
long long pow_dpTable[100];

long long pow(long long N,long long P){
    pow_dpTable[0]=N;
    long long mask=1;
    long long result=1;
    int i;
    for(i=1;mask <= P;i++){
        pow_dpTable[i]=(pow_dpTable[i-1] * pow_dpTable[i-1])%mod;
        mask<<=1;
    }
    mask=1;
    for(i=0;mask <= P;i++){
        if(P&mask){
            result = (result * pow_dpTable[i]) % mod;
        }


        mask<<=1;
    }

    return result;
}

int main()
{
    cin >> a >> x;
    a%=mod;
    x%=mod;
    cout << pow(a,x);
    return 0;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1716 KB Output isn't correct
2 Halted 0 ms 0 KB -