所谓斐波那契数列指的是数列:1,1,2,3,5,8,13,21,……。即数列满足递推公式 F_{n+2} = F_{n+1} + F_{n},(F_1 = F_2 = 1)
#include <stdio.h>
#include<math.h>
int main()
{
int a,b,n;
double m;
for(a=1;a<=9;a++)
{
for(b=1;b<=9;b++)
{
n=a*1100+b*11;
m=sqrt(n);
if(floor(m+0.5)==m)printf("%d\n",n);
}
}
return 0;
}
`
`