fork(2) download
#include<cstdio>
#include<cstring>
#include<queue>
#include<map>
#include<utility>
#include<iostream>
#define ll long long
#define rl(x) scanf("%lld",&x)
using namespace std;
long long bfs(long long n)
{
	ll n1,n2;
	map<ll,ll>mp;
	queue<ll>Q;
	Q.push(1);
	while(!Q.empty())
	{
		ll val=Q.front();
		Q.pop();
		if(val%n==0)
		return val;
		if(mp[val]!=1)
		{
			n1=val*10+1;
			n2=val*10;
			Q.push((n2));
			Q.push((n1));
			mp[val]=1;
		}
	}
	
}
int main()
{
	ll t;
	rl(t);
	while(t--)
	{
		long long n;
		rl(n);
		cout<<bfs(n)<<endl;
	}
} 
Success #stdin #stdout 0s 2868KB
stdin
3
17
11011
17
stdout
11101
11011
11101