import java.math.BigInteger; import java.util.Scanner; public class Main { static BigInteger Max(BigInteger a,BigInteger b) { a=a.max(b); return a; } static public void main(String[] args) { Scanner cin =new Scanner(System.in); BigInteger a=cin.nextBigInteger(); BigInteger b=cin.nextBigInteger(); int t=a.compareTo(b); if(t>0) System.out.println(a); else System.out.println(b); //a=Max(a,b); //System.out.println(a); /*while(cin.hasNext()) { int n=cin.nextInt(); if(n==0) break; BigInteger h[]=new BigInteger [110]; BigInteger f[]=new BigInteger [110]; h[1]=BigInteger.valueOf(1); f[1]=BigInteger.valueOf(1); for(int i=2;i<=n;i++) { BigInteger a=h[i-1].multiply(BigInteger.valueOf(4*i-2)); h[i]=a.divide(BigInteger.valueOf(i+1)); f[i]=f[i-1].multiply(BigInteger.valueOf(i)); } BigInteger BB=h[n].multiply(f[n]); System.out.println(BB);}*/ //int t = input.nextInt(); //BigInteger e = input.nextBigInteger(); //BigInteger a = new BigInteger("03"); //BigInteger b = BigInteger.ONE;//Ten //BigInteger d = BigInteger.valueOf(val); //a = e.add(a); //a = e.subtract(a); //a = e.multiply(a); //a = e.divide(a); //for(int i=1;i<=t;i++) { //BigInteger d = b.add(c); //System.out.println("Case "+ i +":"); //System.out.println(b + " + " + c + " = " + d); //if(i!=t) System.out.println(); //} } }
【java】
猜你喜欢
转载自blog.csdn.net/ummmmm/article/details/80287135
今日推荐
周排行