UVA11549 Calculator Conundrum Calculator puzzle

It is thought that the violence of the solution time complexity should be very high, maybe the cycle will be relatively small bar

The better harvest is this Floyd.

　　

#include <Set>#include<cstdio>#include<iostream>#include<algorithm>using namespaceStd;typedefLong LongLL;Const intMAXN =100005;Const intINF =0x3f3f3f3f; LL POW10 (intN) {LL ans=1;  for(inti =1; i<=n;++i) ans*=Ten; returnans;} LL m; ll next (ll K) {k*=K;  while(k>=m) k/=Ten; returnK;}intMain () {//freopen ("In.txt", "R", stdin);    intT;SCANF ("%d",&T);  while(t--) {LL n,k; CIN>>n>>K; M=POW10 (n); LL K1= K,K2 = K,ans =K;  Do{K1=next (K1); K2= Next (K2); ans=Max (ANS,K2); K2= Next (K2); ans=Max (ANS,K2); }         while(k1!=K2); cout<<ans<<Endl; }    return 0;}

UVA11549 Calculator Conundrum Calculator puzzle