[UVa 11549]Calculator Conundrum

 1 //It is made by Awson on 2017.9.18
 2 #include <map>
 3 #include <set>
 4 #include <cmath>
 5 #include <ctime>
 6 #include <queue>
 7 #include <stack>
 8 #include <cstdio>
 9 #include <string>
10 #include <vector>
11 #include <cstdlib>
12 #include <cstring>
13 #include <iostream>
14 #include <algorithm>
15 #define LL long long
16 #define Max(a, b) ((a) > (b) ? (a) : (b))
17 #define Min(a, b) ((a) < (b) ? (a) : (b))
18 #define Abs(a) ((a) < 0 ? (-(a)) : (a))
19 using namespace std;
20 
21 int n;
22 LL lim, k;
23 
24 LL getnext(LL x) {
25     x *= x;
26     while (x/lim) x /= 10;
27     return x;
28 }
29 
30 int main() {
31     int t;
32     scanf("%d", &t);
33     while (t--) {
34         scanf("%d%lld", &n, &k);
35         lim = 1;
36         LL ans = k;
37         for (int i = 1; i <= n; i++)
38             lim *= 10;
39         LL k1 = k, k2 = k;
40         do {
41             k1 = getnext(k1); ans = Max(ans, k1);
42             k2 = getnext(k2); ans = Max(ans, k2);
43             k2 = getnext(k2); ans = Max(ans, k2);
44         }while (k2 != k1);
45         printf("%lld\n", ans);
46     }
47     return 0;
48 }