uva 11549

#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>#include<sstream>#include<set>using namespace std;int n, k;set<int> s;int next(int a){stringstream ss;ss << (long long) k*k;string s = ss.str();if(s.length() > n) s = s.substr(0, n);int ret;stringstream ss2(s);ss2 >> ret;return ret;}int main(){int T;scanf("%d", &T);while(T--){s.clear();scanf("%d%d", &n, &k);int ans = 0;while(!s.count(k)){s.insert(k);ans = max(ans, k);k = next(k);}printf("%d\n", ans);}return 0;}