#include <stdio.h>
int main()
{
int n = 0;
while (scanf("%d", &n)!=EOF)
{
int a = 0;
int b = 1;
int c = 1;
int left = 0;
int right = 0;
while (1)
{
a = b;
b = c;
c = a + b;
if (c < n)
{
right = n - c;
}
else
{
left = c - n;
break;
}
}
if (right >= left)
{
printf("%d", left);
}
else
{
printf("%d", right);
}
}
return 0;
}
求一个数到斐波那契数列的最少步骤
最新推荐文章于 2019-11-13 19:04:59 发布