题解 | #兔子的序列#

#include <stdio.h>
#include <math.h>
int main() {
    int a;
    int max = 0;
    scanf("%d",&a);
    while(a--)
    {
        int b = 0;
        scanf("%d",&b);
        if(sqrt(b)-(int)sqrt(b) != 0)
        {
             max = max > b? max:b;
        }

       
    }
    printf("%d",max);
    return 0;
}