Find a Number

You are given two positive integers d and s. Find minimal positive integer n which is divisible by d and has sum of digits equal to s.

Input
The first line contains two positive integers d and s (1≤d≤500,1≤s≤5000) separated by space.

Output
Print the required number or -1 if it doesn't exist.

Examples
input
13 50
output
699998
input
61 2
output
1000000000000000000000000000001
input
15 50
output
-1

#include <iostream>
#include <cstring>
#include <queue>

using namespace std;

int  d,s;
bool vis[510][5010];

struct node
{
    int len;
    int sum;
    int mod;
    char ans[600]; 
    node()
    {
        len=-1,sum=0,mod=0;
        memset(ans,0,sizeof(ans));
    }
}head,tail;

void bfs()
{
    queue<node>q;
    q.push(head);

    while(!q.empty())
    {
        head=q.front();
        q.pop();

        if(head.mod==0&&head.sum==s)
        {
            cout<<head.ans<<endl;
            return;
        }

        for(int i=0;i<=9;i++)
        {
            tail=head;
            tail.len++;
            tail.sum+=i;
            tail.mod=(tail.mod*10+i)%d;
            tail.ans[tail.len]=i+'0';

            if(tail.sum<=s&&!vis[tail.mod][tail.sum])
            {
                vis[tail.mod][tail.sum]=1;
                q.push(tail);
            }
        }
    }
    cout<<-1<<endl;
}

int main()
{
    while(cin>>d>>s)
    {
        memset(vis,0,sizeof(vis));
        bfs();
    }
    return 0;
}