Advertisement
Guest User

Untitled

a guest
Nov 17th, 2017
60
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.57 KB | None | 0 0
  1.  
  2. private void Simplify(BigInteger num, BigInteger den)
  3. {
  4. BigInteger gcd = countGCD(num, den);
  5. numerator = numerator / gcd;
  6. denominator = denominator / gcd;
  7. }
  8.  
  9.  
  10. private BigInteger countGCD(BigInteger num, BigInteger den)
  11. {
  12. while(num != den)
  13. {
  14. if(num < den)
  15. {
  16. den -= num;
  17. } else
  18. {
  19. num -= den;
  20. }
  21. }
  22.  
  23. return num;
  24. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement