【C语言刷题】

#include <stdio.h>//斐波那契数列打印出第n项
int Fib(int n)
{
	int a = 1;
	int b = 1;
	int c=1;
	while (n >2)
	{
		int c = a + b;
		a = b;
		b = c;
		n--;
	}
	return c;
}
int main()
{
	int x=1;
	int c=1;
	scanf_s("%d", &x);
	int r=Fib(x);
	printf("%d", r);
}

//输入两组数组，依次从小到大排序
#include <stdio.h>
int main()
{
	int n, m;
	scanf_s("%d", &n);
	scanf_s("%d", &m);
	int arr1[1000] = { 0 };
	int arr2[1000] = { 0 };
	for (int i = 0; i < n; i++)
	{
		scanf_s("%d", &arr1[i]);
	}
	for (int j = 0; j < m; j++)
	{
		scanf_s("%d", &arr2[j]);
	}
	int i = 0;
	int j = 0;
	while (i<n&&j<m)
	{
		if (arr1[i] < arr2[j])
		{
			printf("%d ", arr1[i]);
			i++;
		}
		else
		{
			printf("%d ", arr2[j]);
			j++;
		}
	}
	while(i<n)
	{
		printf("%d ", arr1[i]);
		i++;
	}
	while(j<m)
	{
		printf("%d ", arr2[j]);
		j++;
	}
}

#include<stdio.h>//打印出大写X,5行5列
int main()
{
	int arr[5][5] = { 0 };
	int i = 0;
	int j = 0;
	for (i = 0; i < 5; i++)
	{
		for (j = 0; j < 5; j++)
		{
			if (i == j || i + j == 4)
				printf("*");
			else {
				printf(" ");
			}
		}
		printf("\n");
	}
}

#include<stdio.h>//打印出大写X,n行n列
int main()
{
	int n;
	int i = 0;
	int j = 0;
	while (scanf("%d", &n) != EOF) {
		for (i = 0; i < n; i++)
		{
			for (j = 0; j < n; j++)
			{
				if (i == j || i + j == 4)
					printf("*");
				else {
					printf(" ");
				}
			}
			printf("\n");
		}
	}
	return 0;
}

//使用函数，实现数组操作
//1.实现函数init()初始化数组为全0
//2。实现print（）打印数组每个元素
//3,实现reserve（）函数完成数组元素逆置

#include<stdio.h>
void Init(int arr[], int len)
{
    for (int i = 0; i < len; i++)
    {
        arr[i] = i + 1;
    }
}
void Print(int arr[], int len)
{
    for (int i = 0; i < len; i++)
    {
        printf("%d ", arr[i]);
    }
    printf("\n");
}

void Reverse(int arr[], int len)
{
    int i = 0;
    int j = len - 1;
    while (i < j)
    {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
        i++;
        j--;
    }


}
int main()
{
    int arr[10] = { 0 };
    int len = sizeof(arr) / sizeof arr[0];
    Init(arr, len);
    Print(arr, len);
    Reverse(arr, len);
    Print(arr, len);

    return 0;

}

//for循环写斐波那契数列
#include<stdio.h>
int main()
{
	int f1 = 1;
	int f2 = 1;
	int f3 = 1;
	int n;
	scanf("%d", &n);
	for(int i = 2; i < n; i++)
    {
		f3 = f1 + f2;
		f1 = f2;
		f2 = f3;
	}
	printf("\n第%d项斐波那契数列的值为：%d", n, f3);
	return 0;
}

//递归法
#include<stdio.h>
int Fib(int n)
{
	if (n == 1 || n == 2)
		return 1;
	else
		return Fib(n - 1) + Fib(n - 2);
}
int main()
{
	int n, r = 0;
	scanf_s("%d", &n);
	for (int i = 1; i <=n; i++)
	{
		r = Fib(n+1);
	}
	printf("%d", r);
 }