處理溢出我有一個函數的Java它看起來像這樣： private static long fieldPrime = 4294967291L; // 2^32-5
public final static long modMult(long a, long b) {
long r = (a*b) % fieldPrime;
return r;
}
它乘以兩個值（這是保證爲
可能重複來劃分大的數字： What is the best way to represent arbitrarily big numbers in c? Are there any solid large integer implementations in C? 我需要劃分兩個int大的數字，並希望只有整數結果（沒有餘數） 像987654321987654321/98765432198 其中數字
import java.math.BigInteger;
public class Rational extends Number implements Comparable {
// Data fields for numerator and denominator
private BigInteger numerator = new BigInteger("0");