Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define ll long long
- #define _test int _TEST; cin>>_TEST; while(_TEST--)
- #define ff first
- #define ss second
- #define pb push_back
- #define ppb pop_back
- int main()
- {
- int num[9] = {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000};
- _test
- {
- ll int a, b, c, k;
- cin>>a>>b>>c>>k;
- int ansa=-1, ansb;
- for(int i=num[a-1]; i<num[a]; i++)
- {
- int minb = max(num[b-1], num[c-1] - i);
- int maxb = min(num[b]-1, num[c]-1 - i);
- if(maxb < minb) continue;
- int options = maxb - minb + 1;
- if(options >= k)
- {
- ansa = i;
- ansb = minb + k - 1;
- break;
- }
- k -= options;
- }
- if(ansa == -1)
- {
- cout<<-1<<"\n";
- continue;
- }
- cout<<ansa<<" + "<<ansb<<" = "<<ansa+ansb<<"\n";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment