C语言习题积累（待更新）

最新推荐文章于 2024-05-23 00:22:50 发布

请叫我左护法

最新推荐文章于 2024-05-23 00:22:50 发布

阅读量82

点赞数

分类专栏： C语言编程文章标签： c语言算法

本文链接：https://blog.csdn.net/qq_43240887/article/details/120473503

版权

C语言编程专栏收录该内容

11 篇文章 0 订阅

订阅专栏

文章目录

KiKi判断上三角矩阵

#include <stdio.h>
int main()
{
	int n = 0;
	int arr[10][10] = {0};
	int flag = 1;
	scanf("%d", &n);
	int i = 0;
	for (i=0; i<n; i++)
	{
		int j = 0;
		for (j=0; j<n; j++)
		{
			scanf("%d", &arr[i][j]);
		}
	}
	for (i=0; i<n; i++)
	{
		for (j=0; j<n; j++)
		{
			if (i > j && arr[i][j] != 0)
			{
				flag = 0;
			}
		}
	}
	if (flag)
	{
		printf("YES\n");
	}
	else
	{
		printf("NO\n");
	}
	return 0;
}

KiKi去重整数并排序

#include <stdio.h>
int main()
{
	int n = 0;
	int arr[1001] = {0};
	scanf("%d", &n);
	int i = 0;
	int tmp = 0;
	for (i=0; i<n; i++)
	{
		scanf("%d", &tmp);
		arr[tmp] = tmp;
	}
	for (i=0; i<1001; i++)
	{
		if (arr[i] != 0)
			printf("%d ", arr[i]);
	}
	return 0;
}

小乐乐与字符串

#include <stdio.h>
int main()
{
	char arr[8000];
	int c = 0;
	int ch = 0;
	int chn = 0;
	scanf("%s", arr);
	char* p = arr;
	while (*p != '\0')
	{
		if (*p == 'C')
			c++;
		if (*p == 'H')
			ch = ch + c;
		if (*p == 'N')
			chn = chn + ch;
	}
	printf("%d\n", chn);
	return 0;
}

小乐乐与序列

//这里用两种方法，虽然有一种比较麻烦，但是可以锻炼思维
#include <stdio.h>
int main()
{
	int n = 0;
	int arr[100001] = {0};
	scanf("%d", &n);
	int i = 0;
	int tmp = 0;
	for (i=0; i<n; i++)
	{
		scanf("%d", tmp);
		arr[tmp] = tmp;
	}
	for (i=0; i<=n; i++)
    {
    	if (arr[i] != 0)
    	{
    		printf("%d ", arr[i]);
    	}
    }
    return 0;
}

#include <stdio.h>
int main()
{
	int n = 0;
	int arr[10000] = {0};
	scanf("%d", &n);
	int i = 0;
	for (i=0; i<n; i++)
	{
		scanf("%d", &arr[i]);
	}
	for (i=0; i<n; i++)
	{
		int j = 0;
		for (j=i+1; j<n; j++)
		{
			if (arr[j] == arr[i])
			{
				int k = 0;
				for (k=j; k<n-1; k++)
				{
					arr[k] = arr[k+1];
				}
			}
			j--;
			n--;
		}
	}
	for (i=0; i<n-1; i++)
	{
		for (j=n-1; j>0; j--)
		{
			if (arr[j] < arr[j-1])
			{
				int tmp = arr[j];
				arr[j] = arr[j-1];
				arr[j-1] = tmp;
			}
		}
	}
	for (i=0; i<n; i++)
	{
		printf("%d ", arr[i]);
	}
	return 0;
}

小乐乐走台阶

//用递归实现
#include <stdio.h>

int Fib(int n)
{
	if (n <= 2)
		return n;
	else
		return Fib(n-1) + Fib(n-2);
}

int main()
{
	int n = 0;
	scanf("%d", &n);
	int ret = Fib(n);
	return 0;
}

小乐乐改数字

#include <stdio.h>
int main()
{
	int sum = 0;
	int i = 0;
	while (n)
	{
		int m = n % 10;
		if (m % 2 == 0)
		{
			m = 0;
		}
		else
		{
			m = 1;
		}
		sum = sum + m * pow(10, i)
		i++;
		n /= 10;
	}
	printf("%d\n", sum);
	return 0;
}

小乐乐定闹钟

#include <stdio.h>
int main()
{
	int h = 0;
	int m = 0;
	int k = 0;
	scanf("%d:%d %d", &h, &m, &k);
	h = (h + (m + k) / 60) % 24;
	m = (m + k) % 60;
	printf("%02d:%d\n", h, m);
	return 0;
}

小乐乐与欧几里得

#include <stdio.h>
int main()
{
	long long n = 0;
	long long m = 0;
	long long max = 0;
	long long min = 0;
	scanf("%lld %lld", &n, &m);
	long long n1 = n;
	long long m1 = m;
	while (n % m)
	{
		long long tmp = n % m;
		n = m;
		m = tmp;
	}
	max = m;
	min = (n1 * m1) / max;
	printf("%lld\n", min + max);
	return 0;
}

