-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathMultiplication.cpp
65 lines (52 loc) · 1.25 KB
/
Multiplication.cpp
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
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main()
{
lli T;
cin>>T;
while(T--)
{
string a, b;
cin>>a >>b;
if(a[0]=='0'|| b[0]=='0')
{
cout<<"0";
return 0;
}
vector<lli>v1, v2;
for(lli i=0; i<a.size(); i++)
v1.push_back(a[i]- '0');
for(lli i=0; i<b.size(); i++)
v2.push_back(b[i]- '0');
reverse(v1.begin(),v1.end());
reverse(v2.begin(),v2.end());
if(v1.size()< v2.size())
swap(v1, v2);
vector<lli>v3(v1.size()+v2.size(), 0);
lli carry =0;
for(lli i=0; i<v2.size(); i++){
carry=0;
for(lli j=0; j<v1.size(); j++){
lli num = v3[i+j] + v1[j]*v2[i] + carry;
v3[i+j]=num%10;
if(num/10==0)
carry=0;
else
carry = num/10;
}
if(carry!=0){
v3[i+v1.size()]+= carry;
}
}
reverse(v3.begin(), v3.end());
lli i=0;
for(i=0; i<v3.size(); i++){
if(v3[i]!=0)
break;
}
for(lli j=i; j<v3.size(); j++)
cout<<v3[j];
cout<<endl;
}
}