|
Project Euler Homework
|
finding a^b More...
#include <056_bigN.h>
Public Member Functions | |
| bigN056 (unsigned) | |
| void | operator*= (unsigned) |
| void | operator+= (bigN056 &) |
| void | square () |
| verylong | operator[] (int) |
| void | pow (unsigned) |
| void | printN () |
| bool | isOverflow () |
Protected Attributes | |
| verylong | mantissa [bigN_gps] |
finding a^b
spilt into 12 groups, each with 18 digits smallest place unit exists in x[0] assume a is smaller than 2^64;
Definition at line 30 of file 056_bigN.h.
1.7.3