//sepehr farid sololearn sepehrfd@yahoo.com // big number class with operate functions for BIG numberS import java.util.Arrays; public class BigNumber { int numberOfDigits; byte Digits[]; boolean sign; public BigNumber() { numberOfDigits = 1; Digits = new byte[numberOfDigits]; sign = true; } public BigNumber(byte x[], boolean minus) { sign = minus; Digits = x; } public BigNumber(String str) { if (str.substring(0, 1).equals("-")) { sign = false; str = str.substring(1, str.length()); } else { sign = true; } Digits = new byte[str.length()]; numberOfDigits = str.length(); for (int i = 0; i < str.length(); i++) { Digits[i + numberOfDigits - str.length()] = (byte) Character.getNumericValue(str.charAt(i)); } } public BigNumber(int num) { if (num < 0) { sign = false; num *= -1; } else { sign = true; } numberOfDigits = 10;//biggest int Digits = new byte[numberOfDigits]; for (int i = 0; i < 10; i++) { byte dig = (byte) (num % 10); Digits[9 - i] = dig; num /= 10; } } private byte[] TOTAL(byte x[], byte y[]) { int n = x.length; int i = 1, carry = 0, t = 0; byte res[] = new byte[x.length]; while (n > 0) { t = x[x.length - i] + y[y.length - i] + carry; res[res.length - i] = (byte) (t % 10); carry = t / 10; i++; n--; } if (carry > 0) { res[res.length - i] = (byte) carry; } return res; } public BigNumber sum(BigNumber other) { // if ((sign && !(other.sign)) || (!sign && other.sign)) { // return Minus(other); // } int maxarr = 1 + Math.max(numberOfDigits, other.numberOfDigits); byte bign1[] = new byte[maxarr]; byte bign2[] = new byte[maxarr]; System.arraycopy(Digits, 0, bign1, maxarr - numberOfDigits, numberOfDigits); System.arraycopy(other.Digits, 0, bign2, maxarr - other.numberOfDigits, other.numberOfDigits); System.out.println(Arrays.toString(bign1)); System.out.println(Arrays.toString(bign2)); int n = maxarr; int i = 1; byte carry = 0, t; String answer = ""; while (n > 0) { t = (byte) (bign1[maxarr - i] + bign2[maxarr - i] + carry); answer = Byte.toString((byte) (t % 10)) + answer; carry = (byte) (t / 10); i++; n--; } if (!sign) { answer = "-" + answer; } return new BigNumber(answer); } public BigNumber Minus(BigNumber other) { // if ((!sign && other.sign) || (sign && !other.sign)) { // return sum(other); // } if (sign && other.sign) { return new BigNumber(SUBTRACT(Digits, other.Digits)); } else { return new BigNumber(SUBTRACT(other.Digits, Digits)); } } private String SUBTRACT(byte d1[], byte d2[]) { int maxarr = Math.max(d1.length, d2.length); byte x[] = new byte[maxarr]; byte y[] = new byte[maxarr]; System.arraycopy(d1, 0, x, maxarr - d1.length, d1.length); System.arraycopy(d2, 0, y, maxarr - d2.length, d2.length); String mines = ""; boolean yisbigger = false; int start = 0; for (int i = 0; i < maxarr; i++) { if (x[i] != 0) { start = i; if (y[i] > x[i]) { mines = "-"; yisbigger = true; } break; } if (y[i] != 0) { start = i; mines = "-"; yisbigger = true; break; } } if (yisbigger) { return SUBTRACTION_PART_2(y, x, start, mines); } else { return SUBTRACTION_PART_2(x, y, start, mines); } } private String SUBTRACTION_PART_2(byte x[], byte y[], int start, String mines) { String result = ""; for (int i = start; i < x.length; i++) { if (x[i] < y[i]) { int m = 1; while (true) { if (x[i - m] != 0) { x[i - m] = (byte) (x[i - m] - 1); x[i - m + 1] = (byte) (x[i - m + 1] + 10); while (m != 1) { x[i - m + 1] = (byte) (x[i - m + 1] - 1); x[i - m + 2] += 10; --m; } break; } else { m++; } } } x[i] = (byte) (x[i] - y[i]); } int e = 0; while (e < x.length) { result = result + Integer.toString(x[e]); e++; } while ("0".equals(result.substring(0, 1)) && (result.length() != 1)) { result = result.substring(1, result.length()); } return mines + result; } public BigNumber multByOneDigit(int d) { if (d > 10 || d < -10) { return mult(new BigNumber(d)); } if (d < 0 && sign) { sign = false; } if (!sign && d > 0) { sign = true; } int n = numberOfDigits + 1; byte bign[] = new byte[n]; byte carry = 0; System.arraycopy(Digits, 0, bign, 1, numberOfDigits); System.out.println("bignumber.BigNumber.multByOneDigit()-----------ojohuigyutcyrdtyctvubi " + Arrays.toString(bign)); for (int i = 0; i < n; i++) { byte m = (byte) (bign[n - i - 1] * d + carry); bign[n - i - 1] = (byte) (m % 10); carry = (byte) (m / 10); System.out.println("m: " + m); } System.out.println("bignumber.BigNumber.multByOneDigit() " + Arrays.toString(bign)); return new BigNumber(bign, sign); } public BigNumber mult(BigNumber other) { int maxarr = 2 * Math.max(numberOfDigits, other.numberOfDigits); byte x[] = new byte[maxarr]; byte y[] = new byte[maxarr]; System.arraycopy(Digits, 0, x, maxarr - numberOfDigits, numberOfDigits); System.arraycopy(other.Digits, 0, y, maxarr - other.numberOfDigits, other.numberOfDigits); boolean sign2; sign2 = (sign && other.sign) || !sign && !other.sign; byte f[] = new byte[maxarr]; for (int j = 1; j <= maxarr / 2; j++) { int d = x[maxarr - j]; int i = 1, carry = 0; byte res[] = new byte[maxarr]; while (i <= maxarr / 2) { int m = y[maxarr - i] * d + carry; res[maxarr - j + 1 - i] = (byte) (m % 10); carry = m / 10; i++; } if (carry > 0) { res[maxarr - j + 1 - i] = (byte) carry; } f = TOTAL(f, res); } //System.out.println(Arrays.toString(f)+" ffffffffffffff"); BigNumber o = new BigNumber(f, sign2); return o; } public BigNumber div(BigNumber other) { int maxarr = Math.max(numberOfDigits, other.numberOfDigits); byte x[] = new byte[maxarr]; byte y[] = new byte[maxarr]; System.arraycopy(Digits, 0, x, maxarr - numberOfDigits, numberOfDigits); System.arraycopy(other.Digits, 0, y, maxarr - other.numberOfDigits, other.numberOfDigits); boolean sign2; sign2 = (sign && other.sign) || !sign && !other.sign; byte f[] = new byte[maxarr]; BigNumber o = new BigNumber(f, sign2); int start = 0, end = 0; for (int i = 0; i < maxarr; i++) { if (x[i] != 0) { start = i; break; } if (y[i] != 0) { return new BigNumber(); } } for (int j = start; j < maxarr; j++) { if (y[j] != 0) { end = j; break; } } int reduce = 0; int pos1 = x[start] * 10 + x[start + 1]; int pos2 = y[end]; int fas; try { fas = pos1 / pos2; } catch (Exception e) { System.out.println("infinite!!"); return null; } if (fas > 9) { fas =9; } if ((end - start + reduce - 1) > 0) { f[maxarr - end + start - reduce] = (byte) (fas - 1); byte temp1[] = new byte[maxarr]; System.arraycopy(y, 0, temp1, 0, maxarr); byte temp3[] = new byte[maxarr]; System.arraycopy(f, 0, temp3, 0, maxarr); BigNumber kl =new BigNumber(temp1, true).mult(new BigNumber(temp3, true)); // temp1 = new BigNumber(temp1, true).mult(new BigNumber(temp3, true)); SUBTRACT(x, kl.Digits); } while ((end - start + reduce) > 2) { for (int i = 0; i < x.length; i++) { if (x[i] != 0) { start = i; break; } } for (int j = start; j < y.length; j++) { if (y[j] != 0) { end = j; break; } } reduce = 0; if ((end - start + reduce - 1) > 0) { byte temp1[] = new byte[x.length]; System.arraycopy(y, 0, temp1, 0, x.length); byte temp3[] = new byte[x.length]; temp3[y.length - end + start - reduce] = 1; f = new BigNumber(f, true).sum(new BigNumber(temp3, true)).Digits; //f=TOTAL(f, temp3); temp1 = new BigNumber(temp1, true).mult(new BigNumber(temp3, true)).Digits; // x = new BigNumber(x, true).Minus(new BigNumber(temp1, true)).Digits; SUBTRACT(x, temp1); } } int finishing = 0; while (true) { if (SUBTRACT(x, y).substring(0, 1).equals("-")) { BigNumber fin = new BigNumber(finishing); BigNumber cv =o.sum(fin); //f = (new BigNumber(f, true).sum(new BigNumber(finishing))).Digits; return cv; } else { finishing++; } } } public String FAST_DIVIDE(byte x[], byte y[]) { int MAX_ARRAY_LENGTH=Math.max(x.length, y.length); int start=0, end=0; for (int i = 0; i < MAX_ARRAY_LENGTH; i++) { if (x[i] != 0) { start = i; break; } if (y[i] != 0) { return "0"; } } for (int j = start; j < MAX_ARRAY_LENGTH; j++) { if (y[j] != 0) { end = j; break; } } int reduce = 0; int pos1 = x[start] * 10 + x[start + 1]; int pos2 = y[end]; int fas; try { fas = pos1 / pos2; } catch (Exception e) { return "infinite!!"; } byte DIVISOR2[] = new byte[MAX_ARRAY_LENGTH]; for (int e = 0; e < MAX_ARRAY_LENGTH; e++) { System.out.print(DIVISOR2[e]); } System.out.println(" [][][]"); // int fas2=0; if (fas > 9) { fas %= 10; } // reduce++; // } // if(fas==1)fas++; // if(fas2==1)fas2++; if ((end - start + reduce - 1) > 0) { DIVISOR2[MAX_ARRAY_LENGTH - end + start - reduce] = (byte) (1 * (fas - 1)); // rust2[maxarr-end+start-reduce-1]=1*(fas2-1); //----------- String temp2 = Long.toString((long) (Math.pow(10, end - start + reduce - 2)) * (fas-1)); // CHERA Y AVAZ MISHE????????????? byte temp1[] = new byte[MAX_ARRAY_LENGTH]; // temp1=y; System.arraycopy(y, 0, temp1, 0, MAX_ARRAY_LENGTH); byte temp3[] = new byte[MAX_ARRAY_LENGTH]; System.arraycopy(DIVISOR2, 0, temp3, 0, MAX_ARRAY_LENGTH); temp1 = TURN_INTO_ARRAY(MULTIPLY(temp3, temp1)); // for (int k = 0; k < x.length; k++) { // System.out.print(x[k]); // } // System.out.println(": this is x after 10pow whatever"); // for (int k = 0; k < temp1.length; k++) { // System.out.print(temp1[k]); // } // System.out.println(": this is y/temp1 aft-------------------------------------------er 10pow whatever " + temp2); SUBTRACT(x, temp1); // rust += (long) (Math.pow(10, end - start + reduce - 1)) * (fas-1); for (int e = 0; e < MAX_ARRAY_LENGTH; e++) { System.out.print(DIVISOR2[e]); } while ((end - start + reduce) > 2) { x = DIVISION_PART_2(x, y, start, end, reduce,MAX_ARRAY_LENGTH); } int finishing = 0; String answer = ""; while (true) { if (SUBTRACT(x, y).substring(0, 1).equals("-")) { DIVISOR2 = TOTAL(DIVISOR2, TURN_INTO_ARRAY(Integer.toString(finishing),50)); for (int d = 0; d < MAX_ARRAY_LENGTH; d++) { answer += DIVISOR2[d]; } return answer; } else { finishing++; } } } } public byte[] DIVISION_PART_2(byte x[], byte y[], int start, int end, int reduce,int MAX_ARRAY_LENGTH) { //int start = 0, end = 0; for (int i = 0; i < MAX_ARRAY_LENGTH; i++) { if (x[i] != 0) { start = i; break; } } for (int j = start; j < MAX_ARRAY_LENGTH; j++) { if (y[j] != 0) { end = j; break; } } reduce = 0; // if (x[start] > y[end]) { // reduce = 1; // } // int pos1 = x[start] * 10 + x[start + 1]; // int pos2 = y[end]; // int fas = pos1 / pos2; ///////////////////////////////////////////////////////System.out.println("is it here/////?"); if ((end - start + reduce - 1) > 0) { /////////////////////////////////////// System.out.println(end - start + reduce - 1); // String temp2 = Long.toString((long) (Math.pow(10, end - start + reduce - 2))); int temp1[] = new int[MAX_ARRAY_LENGTH]; // temp1=y; System.arraycopy(y, 0, temp1, 0, MAX_ARRAY_LENGTH); // int temp3[] = turnintoarray(temp2); int temp3[] = new int[MAX_ARRAY_LENGTH]; temp3[MAX_ARRAY_LENGTH - end + start - reduce] = 1; DIVISOR2 = TURN_INTO_ARRAY(TOTAL(DIVISOR2, temp3)); temp1 = TURN_INTO_ARRAY(MULTIPLY(temp1, temp3)); x = TURN_INTO_ARRAY(SUBTRACT(x, temp1)); // rust += (long) (Math.pow(10, end - start + reduce - 2)); // for (int k = 0; k < x.length; k++) { // System.out.print(x[k]); // } // System.out.println(": this is x aft-------------------------------------------er 10pow whatever " + temp2); // for (int k = 0; k < temp3.length; k++) { // System.out.print(temp3[k]); // } // System.out.println(": this is temp3 aft-------------------------------------------er 10pow whatever " + temp2); // for (int k = 0; k < temp1.length; k++) { // System.out.print(temp1[k]); // } // System.out.println(": this is y/temp1 aft-------------------------------------------er 10pow whatever " + temp2); // // System.out.println(rust + " <<>> " + (end - start + reduce) + " "); } //////////////////////////////////////////System.out.println("term.pkg3.Term3.divide2() end before return divide 2"); this.start = start; this.end = end; return x; } private byte[] TURN_INTO_ARRAY(String a,int MAX_ARRAY_LENGTH) { byte x[] = new byte[MAX_ARRAY_LENGTH]; for (int i = 0; i < a.length(); i++) { x[i + MAX_ARRAY_LENGTH - a.length()] = (byte) Character.getNumericValue(a.charAt(i)); } return x; } public static void main(String[] args) { BigNumber t = new BigNumber("68534698271576878906857486375469328746832659732948"); BigNumber y = new BigNumber("38463274698326984379847983788738"); BigNumber x = t.sum(y); // System.out.println(Arrays.toString(x.Digits)); System.out.println(Arrays.toString(x.Digits) + " mnmnmn"); System.out.println("-------------1---------------------------------------------------------------------------------------"); BigNumber t2 = new BigNumber("68534698271576878906857486375469328746832659732948"); BigNumber y2 = new BigNumber("38463274698326984379847983788738"); BigNumber x2 = t2.Minus(y2); // System.out.println(Arrays.toString(x.Digits)); System.out.println(Arrays.toString(x2.Digits) + " mnmnmn"); System.out.println("--------------2--------------------------------------------------------------------------------------"); // BigNumber t3 = new BigNumber("68534698271576878906857486375469328746832659732948"); BigNumber y3 = new BigNumber("38463274698326984379847983788738"); BigNumber x3 = t3.mult(y3); // System.out.println(Arrays.toString(x.Digits)); System.out.println(Arrays.toString(x3.Digits) + " mnmnmn"); System.out.println("---------------3-------------------------------------------------------------------------------------"); // BigNumber t4 = new BigNumber("68534698271576878906857486375469328746832659732948"); BigNumber x4 = t4.multByOneDigit(15); // System.out.println(Arrays.toString(x.Digits)); System.out.println(Arrays.toString(x4.Digits) + " mnmnmn"); System.out.println("---------------4-------------------------------------------------------------------------------------"); // // BigNumber t2 = new BigNumber("68534698271469328746832659732948"); // BigNumber y2 = new BigNumber("38463274698326984379847983788738"); // BigNumber x2 = t2.Minus(y2); // System.out.println(Arrays.toString(x2.Digits)); // System.out.println("----------------------------------------------------------------------------------------------------"); // BigNumber x3 = t2.mult(y2); // System.out.println(Arrays.toString(x3.Digits)); // System.out.println("----------------------------------------------------------------------------------------------------"); } }

BIG NUMBER class