小乐乐与进制转换

#include <stdio.h>
int main()
{
	int n = 0;
	scanf("%d", &n);
	int arr[100] = {0};
	int i = 0;
	while (n)
	{
		arr[i] = n % 6;
		n /= 6;
		i++;
	}
	int j = 0;
	for (j=i-1; j>=0; j--)
	{
		printf("%d", arr[j]);
	}
	return 0;
}

井字棋

#include <stdio.h>
int main()
{
	char arr[3][3];
	int i = 0;
	int j = 0;
	char flag = 'O';
	for (i=0; i<3; i++)
	{
		for (j=0; j<3; j++)
		{
			scanf("%c", &arr[i][j]);
			getchar();
		}
	}
	for (j=0; j<3; j++)
	{
		if (arr[0][j] == arr[1][j] && arr[1][j] == arr[2][j] && arr[1][j] == 'K')
			flag = 'K';
		if (arr[0][j] == arr[1][j] && arr[1][j] == arr[2][j] && arr[1][j] == 'B')
			flag = 'B';
	}
	for (i=0; i<3; i++)
	{
		if (arr[i][0] == arr[i][1] && arr[i][1] == arr[i][2] && arr[i][1] == 'K')
			flag = 'K';
		if (arr[i][0] == arr[i][1] && arr[i][1] == arr[i][2] && arr[i][1] == 'B')
			flag = 'B';
	}
	if (arr[0][0] == arr[1][1] && arr[1][1] == arr[2][2] && arr[1][1] == 'K')
		flag = 'K';
	if (arr[0][0] == arr[1][1] && arr[1][1] == arr[2][2] && arr[1][1] == 'B')
		flag = 'B';
	if (arr[0][2] == arr[1][1] && arr[1][1] == arr[2][0] && arr[1][1] == 'K')
		flag = 'K';
	if (arr[0][2] == arr[1][1] && arr[1][1] == arr[2][0] && arr[1][1] == 'B')
		flag = 'B';
	if (flag == 'K')
		printf("KiKi wins!\n");
	else if (flag == 'B')
		printf("BoBo wins!\n");
	else
	printf("No winner!\n");
	return 0;
}

#include <stdio.h>
int main()
{
	char arr[3][3];
	int i = 0;
	char flag = 'O';
	for (i=0; i<3; i++)
	{
		int j = 0;
		for (j=0; j<3; j++)
		{
			scanf("%c", &arr[i][j]);
			getchar();
		}
	}
	for (i=0; i<3; i++)
	{
		if (arr[0][i] == arr[1][i] && arr[1][i] == arr[2][i] && arr[1][i] != 'O')
			flag = arr[1][i];
	}
	for (i=0; i<3; i++)
	{
		if (arr[i][0] == arr[i][1] && arr[i][1] == arr[i][2] && arr[i][1] != 'O')
			flag = arr[i][1];
	}
	if (arr[0][0] == arr[1][1] && arr[1][1] == arr[2][2] && arr[1][1] != 'O')
		flag = arr[1][1];
	if (arr[0][2] == arr[1][1] && arr[1][1] == arr[2][0] && arr[1][1] != 'O')
		flag = arr[1][1];
	if (flag == 'K')
		printf("KiKi wins!\n");
	else if (flag == 'B')
		printf("BoBo wins!\n");
	else
	printf("No winner!\n");
	return 0;
}

杨辉三角

#include <stdio.h>
int main()
{
	int n = 0;
	scanf("%d", &n);
	int arr[30][30] = {0};
	int i = 0;
	int j = 0;
	for (i=0; i<n; i++)
	{
		for (j=0; j<n; j++)
		{
			if (j == 0 || i == j)
			{
				arr[i][j] = 1;
			}
			if (i >= 2 && j >= 0)
			{
				arr[i][j] = arr[i-1][j] + arr[i-1][j-1];
			}
		}
	}
	for (i=0; i<n; i++)
	{
		for (j=0; j<i+1; j++)
		{
			printf("%5d", arr[i][j]);
		}
		printf("\n");
	}
	return 0;
}

矩阵转置

#include <stdio.h>
int main()
{
	int n = 0;
	int m = 0;
	int arr1[10][10] = {0};
	int arr2[10][10] = {0};
	scanf("%d %d", &n, &m);
	int i = 0;
	int j = 0;
	for (i=0; i<n; i++)
	{
		for (j=0; j<m; j++)
		{
			scanf("%d", &arr1[i][j]);
			arr2[j][i] = arr1[i][j];
		}
	}
	for (i=0; i<m; i++)
	{
		for (j=0; j<n; j++)
		{
			printf("%d ", arr2[i][j]);
		}
		printf("\n");
	}
	return 0;
}

矩阵交换

