717 简单斐波那契
include[HTML_REMOVED]
include[HTML_REMOVED]
int main()
{
int n = 0, x = 0, y = 1, m = 0;
scanf(“%d”, &n);
printf(“0 “);
while (n > 1)
{
printf(“%d “, y);
m = y;
y = y + x;
x = m;
n–;
}
return 0;
}