📄 bigint.c
字号:
#include "BigInt.h"
#include <malloc.h>
#include <stdlib.h>
#include <stdio.h>
#include <process.h>
#include <windows.h>
//小素数表
const static int PrimeTable[550]=
{ 3, 5, 7, 11, 13, 17, 19, 23, 29, 31,
37, 41, 43, 47, 53, 59, 61, 67, 71, 73,
79, 83, 89, 97, 101, 103, 107, 109, 113, 127,
131, 137, 139, 149, 151, 157, 163, 167, 173, 179,
181, 191, 193, 197, 199, 211, 223, 227, 229, 233,
239, 241, 251, 257, 263, 269, 271, 277, 281, 283,
293, 307, 311, 313, 317, 331, 337, 347, 349, 353,
359, 367, 373, 379, 383, 389, 397, 401, 409, 419,
421, 431, 433, 439, 443, 449, 457, 461, 463, 467,
479, 487, 491, 499, 503, 509, 521, 523, 541, 547,
557, 563, 569, 571, 577, 587, 593, 599, 601, 607,
613, 617, 619, 631, 641, 643, 647, 653, 659, 661,
673, 677, 683, 691, 701, 709, 719, 727, 733, 739,
743, 751, 757, 761, 769, 773, 787, 797, 809, 811,
821, 823, 827, 829, 839, 853, 857, 859, 863, 877,
881, 883, 887, 907, 911, 919, 929, 937, 941, 947,
953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019,
1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087,
1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153,
1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229,
1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297,
1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381,
1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453,
1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523,
1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597,
1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663,
1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741,
1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823,
1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901,
1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993,
1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063,
2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131,
2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221,
2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293,
2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371,
2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437,
2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539,
2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621,
2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689,
2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749,
2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833,
2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909,
2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001,
3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083,
3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187,
3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259,
3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343,
3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433,
3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517,
3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581,
3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659,
3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733,
3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823,
3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911,
3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001
};
//
typedef struct MyString{
int len;
char* str;
//str = NULL;
//len = 0;
}MyString,*pMyString;
//初始化大数结构
void BigIntInit(psBigInt N)
{
int i;
N->m_nLength=1;
for(i=0;i<BI_MAXLEN;i++)N->m_ulValue[i]=0;
}
/****************************************************************************************
大数比较
调用方式：Cmp(N,A)
返回值：若N<A返回-1；若N=A返回0；若N>A返回1
****************************************************************************************/
int Cmp(psBigInt N, sBigInt A)
{
int i;
if(N->m_nLength>A.m_nLength)return 1;
if(N->m_nLength<A.m_nLength)return -1;
for(i=N->m_nLength-1;i>=0;i--)
{
if(N->m_ulValue[i]>A.m_ulValue[i])return 1;
if(N->m_ulValue[i]<A.m_ulValue[i])return -1;
}
return 0;
}
/****************************************************************************************
大数赋值
调用方式：Mov(N, A)
返回值：无，N被赋值为A
****************************************************************************************/
void Mov(psBigInt N, sBigInt A)
{
int i;
N->m_nLength=A.m_nLength;
for(i=0;i<BI_MAXLEN;i++)N->m_ulValue[i]=A.m_ulValue[i];
}
void Mov32(psBigInt N, unsigned __int64 A)
{
int i;
if(A>0xffffffff)
{
N->m_nLength=2;
N->m_ulValue[1]=(unsigned long)(A>>32);
N->m_ulValue[0]=(unsigned long)A;
}
else
{
N->m_nLength=1;
N->m_ulValue[0]=(unsigned long)A;
}
for(i=N->m_nLength;i<BI_MAXLEN;i++)N->m_ulValue[i]=0;
}
/****************************************************************************************
大数相加
调用形式：Add(N,A)
返回值：N+A
****************************************************************************************/
sBigInt Add(psBigInt N, sBigInt A)
{
unsigned carry=0, i;
unsigned __int64 sum=0;
sBigInt X;// = (sBigInt*)malloc(sizeof(sBigInt));
Mov(&X, *N);
if(X.m_nLength<A.m_nLength)X.m_nLength=A.m_nLength;
for(i=0;i<X.m_nLength;i++)
{
sum=A.m_ulValue[i];
sum=sum+X.m_ulValue[i]+carry;
X.m_ulValue[i]=(unsigned long)sum;
carry=(unsigned)(sum>>32);
}
X.m_ulValue[X.m_nLength]=carry;
X.m_nLength+=carry;
return X;
}
sBigInt Add32(psBigInt N, unsigned long A)
{
unsigned __int64 sum;
unsigned i;
sBigInt X;
// X = (sBigInt)malloc(sizeof(sBigInt));
Mov(&X, *N);
sum=X.m_ulValue[0];
sum+=A;
X.m_ulValue[0]=(unsigned long)sum;
if(sum>0xffffffff)
{
i=1;
while(X.m_ulValue[i]==0xffffffff){X.m_ulValue[i]=0;i++;}
X.m_ulValue[i]++;
if(N->m_nLength==i)N->m_nLength++;
}
return X;
}
/****************************************************************************************
大数相减
调用形式：Sub(N, A)
返回值：N-A
****************************************************************************************/
sBigInt Sub(psBigInt N, sBigInt A)
{
unsigned carry=0;
unsigned __int64 num;
unsigned i;
sBigInt X;
// X = (sBigInt)malloc(sizeof(sBigInt));
Mov(&X, *N);
if(Cmp(&X, A)<=0){Mov32(&X, 0);return X;}
for(i=0;i<N->m_nLength;i++)
{
if((N->m_ulValue[i]>A.m_ulValue[i])||((N->m_ulValue[i]==A.m_ulValue[i])&&(carry==0)))
{
X.m_ulValue[i]=N->m_ulValue[i]-carry-A.m_ulValue[i];
carry=0;
}
else
{
num=0x100000000+N->m_ulValue[i];
X.m_ulValue[i]=(unsigned long)(num-carry-A.m_ulValue[i]);
carry=1;
}
}
while(X.m_ulValue[X.m_nLength-1]==0)X.m_nLength--;
return X;
}
sBigInt Sub32(psBigInt N,unsigned long A)
{
int i=1;
unsigned __int64 num;
sBigInt X;
//X = (sBigInt)malloc(sizeof(sBigInt));
Mov(&X, *N);
if(X.m_ulValue[0]>=A){X.m_ulValue[0]-=A;return X;}
if(X.m_nLength==1){Mov32(&X,0);return X;}
num=0x100000000+X.m_ulValue[0];
X.m_ulValue[0]=(unsigned long)(num-A);
while(X.m_ulValue[i]==0){X.m_ulValue[i]=0xffffffff;i++;}
X.m_ulValue[i]--;
if(X.m_ulValue[i]==0)X.m_nLength--;
return X;
}
/****************************************************************************************
大数相乘
调用形式：Mul(N, A)
返回值：N*A
****************************************************************************************/
sBigInt Mul(psBigInt N, sBigInt A)
{
unsigned __int64 sum,mul=0,carry=0;
unsigned i,j;
sBigInt X;
//X = (sBigInt)malloc(sizeof(sBigInt));
if(A.m_nLength==1)return Mul32(N, A.m_ulValue[0]);
X.m_nLength=N->m_nLength+A.m_nLength-1;
for(i=0;i<X.m_nLength;i++)
{
sum=carry;
carry=0;
for(j=0;j<A.m_nLength;j++)
{
if(((i-j)>=0)&&((i-j)<N->m_nLength))
{
mul=N->m_ulValue[i-j];
mul*=A.m_ulValue[j];
carry+=mul>>32;
mul=mul&0xffffffff;
sum+=mul;
}
}
carry+=sum>>32;
X.m_ulValue[i]=(unsigned long)sum;
}
if(carry){X.m_nLength++;X.m_ulValue[X.m_nLength-1]=(unsigned long)carry;}
return X;
}
sBigInt Mul32(psBigInt N, unsigned long A)
{
sBigInt X;
//X = (sBigInt)malloc(sizeof(sBigInt));
unsigned __int64 mul;
unsigned long carry=0;
unsigned i;
Mov(&X, *N);
for(i=0;i<N->m_nLength;i++)
{
mul=N->m_ulValue[i];
mul=mul*A+carry;
X.m_ulValue[i]=(unsigned long)mul;
carry=(unsigned long)(mul>>32);
}
if(carry){X.m_nLength++;X.m_ulValue[X.m_nLength-1]=carry;}
return X;
}
/****************************************************************************************
大数相除
调用形式：Div(N,A)
返回值：N/A
****************************************************************************************/
sBigInt Div(psBigInt N, sBigInt A)
{
sBigInt X, Y, Z;
unsigned i,len;
unsigned __int64 num,div;
if(A.m_nLength==1)return Div32(N, A.m_ulValue[0]);
/*
X = (sBigInt)malloc(sizeof(sBigInt));
Y = (sBigInt)malloc(sizeof(sBigInt));
Z = (sBigInt)malloc(sizeof(sBigInt));*/
Mov(&Y, *N);
while(Cmp(&Y,A)>=0)
{
div=Y.m_ulValue[Y.m_nLength-1];
num=A.m_ulValue[A.m_nLength-1];
len=Y.m_nLength-A.m_nLength;
if((div==num)&&(len==0)){Mov(&X,Add32(&X,1));break;}
if((div<=num)&&len){len--;div=(div<<32)+Y.m_ulValue[Y.m_nLength-2];}
div=div/(num+1);
Mov32(&Z,div);
if(len)
{
Z.m_nLength+=len;
for(i=Z.m_nLength-1;i>=len;i--)Z.m_ulValue[i]=Z.m_ulValue[i-len];
for(i=0;i<len;i++)Z.m_ulValue[i]=0;
}
Mov(&X,Add(&X,Z));
Mov(&Y,Sub(&Y,Mul(&A,Z)));
}
return X;
}
sBigInt Div32(psBigInt N, unsigned long A)
{
unsigned __int64 div,mul;
unsigned long carry=0;
int i;
sBigInt X;
//X = (sBigInt)malloc(sizeof(sBigInt));
Mov(&X, *N);
if(X.m_nLength==1){X.m_ulValue[0]=X.m_ulValue[0]/A;return X;}
for(i=X.m_nLength-1;i>=0;i--)
{
div=carry;
div=(div<<32)+X.m_ulValue[i];
X.m_ulValue[i]=(unsigned long)(div/A);
mul=(div/A)*A;
carry=(unsigned long)(div-mul);
}
if(X.m_ulValue[X.m_nLength-1]==0)X.m_nLength--;
return X;
}
/****************************************************************************************
大数求模
调用形式：Mod(N,A)
返回值：N%A
****************************************************************************************/
sBigInt Mod(psBigInt N, sBigInt A)
{
sBigInt X,Y;
unsigned __int64 div,num;
unsigned long carry=0;
unsigned i,len;
/*
X = (sBigInt)malloc(sizeof(sBigInt));
Y = (sBigInt)malloc(sizeof(sBigInt));*/
Mov(&X, *N);
while(Cmp(&X,A)>=0)
{
div=X.m_ulValue[X.m_nLength-1];
num=A.m_ulValue[A.m_nLength-1];
len=X.m_nLength-A.m_nLength;
if((div==num)&&(len==0)){Mov(&X,Sub(&X,A));break;}
if((div<=num)&&len){len--;div=(div<<32)+X.m_ulValue[X.m_nLength-2];}
div=div/(num+1);
Mov32(&Y,div);
Mov(&Y, Mul(&A,Y));
if(len)
{
Y.m_nLength+=len;
for(i=Y.m_nLength-1;i>=len;i--)Y.m_ulValue[i]=Y.m_ulValue[i-len];
for(i=0;i<len;i++)Y.m_ulValue[i]=0;
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -