练习题【C | | Java】03_22

1. 判断一个数是否为奇数

#include<stdio.h>
int main()
{
	int num = 0;
	scanf("%d", &num);
	if (num % 2 == 0) {
		printf("%d 不是奇数",num);
	}
	else {
		printf("%d 是奇数", num);
	}
	return 0;
}

2. 输出1-100之间的奇数

int main() {
	int i = 0;
	for (i = 0; i < 100; i++) {
		if (i % 2 != 0) {
			printf("%d ", i);
		}
	}
	return 0;
}

1. 输入1-5，输出的是“weekday”;
2. 输入6-7，输出“weekend

int main() {
	int day = 0;
	scanf("%d", &day);
	switch (day)
	{
	case 1:
	case 2:
	case 3:
	case 4:
	case 5:
		printf("weekday");
		break;
	case 6:
	case 7:
		printf("weekend");
		break;
	}
	return 0;
}

一道笔试题：能循环几次？

//请问循环要循环多少次？
#include <stdio.h>
int main()
{
	int i = 0;
	int k = 0;
	for (i = 0, k = 0; k = 0; i++, k++)
		k++;
	return 0;
}

1. 计算 n的阶乘。

int main()
{
	int n = 0;
	scanf("%d", &n);
	int i = 0;
	int sum = 1;
	for (i = 1; i <= n; i++)
	{
		sum *= i;
	}
	printf("%d", sum);
	return 0;
}

2. 计算 1!+2!+3!+……+10!

int main()
{
	int n = 0;
	scanf("%d", &n);
	int sum = 1;
	int tem = 1;
	for (int i = 1; i <= n; i++)
	{
		tem *= i;
		sum += tem;
	}
	printf("%d", sum);
	return 0;
}

3. 在一个有序数组中查找具体的某个数字n。

int main()
{
	int n = 0;
	scanf("%d", &n);
	int arr[] = { 1,2,3,4,5,6,7,8,9,100 };
	int left = 0;
	int right = sizeof(arr) / sizeof(arr[0]) - 1;
	while (right > left)
	{
		int mid = (right + left) / 2;
		if (arr[mid] > n)
		{
			right = mid;
			right--;
		}
		else if (arr[mid] < n)
		{
			left = mid;
			left++;
		}
		else
		{
			printf("%d", mid);
			break;
		}
	}
	return 0;
}

4. 编写代码，演示多个字符从两端移动，向中间汇聚。

#include<Windows.h>
int main()
{
	char arr1[] = { "##############################" };
	char arr2[] = { "     welcome to my boke       " };
	int left = sizeof(arr1) / sizeof(arr1[0]) - 1;
	int right = 0;
	printf("%s\n", arr1);
	while (left >= right)
	{
		arr1[left] = arr2[left];
		arr1[right] = arr2[right];
		right++;
		left--;
		printf("%s\n", arr1);
		Sleep(1000);
	}
	return 0;
}

#include<Windows.h>
int main()
{
	char arr1[] = { "##############################" };
	char arr2[] = { "     welcome to my boke       " };
	int right = 0;
	for (int left = sizeof(arr1) / sizeof(arr1[0]) - 1; left >= right; right++, left--)
	{
		arr1[left] = arr2[left];
		arr1[right] = arr2[right];
		printf("%s\n", arr1);
		Sleep(1);
	}
	return 0;
}