forked from kothariji/competitive-programming
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path(CODEFORCES)Decrease_the_sum_of_digits.cpp
67 lines (55 loc) · 1.12 KB
/
(CODEFORCES)Decrease_the_sum_of_digits.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
66
67
#include <iostream>
using namespace std;
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <unordered_map>
#include <cmath>
#include <stack>
#include <cstdio>
int main() {
int t;
cin>>t;
while(t--){
vector<int> a;
string s;
cin>>s;
int ss;
cin>>ss;
int n=size(s);
for(int i=0;i<n;i++){
a.push_back(s[i]-'0');
}
int psum=0;
int pri=0;
for(int i=0;i<n;i++){
psum+=a[i];
pri=i;
if(psum>=ss){break;}
}
if(pri>=n-1&&psum<=ss)cout<<0<<endl;
else if(pri==n-1&&psum==ss){cout<<0<<endl;
}
else{
bool su=false;
if(psum==ss){
int w=pri+1;
while(a[w]==0&&w<n)w++;
if(w==n){
su=true;
cout<<0<<endl;
}
}
if(!su){
int u=n-1;
while(a[u]==0)u--;
while(a[pri]==9)pri++;
for(int i=pri;i<u;i++)cout<<9-a[i];
cout<<10-a[u];
for(int i=0;i<n-u-1;i++)cout<<0;
cout<<endl;
}
}
}
}