-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmission2.cpp
More file actions
executable file
·163 lines (152 loc) · 4.58 KB
/
mission2.cpp
File metadata and controls
executable file
·163 lines (152 loc) · 4.58 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
#include<iostream>
#include<vector>
#include<string>
#include<stdlib.h>
using namespace std;
class Number;
void Exchange(string&,string&,int &fh);
void input(string,vector<int>&);
Number operator+(const Number&X,const Number&Y);
Number operator-(const Number&X,const Number&Y);
Number operator*(const Number&X,const Number&Y);
Number operator>(const Number&X,const Number&Y);
Number operator<(const Number&X,const Number&Y);
ostream& operator<<(ostream &out,const Number&X);
istream& operator>>(istream &in ,const Number&X);
class Number{
public:
Number(string a0,vector<int> A0,char FH0,int length0)://构造函数
a(a0),A(A0),FH(FH0),length(length0){}
void display(){//输出数字
if(FH=='-') cout<<'-';
cout<<a<<endl;
}
vector<int>A;//A为数字的倒叙
int length;//length为数字长度
string a;//a为顺序的数字
~Number(){/*cout<<"析构函数"<<endl;*/}//析构函数
private:
char FH;//正数为+ 1,负数为- 0;
};
int main()
{
string a,b;int fh=1;
vector<int>A(1000),B(1000),M0(3000);
char FHa='+',FHb='+';
cin>>a>>b;
if(a[0]=='-') {FHa='-';a.erase(0,1);} if(a[0]=='+') {a.erase(0,1);}//判断符号,并删除符合
if(b[0]=='-') {FHb='-';b.erase(0,1);} if(b[0]=='+') {b.erase(0,1);}//同上
Exchange(a,b,fh);//使最后结果为a>=b
input(a,A);input(b,B);//将string转换为vector
Number X(a,A,FHa,a.size()),Y(b,B,FHb,b.size()),M("0",M0,'+',0);
cout<<"Addition =";M=X+Y;M.display();//加法
cout<<"Subtraction =";M=X-Y;if(fh==-1)cout<<'-';M.display();//减法
cout<<"Multiply =";M=X*Y;M.display();//乘法
}
void input(string a,vector<int>&A)
{
for(int i=0,j=0;i<a.size();i++){
if(a[i]<='9'&&a[i]>='0') {A[j]=a[i]-'0';j++;}
}//筛选出数字
int t;
for(int i=0;i<a.size()/2;i++){
t=A[i];A[i]=A[a.size()-1-i];A[a.size()-1-i]=t;
}//使数字倒叙存储
}
void Exchange(string&a,string&b,int &fh)//a>=b
{
string c;
if(a.size()<b.size()){c=a;a=b;b=c;fh=-1;}
if(a.size()==b.size()) if(a<b) {c=a;a=b;b=c;fh=-1;}//判断a,b大小,并使得a>=b恒成立
}
Number operator+(const Number&X,const Number&Y)
{
int t=0,cnt=0;
vector<int> M(2000,0);
for(int i=0;i<X.length+1;i++){
M[i]=(t+X.A[i]+Y.A[i])%10;
t=(t+X.A[i]+Y.A[i])/10;
}//加法核心
if(t!=0) cnt=1;
string a="";
for(int i=X.length;i>=0;i--){
if(M[i]==0&&i==X.length) continue;
a=a+char(M[i]+'0');
}//将结果倒叙存入a中
return Number(a,M,'+',X.length+cnt);
}
Number operator-(const Number&X0,const Number&Y0)
{
int t=0,q=0;
Number X(X0),Y(Y0);
vector<int> M(2000,0);
for(int i=0;i<X.length;i++){
if(X.A[i]-Y.A[i]+t<0){
M[i]=10+X.A[i]-Y.A[i];
t=-1;
X.A[i+1]--;
}
else{
t=0;
M[i]=X.A[i]-Y.A[i];
}
}//减法核心
string a="";
for(int i=X.length+Y.length;i>=0;i--){
if(M[i]!=0) q=1;
if(q==0) continue;
a=a+char(M[i]+'0');
}//倒叙存入a中,并删除多余的0.
if(q==0) cout<<'0';//如果全为0时,输出一个0
return Number(a,M,'+',X.length);
}
Number operator*(const Number&X,const Number&Y)
{
vector<int> M(3000,0);
int t=0,p=0,q=0;string a="";
for(int i=0;i<X.length;i++)
for(int j=0;j<Y.length;j++){
M[i+j]=M[i+j]+X.A[i]*Y.A[j];
//cout<<"M["<<i+j<<"]="<<M[i+j]<<" ";
}//乘法核心
for(int i=0;i<X.length+Y.length+1;i++){
p=M[i];
M[i]=(M[i]+t)%10;
t=(p+t)/10;
//cout<<M[i]<<" ";
}
// cout<<"X.length+Y.length="<<X.length+Y.length<<endl;
for(int i=X.length+Y.length;i>=0;i--){
if(M[i]!=0) q=1;
if(q==0) continue;
a=a+char(M[i]+'0');
}//倒叙存入a中,并删除多余的0.
if(q==0) cout<<'0';//如果全为0时,输出一个0
return Number(a,M,'+',X.length+Y.length+1);
}
Number operator>(const Number&X,const Number&Y)
{
string c;bool fh;
if(X.a.size()<Y.a.size()) fh=false;
if(X.a.size()==Y.a.size()) if(X.a<Y.a) fh=false;
if(fh) return X;else return Y;//如果不等式成立,返回不等式左边的数字
}
Number operator<(const Number&X,const Number&Y)
{
string c;bool fh;
if(X.a.size()<Y.a.size()) fh=true;
if(X.a.size()==Y.a.size()) if(X.a<Y.a) fh=true;
if(fh) return X;else return Y;//如果不等式成立,返回不等式左边的数字
}
ostream& operator<<(ostream &out,const Number&X)
{
out<<X.a<<endl;
return out;
}
istream& operator>>(istream &in,Number&X)
{
string b;
in>>b;
X.a=b;
return in;
}