#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
//斐波那契数列
int main()
{
int N = 0;
scanf("%d",&N);
int arr[100] = { 0 };
arr[0] = 0;
arr[1] = 1;
int i = 0;
for (i =2; i < 100; i++)
{
arr[i] = arr[i - 1] + arr[i - 2];
}
int j = 0;
for (j = 0; j < 99; j++)
{
if (N >= arr[j] && N <= arr[j + 1])
{
int a = arr[j + 1] - N;
int b = (N - arr[j]);
printf("%d", a >= b ? b : a);
break;
}
}
return 0;
}
第二题
//替换空格
void tihuan(char * arr,int sz)
{
char* cur = arr;
int count = 0;
while (*cur)
{
if (*cur == ' ')
{
count++;
}
cur++;
}
int end = sz - 1;
int end2 = sz + count * 2 - 1;
while (end!=end2)
{
if (arr[end] != ' ')
{
arr[end2--] = arr[end--];
}
else
{
end--;
arr[end2--] = '0';
arr[end2--] = '2';
arr[end2--] = '%';
}
}
}
int main()
{
char arr[100] = "hello word";
int sz = strlen(arr);
tihuan(arr,sz);
printf("%s\n",arr);
return 0;
}