Java大数运算_floyd算法时间复杂度

import java.util.Scanner; //声明可以用Scanner读入数据
import java.math.BigDecimal; //声明一个浮点数大数类
import java.math.BigInteger; //声明一个整型大数类

BigInteger a, b;

a.add(b);

a.subtract(b);

a.multiply(b);

a.divide(b);

a.mod(b);

import java.util.Scanner;
import java.math.BigDecimal;
import java.math.BigInteger;
class Main{ 

public static void main(String[] args){ 

Scanner cin = new Scanner(System.in);
BigInteger a, b;
String s1 = "a + b = ", s2 = "a - b = ", s3 = "a * b = ", s4 = "a / b = ", s5 = "a % b = ";
a = cin.nextBigInteger();
b = cin.nextBigInteger();
// 加法
System.out.println(s1 + a.add(b));
// 减法
System.out.println(s2 + a.subtract(b));
// 乘法
System.out.println(s3 + a.multiply(b));
// 除法
System.out.println(s4 + a.divide(b));
// 求余
System.out.println(s5 + a.mod(b));
}
}