c语言学习日志3.28-CSDN博客

本文链接：https://blog.csdn.net/weixin_68204238/article/details/129823549

1.计算1-1/3+1/5-1/7+1/9-....前n项的和

#include<stdio.h>
int main()
{
	int i = 0;
	int n;
	int t = 1;
	int flag=1;
	double s = 0.0;
	printf("请输入正整数n:\n");
	scanf_s("%d", &n);
	for (i = 1;i <= n;i++)
	{	
		s += flag * (1.0 /t);
		t = t + 2;
		flag = -flag;
	}
	printf("%lf", s);
	return 0;
}

（另一解法）

#include<stdio.h>
int main()
{
	int n, i;
	double s = 0, flag = 1;
	printf("输入正整数n:\n");
	scanf_s("%d", &n);
		for (i = 1;i <= 2 * n - 1;i =i+ 2)
		{
			s = s + flag / i;
			flag = -flag;
		}
		printf("s=%f\n", s);
		return 0;
}

2. 计算1/1-1/2+1/3-1/4+1/5-1/6....+1/99-1/100的值

#include<stdio.h>
int main()
{
	int i = 0;
	int flag = 1;
	float sum = 0.0;
	for (i = 1;i <= 100;i++)
	{
		sum +=flag*( 1.0 / i); 
		flag = -flag;
		 
	}
	printf("%lf", sum);
	return 0;
}

3.找最大值

#include<stdio.h>
int main()
{
	int arr[] = { 12,50,67,47,32,7,66,32,22,77,34 };
	int max = arr[0];
	int i = 0;
	int sz = sizeof(arr) / sizeof(arr[0]);
	for (i = 0;i < sz;i++)
	{
		if (arr[i] > max)
		{
			max = arr[i];
		}
	}
	printf("max=%d\n", max);
	return 0;
}

4.演示多个字符从两端移动，向中间汇聚

#include<stdio.h>
#include<string.h>
#include<windows.h>
int  main()
{
	char arr1[] = "1111111111111111111111111111";
	char arr2[] = "############################";
	int left = 0;
	//int right = sizeof(arr1) / sizeof(arr1[0] - 2);
	int right = strlen(arr1) - 1;	
	while (left <= right)
	{
		arr2[left] = arr1[left];
		arr2[right] = arr1[right];
		printf("%s\n", arr2);
		Sleep(1000);//每1000ms打印一次
		left++;
		right--;
	}
	return 0;
}

5.输出1000-2000年内的闰年

#include<stdio.h>
int main()
{
	int year = 0;
	int count = 0;
	for (year = 1000;year <= 2000;year++)
	{
		if (year % 4 == 0 && year % 100 != 0 || year % 400 == 0)
		{
			printf("%d ", year);
			count++;
		}
	}
	printf("\ncount:%d\n", count);
		return 0;
}

6.打印九九乘法表

#include<stdio.h>
int main()
{
	int i = 0;
	for (i = 1;i <= 9;i++)
	{
		int j = 1;
		for (j = 1;j <= i;j++)
		{
			printf("%d*%d=%-2d  ", j, i, i * j);
		}
	printf("\n");
	}
	return 0;
}