完整代码已传至github:
https://github.com/frankRenlf/c_dailyWork.githttps://github.com/frankRenlf/c_dailyWork.git
int maxi(int a, int b, int n)
{
if (n - a > b - n)
{
return b - n;
}
return n - a;
}
int main()
{
int n = 0;
scanf("%d", &n);
int p1 = 0;
int p2 = 1;
int tmp = 0;
int i = 0;
while (n > p2)
{
tmp = p2;
p2 = p1 + p2;
p1 = tmp;
}
printf("%d\n", maxi(p1, p2, n));
return 0;
}