i used good algo for Problem : FAST2 ,
but i am getting TLE , i cannot understand where the bug is..?
import java.util.*;
import java.math.*;
class Fast
{
public static void main(String args[])throws Exception
{
BigInteger n,p,j=new BigInteger("1"),m=new BigInteger("1298074214633706835075030044377087");
Integer t,x,i;
Scanner s=new Scanner(System.in);
t=s.nextInt();
while(t-->0)
{
n=new BigInteger("1");
x=s.nextInt();
n=n.shiftLeft(x+1);
n=n.subtract(j);
n=n.mod(m);
System.out.println(n);
}
}
}
