-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathGFG_SmallestNumber.cpp
82 lines (71 loc) · 1.68 KB
/
GFG_SmallestNumber.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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/*
https://practice.geeksforgeeks.org/problems/smallest-number5829/1#
Smallest number
*/
// { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
string smallestNumber_1(int S, int D){
if(9*D < S)
return "-1";
string ans(D,'0'); // string of D with all 1s
int j = D-1;
while(j>=0)
{
if(S > 9)
{
ans[j] = '9';
S -= 9;
}
else if(D>1) // D>1 but S<9
{
// if digits are more but sum is less than 9
//then concat s-1 at end, 0 in the middle and 1 in beginning
ans[j] = S-1 +'0';
S=1 ; // S-(S-1);
}
else
{
ans[j] = S + '0';
}
D--;
j--;
}
return ans;
}
string smallestNumber(int S, int D){
if(9*D < S)
return "-1";
int ans = (int) pow(10, D-1);
int d = 1;
int mn=0;
S = S-1; // 1 added at begining of ans
// cout<<ans<<endl;
while(S>0)
{
mn = min(S, 9);
ans += d*mn;
S -= mn;
d*=10;
// cout<<mn<<" "<<S<<" "<<ans<<" "<<d<<" "<<endl;
}
return to_string(ans);
}
};
// { Driver Code Starts.
int main()
{
int t;
cin>>t;
while(t--)
{
int S,D;
cin >> S >> D;
Solution ob;
cout << ob.smallestNumber(S,D) << endl;
}
return 0;
} // } Driver Code Ends