-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddToArrayFormOfInteger.cpp
More file actions
73 lines (70 loc) · 1.7 KB
/
AddToArrayFormOfInteger.cpp
File metadata and controls
73 lines (70 loc) · 1.7 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
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define input for(int &i:v) cin >> i;
void print(const vector<int>& v) {
for (int i : v) {
cout << i << " ";
}
cout << endl;
}
void add(vector<int>& to, vector<int>& from, vector<int>& ans){
long long carry = 0;
long long m = from.size(), n = to.size();
int i=m-1, j = n-1;
for(;i>=0;i--){
int sum = from[i] + to[j] + carry;
carry = sum/10;
sum = sum%10;
ans.push_back(sum);
j--;
}
//add remaining of to
while(j>=0){
int sum =to[j] + carry;
carry = sum/10;
sum = sum%10;
ans.push_back(sum);
}
if(carry){
ans.push_back(carry);
}
}
vector<int> addToArrayForm(vector<int>& num, long long k) {
vector<int> ans;
vector<int> knum;
while(k>0){
knum.push_back(k%10);
k/=10;
}
reverse(knum.begin(),knum.end());
// print(knum);
long long n = num.size();
long long m = knum.size();
if(n>m){
//add m to n
add(num,knum,ans);
}
else{
add(knum,num,ans);
}
reverse(ans.begin(),ans.end());
return ans;
}
void solve() {
int n,k; cin >> n>>k;
vector <int> v(n);
input
print(addToArrayForm(v,k));
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t-- > 0) {
solve();
}
}