题解 | #兔子的序列#
兔子的序列
https://www.nowcoder.com/practice/55fc2ebad3fd444bbb1754ba1b259762
#include <stdio.h>
#include <math.h>
int main() {
int n,max=0;
scanf("%d",&n);
while(~scanf("%d",&n))
{
if(sqrt(n)!=(int)sqrt(n)&&n>max)
max=n;
}
printf("%d\n",max);
return 0;
}
