c语言编写以下要求封装成函数放到一个程序当中:1while语句实现求1+2+……+100的和。2随意输入一个整数n求1—n之间的奇数和和偶数和。3求1+2+3+4……+100的和4求n的阶乘5编程序统计并输出200以内所有能同时被7和3整除的数及其数量。6定义一个数组a10并赋初值0~9反序输出。7一个小组学生共10人输入他们的成绩计算并输出小组总成绩及平均成绩。8封装一个函数并且在主函数中进行调
1.求1-100的和
int sum1to100() {
int sum = 0;
int i = 1;
while (i <= 100) {
sum += i;
i++;
}
return sum;
}
2.求1-n的奇数和和偶数和
void sumOfOddAndEven(int n) {
int oddSum = 0, evenSum = 0;
int i = 1;
while (i <= n) {
if (i % 2 == 0) {
evenSum += i;
} else {
oddSum += i;
}
i++;
}
printf("1-%d之间奇数和为:%d,偶数和为:%d\n", n, oddSum, evenSum);
}
3.求1-100的和
int sum1to100() {
int sum = 0;
int i = 1;
while (i <= 100) {
sum += i;
i++;
}
return sum;
}
4.求n的阶乘
int factorial(int n) {
int result = 1;
int i = 1;
while (i <= n) {
result *= i;
i++;
}
return result;
}
5.统计并输出200以内所有能同时被7和3整除的数及其数量
void countNum() {
int count = 0;
for (int i = 1; i <= 200; i++) {
if (i % 3 == 0 && i % 7 == 0) {
printf("%d\n", i);
count++;
}
}
printf("200以内能同时被3和7整除的数的数量为:%d\n", count);
}
6.反序输出数组a[10]
void reverseArray() {
int a[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
for (int i = 9; i >= 0; i--) {
printf("%d ", a[i]);
}
printf("\n");
}
7.计算小组总成绩及平均成绩
void countScore() {
int scores[10];
int sum = 0;
for (int i = 0; i < 10; i++) {
printf("请输入第%d个学生的成绩:", i+1);
scanf("%d", &scores[i]);
sum += scores[i];
}
float average = (float) sum / 10;
printf("小组总成绩为:%d,平均成绩为:%.2f\n", sum, average);
}
8.求两个整数的最大值
int getMax(int a, int b) {
return a > b ? a : b;
}
9.厘米转换为英寸
float cm2inch(float cm) {
return cm / 2.54;
}
10.判断一个数是否是素数
bool isPrime(int n) {
if (n <= 1) {
return false;
}
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
11.反向输出字符串
void reverseString(char* str) {
int len = strlen(str);
for (int i = len-1; i >= 0; i--) {
printf("%c", str[i]);
}
printf("\n");
}
12.从1~100内随机输出5个不重复的数
void randomNum() {
srand(time(NULL));
int nums[5] = {0};
int count = 0;
while (count < 5) {
int num = rand() % 100 + 1;
bool flag = true;
for (int i = 0; i < count; i++) {
if (nums[i] == num) {
flag = false;
break;
}
}
if (flag) {
nums[count] = num;
count++;
}
}
for (int i = 0; i < 5; i++) {
printf("%d ", nums[i]);
}
printf("\n");
}
13.暴力破解8位数密码
void crackPassword() {
int password = 12345678;
int count = 0;
for (int i = 0; i < 100000000; i++) {
if (i == password) {
printf("密码破解成功,密码为:%d\n", i);
break;
}
count++;
}
printf("破解密码尝试了%d次\n", count);
}
14.冒泡排序法实现5,81,65,9,10的由低到高的排序
void bubbleSort(int arr[], int len) {
for (int i = 0; i < len-1; i++) {
for (int j = 0; j < len-1-i; j++) {
if (arr[j] > arr[j+1]) {
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
}
void test() {
int arr[] = {5, 81, 65, 9, 10};
int len = sizeof(arr) / sizeof(arr[0]);
bubbleSort(arr, len);
for (int i = 0; i < len; i++) {
printf("%d ", arr[i]);
}
}
``
原文地址: https://www.cveoy.top/t/topic/gHW9 著作权归作者所有。请勿转载和采集!