#include <stdio.h>
int main()
{
	int n = 0;
	int m = 0;
	int arr[10][10] = {0};
	scanf("%d %d", &n, &m);
    int i = 0;
    int j = 0;
    for (i=0; i<n; i++)
    {
    	for (j=0; j<m; j++)
    	{
    		scanf("%d", &arr[i][j]);
    	}
    }
    int k = 0;
    char t;
    int a = 0;
    int b = 0;
    scanf("%d", &k);
    while (k)
    {
    	getchar();
    	scanf("%c %d %d", &t, &a, &b);
    	if (t == 'r')
    	{
    		for (i=0; i<m; i++)
    		{
    			int tmp = arr[a-1][i];
    			arr[a-1][i] = arr[b-1][i];
    			arr[b-1][i] = tmp;
    		}
    	}
    	if (t == 'c')
    	{
    		for (i=0; i<n; i++)
    		{
    			int tmp = arr[i][a-1];
    			arr[i][a-1] = arr[i][b-1];
    			arr[i][b-1] = tmp;
    		}
    	}
    	k--;
    }
    for (i=0; i<n; i++)
    {
    	for (j=0; j<m; j++)
    	{
    		printf("%d ", arr[i][j]);
    	}
    	printf("\n");
    }
    return 0;
}

有序序列判断

#include <stdio.h>
int main()
{
	int arr[50] = {0};
	int n = 0;
	int flag1 = 0;
	int flag2 = 0;
	scanf("%d", &n);
	int i = 0;
	for (i=0; i<n; i++)
	{
		scanf("%d", &arr[i]);
		if (i > 0)
		{
			if (arr[i] >= arr[i-1])
			{
				flag1 = 1;
			}
			else
			{
				flag2 = 1;
			}
		}
	}
	if (flag1 + flag2 == 1)
	{
		printf("sorted\n");
	}
	else
	{
		printf("unsorted\n");
	}
	return 0;
}

在这里插入图片描述

有序序列插入一个整数

#include <stdio.h>
int main()
{
	int n = 0;
	int arr[51] = {0};
	int k = 0;
	scanf("%d", &n);
	int i = 0;
	for (i=0; i<n; i++)
	{
		scanf("%d", &arrr[i]);
	}
	scanf("%d", &k);
	for (i=n-1; i>=0; i--)
	{
		if (arr[i] > k)
		{
			arr[i+1] = arr[i];
		}
		else
		{
			arr[i+1] = k;
		}
	}
	if (i < 0)
	{
		arr[0] = k;
	}
	for (i=0; i<n+1; i++)
	{
		printf("%d ", arr[i]);
	}
	return 0;
}

在这里插入图片描述

序列中删除指定数字

#include <stdio.h>
int main()
{
	int n = 0;
	int arr[50] = {0};
	int k = 0;
	scanf("%d", &n);
	int i = 0;
	for (i=0; i<n; i++)
	{
		scanf("%d", &arr[i]);
	}
	scanf("%d", &k);
	for (i=0; i<n; i++)
	{
		if (arr[i] != k)
		{
			arr[j] = arr[i];
			j++;
		}
	}
	for (i=0; i<j; i++)
	{
		printf("%d ", arr[i]);
	}
	return 0;
}

在这里插入图片描述

序列中整数去重

#include <stdio.h>
int main()
{
	int n = 0;
	int arr[50] = {0};
	scanf("%d", &n);
	int i = 0;
	for (i=0; i<n; i++)
	{
		scanf("%d", &arr[i]);
	}
	for (i=0; i<n; i++)
	{
		int j = 0;
		for (j=i+1; j<n; j++)
		{
			if (arr[j] == arr[i])
			{
				int k = 0;
				for (k=j; k<n; k++)
				{
					arr[k] = arr[k+1];
				}
				j--;
				n--;
			}
		}
	}
	for (i=0; i<n; i++)
	{
		printf("%d ", arr[i]);
	}
	return 0;
}

在这里插入图片描述

有序序列合并

#include <stdio.h>
int main()
{
	int n = 0;
	int m = 0;
	int arr1[100] = {0};
    int arr2[100] = {0};
    int arr3[200] = {0};
	scanf("%d %d", &n, &m);
	int i = 0;
	int j = 0;
	int k = 0;
	for (i=0; i<n; i++)
	{
		scanf("%d", &arr1[i]);
	}
	for (i=0; i<m; i++)
	{
		scanf("%d", &arr2[i]);
	}
	i = 0;
	while (i<n && j<m)
	{
		if (arr1[i] < arr2[j])
		{
			arr3[k++] = arr1[i++];
		}
		else
		{
			arr3[k++] = arr2[j++];
		}
	}
	if (i == n)
	{
		for (; j<m; j++)
		{
			arr3[k++] = arr2[j];
		}
	}
	else
	{
		for (; i<n; i++)
		{
			arr3[k++] = arr1[i];
		}
	}
	for (i=0; i<k; i++)
	{
		printf("%d ", arr3[i]);
	}
	return 0;
}

在这里插入图片描述

请叫我左护法

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
C语言习题积累（待更新）

KiKi判断上三角矩阵 - 简单题#include <stdio.h>int main(){ int n = 0; int arr[10][10] = {0}; int flag = 1; scanf("%d", &n); int i = 0; for (i=0; i<n; i++) { int j = 0; for (j=0; j<n; j++) { scanf("%d", &arr[i][j]); } } for (i
复制链接

扫一扫