2018 Multi-University Training Contest 10 hdu 6433 Problem H. Pow

版权声明：哈哈哈哈哈哈哈哈哈哈哈哦吼~~ https://blog.csdn.net/threeh20/article/details/82026132

http://acm.hdu.edu.cn/showproblem.php?pid=6433

2的n次方，，，double就可以了

..

import javax.swing.*;
import java.awt.*;
import java.awt.event.*;
import java.math.BigInteger;
import java.util.Scanner;

public class Main
{  public static void main(String args[])
   { 
      Scanner cin=new Scanner(System.in);
      int T;
      T=cin.nextInt();
      while(T>0)
      {
          int n=cin.nextInt();
          BigInteger t=BigInteger.valueOf(2);
          BigInteger ans=t.pow(n);
          System.out.println(ans);
          T--;
      }
   }
}