a的n次幂（时间复杂度O(nlogn)算法java）

import java.util.*;
public class Main_a的n次幂
{
	public static void main(String[] args)
	{
		Scanner yina = new Scanner(System.in);
		int a,n;
		System.out.println("请输入a和n(a^n)：");
		a = yina.nextInt();
		n = yina.nextInt();
		System.out.println("a^n=" + pow(a,n));
		
		
	}

	private static long pow(int a, int n) 
	{
		if(n == 0)
			return 1;
		if(n == 1)
			return a;
		long temp = pow(a,n/2);
		if(n%2 == 1)
			return a*temp*temp;
		return temp*temp;
	}
}import java.util.*;
public class Main_a的n次幂
{