func_code_string: #include <bits/stdc++.h>   using namespace std;   const int maxn = 4e6 + 7;   const int inf = INT_MAX;   const long long inff = 1e18;   const long long mod = 1e9 + 7;   int d, s;   pair<int, int> dp[maxn];   int32_t main() {     ios::sync_with_stdio(0);     cin.tie(0);     cin >> d >> s;     for (int i = 0; i <= (d + 1) * (s + 1); i++) dp[i] = make_pair(-1, 0);     queue<int> q;     q.push(0);     while (!q.empty()) {       int now = q.front();       int sum = now / d, r = now % d;       q.pop();       for (int i = 0; i < 10; i++) {         if (sum + i <= s && (dp[(sum + i) * d + (r * 10 + i) % d].first == -1)) {           dp[(sum + i) * d + (r * 10 + i) % d] = make_pair(now, i);           q.push((sum + i) * d + (r * 10 + i) % d);         }       }     }     int now = s * d;     if (dp[now].first == -1)       return cout << -1 <<   n , 0;     else {       vector<int> v;       while (now) {         v.push_back(dp[now].second);         now = dp[now].first;       }       reverse((v).begin(), (v).end());       for (int i : v) cout << i;       cout <<   n ;     }   }   