uva 11549 - Calculator Conundrum 模拟

      Floyd判圈算法，好厉害的样子

      用sscanf要2s，速度太低，不过比较好写，要注意是字符数组要开19以上 

/*
author:jxy
lang:C/C++
university:China,Xidian University
**If you need to reprint,please indicate the source**
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
int ans=0;
char s[21];
int n;
void next(int &k)
{
    long long t=(long long)k*k;
    sprintf(s,"%lld",t);
    if(strlen(s)>n)s[n]='\0';
    sscanf(s,"%d",&k);
    ans=max(ans,k);
    return;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int k;
        scanf("%d%d",&n,&k);
        ans=k;
        int k1=k;
        do
        {
            next(k);
            next(k);
            next(k1);
        }while(k1!=k);
        printf("%d\n",ans);
    }
}