编写程序实现任意精度的整数，计算第二十个梅森素数。实现它，它的工作原理与vector或deque容器的每个元素表示一个十进制数字。

Specification Write a program to implement an arbitrary-precision integer and to compute the 20th Mersenne prime. Implement it such that it works with a vector or deque with each element representing a decimal digit. Analysis The current largest known prime happens to be a Mersenne prime (a number of the form 2n-1). There are only 47 known Mersenne primes. There"s a SETI-like effort, GIMPS, to find the next one, and the EFF is offering money for finding large ones.