实验三

1.task1.c

#include <stdio.h>
char score_to_grade(int score);
int main() {
    int score;
    char grade;
    while(scanf("%d", &score) != EOF) {
        grade = score_to_grade(score);
        printf("分数: %d, 等级: %c\n\n", score, grade);
    }
    return 0;
}
char score_to_grade(int score) {
    char ans;
    switch(score/10) {
    case 10:
    case 9:   ans = 'A'; break;
    case 8:   ans = 'B'; break;
    case 7:   ans = 'C'; break;
    case 6:   ans = 'D'; break;
    default:  ans = 'E';
    }
    return ans;
}

  

问题一:将分数转换成等级,形参类型是整形int,返回值类型是字符类型

问题二:无论输入的分数为多少,等级总是显示为E

    并且双引号代表字符串类型,而ans是char类型,需要用单引号

image

 

image

task2.c

#include <stdio.h>
int sum_digits(int n);
int main() {
    int n;
    int ans;
    while(printf("Enter n: "), scanf("%d", &n) != EOF) {
        ans = sum_digits(n);
        printf("n = %d, ans = %d\n\n", n, ans);
    }
    return 0;
}
int sum_digits(int n) {
    int ans = 0;

    while(n != 0) {
        ans += n % 10;
        n /= 10;
    }
    return ans;
}

  

image

 问题一:sum_digits的功能是计算输入数字n的各位数之和

问题二:可以

问题三:方法一中是逐位计算,通过一直取余,得到每个位数,然后相加。方法二中则是通过递归算法,嵌套调用函数,实现计算

image

 task3.c

#include <stdio.h>
int power(int x, int n);
int main() {
    int x, n;
    int ans;
    while(printf("Enter x and n: "), scanf("%d%d", &x, &n) != EOF) {
        ans = power(x, n); 
        printf("n = %d, ans = %d\n\n", n, ans);
    }
    return 0;
}
int power(int x, int n) {
    int t;
    if(n == 0)
        return 1;
    else if(n % 2)
        return x * power(x, n-1);
    else {
        t = power(x, n/2);
        return t*t;
    }
}

  

image

 问题一:power的功能是计算出x的n次方

问题二:是递归函数。当n!=1的时候,power(x,n)=x*power(x,n-1)(n为奇数的时候)或者power(x,n/2)*power(x,n/2)(n为偶数的时候)

 问题三:1.仍然正确,在源代码中,将t赋值为power(x,n/2),随后return t*t,而在修改后的代码中,舍去了赋值t的步骤,直接return  power(x,n/2)*power(x,n/2),这两个代码的运行结果是一样的

2.与原写法相比,修改后的代码性能变差,源代码数据(3,16)的递归调用次数为4次,而修改后的代码数据(3,16)的递归调用次数为30次

task4.c

#include <stdio.h>
int classify_triangle(int a,int b,int c);
int main(){
	int a,b,c;
	while(scanf("%d %d %d",&a,&b,&c)!=EOF){
		switch(classify_triangle(a,b,c)){
			case 0:printf("不能构成三角形\n");break;
			case 1:printf("普通三角形\n");break;
			case 2:printf("等边三角形\n");break;
			case 3:printf("等腰三角形\n");break;
			case 4:printf("直角三角形\n");break;
		}
	}
}
int classify_triangle(int a,int b,int c){
	if(a+b<=c ||b+c<=a ||a+c<=b){
		return 0;
	}
	else if(a==b || b==c ||a==c){
		if (a==b &&b==c){
			return 2;
		}
		else{
			return 3;
		}
	}
	else if(a*a+b*b==c*c||a*a+c*c==b*b||b*b+c*c==a*a){
		return 4;
	}
	else{
		return 1;
	}
}

  

image

 task5.c

 迭代

#include <stdio.h>
int func(int n, int m);   // 函数声明

int main() {
    int n, m;
    int ans;

    while(scanf("%d%d", &n, &m) != EOF) {
        ans = func(n, m);   // 函数调用
        printf("n = %d, m = %d, ans = %d\n\n", n, m, ans);
    }
        
    return 0;
}
int func(int n,int m){
	int fenzi=1,fenmu1=1,fenmu2=1;
	for(int i=1;i<=n;i++){
		fenzi*=i;
	}
	for(int j=1;j<=m;j++){
		fenmu1*=j;
	}
	for(int k=1;k<=n-m;k++){
		fenmu2*=k;
	}
	return fenzi/(fenmu1*fenmu2);
}

  

image

 递归

#include <stdio.h>
int func(int n, int m);   // 函数声明

int main() {
    int n, m;
    int ans;

    while(scanf("%d%d", &n, &m) != EOF) {
        ans = func(n, m);   // 函数调用
        printf("n = %d, m = %d, ans = %d\n\n", n, m, ans);
    }
        
    return 0;
}
int func(int n,int m){
	if (m < 0 || m > n) return 0; 
	if (m == 0 || m == n) return 1; 
	return func(n - 1, m) + func(n - 1, m - 1);
}

  

image

 task6.c

#include <stdio.h>
int gcd(int a, int b, int c);
int main() {
    int a, b, c;
    int ans;
    while(scanf("%d%d%d", &a, &b, &c) != EOF) {
        ans = gcd(a, b, c);    
        printf("最大公约数: %d\n\n", ans);
    }
    return 0;
}
int gcd(int a, int b, int c) {
    if (a <= 0 || b <= 0 || c <= 0) 
        return 0;
    int i = a;               
    if (b < i) i = b;          
    if (c < i) i = c;
    for (; i >= 1; i--) {  
        if (a % i == 0 && b % i == 0 && c % i == 0)
            return i; 
    }
    return 1;
}

  

image

 task7.c

#include <stdio.h>
void print_charman(int n);
int main() {
    int n;
    printf("Enter n: ");
    scanf("%d", &n);
    print_charman(n);
    return 0;
}
void print_charman(int n) {
    int row, line, i, k;
    int count, indent;
    for (row = 0; row < n; row++) {
        count  = 2 * (n - row) - 1;
        indent = row * 10;
        for (line = 0; line < 3; line++) { 
            for (k = 0; k < indent; k++)  
                printf(" ");
            for (i = 0; i < count; i++) {  
                if (line == 0)
                    printf(" 0 ");  
                else if (line == 1)
                    printf("<H>"); 
                else
                    printf("I I");        
                if (i != count - 1) 
                    for (k = 0; k < 7; k++)
                        printf(" ");
            }
            printf("\n"); 
        }
        if (row != n - 1)  
            printf("\n");
    }
}

  

image

 

posted @ 2026-11-14 14:08  虞清筱  阅读(8)  评论(0)    收藏  举报