-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmul.cpp
62 lines (61 loc) · 1.31 KB
/
mul.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
#include <bits/stdc++.h>
using namespace std;
string mwod(string s1, int n)
{
int c=0;
reverse(s1.begin(), s1.end());
string s;
int n1=s1.length();
for (int i=0; i<n1; i++)
{
int mul = (s1[i] - '0')*n + c;
s.push_back(mul%10 + '0');
c = mul/10;
}
if(c!=0) s.push_back(c + '0');
reverse(s.begin(), s.end());
return s;
}
string add(string s1, string s2)
{
int n1, n2;
string s3;
if (s1.length() > s2.length()) swap(s1, s2);
n1=s1.length();
n2=s2.length();
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
int c=0;
for(int i=0; i<n1; i++)
{
int sum = (s1[i]-'0') + (s2[i]-'0') + c;
s3.push_back(sum%10 + '0');
c=sum/10;
}
for(int i=n1; i<n2; i++)
{
int sum = (s2[i] - '0') + c;
s3.push_back(sum%10 + '0');
c=sum/10;
}
if(c!=0) s3.push_back(c + '0');
reverse(s3.begin(), s3.end());
return s3;
}
int main() {
string s1, s2, s3;
cin >> s1 >> s2;
s3 = '0';
int n2 = s2.length();
reverse(s2.begin(), s2.end());
for(int i=0; i<n2; i++)
{
string s = mwod(s1, (s2[i] - '0'));
for(int j=0; j<i; j++)
{
s.push_back('0');
}
s3 = add(s3, s);
}
cout << s3;
}