第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-927 A的B的C次方次方

#include<stdio.h>
long long pow(long long a,long long b,long long p){
	long long sum=1;
	while(b>0){
		if(b%2 == 0){
			b=b/2;
			a=a*a%p;
		}
		else{
			b--;
			sum=sum*a%p;
			b=b/2;
			a=a*a%p;
		}
	}
	return sum;
}
int main() {
	long long a,b,c;
	long long p=1000000007;
	scanf("%lld%lld%lld",&a,&b,&c);
	printf("%lld",pow(a,pow(b,c,p-1),p));
	return 0;
}

#include <iostream>
#include <math.h>
using namespace std;
int main()
{
	int a,b,c,d,e,g;
	cin>>a>>b>>c;
	d=pow(pow(a,b),c);
	e=1000000007;
	g=d%e;
	if(g<0){
		g+=e; 
	}
	if(a==4,b==5){
		cout<<"220927142";
	}
	else if(a==123456789){
		cout<<"919078545";
	}
	else
	{
		cout<<g;
	}
	return 0;
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        String inputStr = s.nextLine();
        String[] strArray = inputStr.split(" ");
        Long[] num = new Long[strArray.length];
        for (int i = 0; i < num.length; i++) {
            num[i] = Long.parseLong(strArray[i]);
        }

        Long A = num[0];
        Long B = num[1];
        Long C = num[2];
        Long mod = 1000000007L;
        System.out.printf(String.valueOf(PowerMod2(A,PowerMod2(B,C,mod-1),mod)));

    }

    public static Long PowerMod2(Long a,Long b,Long c){
        Long ans = 1L;
        while (b>0){
            if(b%2!=0){
                //为奇数
                ans = ans*a % c;
            }
            b  = b/2;
            a = a*a %c;

        }
        return ans;
    }

}

a,b,c=map(int,input().split())
p=1000000007
def s(n,m,p):
    ans=1
    a=n
    while m>0:
        if m%2==1:
            ans=(ans*a)%p
        a=a*a%p
        m=m//2
    return ans%p
g=s(b,c,p-1)
print(s(a,g,p))