BigInt.hpp 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117
  1. #ifndef BIGINT_HPP
  2. #define BIGINT_HPP
  3. #include <cstdint>
  4. #include <deque>
  5. #include <string>
  6. #include <cmath>
  7. using std::size_t;
  8. inline std::uint32_t u(uint64_t a){
  9. return (uint32_t)(a >> 32);
  10. }
  11. inline std::uint32_t l(uint64_t a){
  12. return (uint32_t)(a & 0x00000000FFFFFFFF);
  13. }
  14. template<typename T>
  15. inline int signum(T t){
  16. if(t > 0)return 1;
  17. if(t < 0)return -1;
  18. return 0;
  19. }
  20. struct BigInt{
  21. using uint64_t = std::uint64_t;
  22. using uint32_t = std::uint32_t;
  23. int signum;
  24. std::deque<std::uint64_t> data;
  25. inline BigInt(size_t size, bool dummy) : data(size, 0){
  26. }
  27. inline BigInt(unsigned int n) : data(1, 0){
  28. data[0] = n;
  29. }
  30. inline BigInt(unsigned long long n) : data(2, 0){
  31. data[1] = l(n);
  32. data[0] = u(n);
  33. }
  34. inline BigInt(int n) : data(1, 0){
  35. data[0] = std::abs(n);
  36. signum = ::signum(n);
  37. }
  38. inline BigInt(long long n) : data(2, 0){
  39. data[1] = l(std::abs(n));
  40. data[0] = u(std::abs(n));
  41. signum = ::signum(n);
  42. }
  43. inline uint32_t mod(uint32_t o){
  44. uint64_t carry = 0;
  45. for(size_t i = 0;i < data.size();i++){
  46. carry = ((carry << 32) + data[i]) % o;
  47. }
  48. return carry;
  49. }
  50. inline BigInt div(uint32_t o){
  51. uint64_t carry = 0;
  52. BigInt ret = *this;
  53. for(size_t i = 0;i < data.size();i++){
  54. ret.data[i] = (data[i] + (carry << 32)) / o;
  55. carry = (data[i] + (carry << 32)) % o;
  56. }
  57. return ret;
  58. }
  59. inline BigInt add(const BigInt& other){
  60. BigInt ret((size_t)std::max((size_t)data.size(), (size_t)other.data.size()), false);
  61. uint64_t carry = 0;
  62. for(size_t s = 0;s < std::max(data.size(), other.data.size());s++){
  63. uint64_t s1 = (s >= data.size() ? 0 : data[data.size() - s - 1]);
  64. uint64_t s2 = (s >= other.size() ? 0 : other.data[other.size() - s - 1]);
  65. uint64_t sum = s1 + s2 + carry;
  66. ret.data[ret.size() - s - 1] = l(sum);
  67. carry = u(sum);
  68. }
  69. return ret;
  70. }
  71. inline BigInt mult(const BigInt& other){
  72. std::deque<std::deque<uint64_t>> matrix(size(), std::deque<uint64_t>(other.size() + 1, 0));
  73. uint64_t carry = 0;
  74. BigInt ret(size() + other.size(), false);
  75. for(size_t i = 0;i < size();i++){
  76. for(size_t ih = 0;ih < other.size();ih++){
  77. uint64_t res = data[size() - i - 1] * other.data[other.size() - ih - 1];
  78. res += carry;
  79. matrix[i][ih] = l(res);
  80. carry = u(res);
  81. }
  82. }
  83. carry = 0;
  84. for(size_t column = 0;column < (matrix.size() + other.size());column++){
  85. uint64_t accum = 0;
  86. for(size_t row = 0;row < matrix.size();row++){
  87. if(row > column)goto end;
  88. else if(column - row < matrix[row].size()){
  89. accum += matrix[row][column - row];
  90. }
  91. }
  92. end:
  93. accum += carry;
  94. carry = u(accum);
  95. ret.data[ret.size() - column - 1] = l(accum);
  96. }
  97. if(ret.data[0] == 0)ret.data.pop_front();
  98. return ret;
  99. }
  100. inline size_t size()const{
  101. return data.size();
  102. }
  103. inline std::string toString(){
  104. std::string a = "";
  105. BigInt dec(*this);
  106. while(dec.data[dec.data.size() - 1]){
  107. a = std::to_string(dec.mod(10)) + a;
  108. dec = dec.div(10);
  109. }
  110. return a;
  111. }
  112. };
  113. #endif