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