Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <map>
- #include <set>
- #include <sstream>
- #include <queue>
- using namespace std;
- #define ll long long
- vector <ll> res;
- void generar()
- {
- ll r = 9;
- int tam = 1;
- queue <pair<ll, int> > cola;
- cola.push({r, tam});
- while(cola.size())
- {
- r = cola.front().first;
- tam = cola.front().second;
- cola.pop();
- if(tam)
- {
- for(int i=1; i<=500 && i<=r; i++)
- if(r%i == 0 && res[i] == 0)
- res[i] = r;
- }
- if(tam+1 < 14)
- {
- cola.push({r*10, tam+1});
- cola.push({r*10 + 9, tam+1});
- }
- }
- }
- int main()
- {
- res = vector <ll> (600, 0);
- generar();
- int tc, n;
- cin >> tc;
- while(tc--)
- {
- cin >> n;
- cout << res[n] << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment