AIGC标识 实验3

实验1

问题1:功能:接收一个整数类型的考试分数,将其转换成对应的等级字符(A、B、C、D、E)

形参类型:int(整型),参数名为 score
返回值类型:char(字符型),返回变量 ans
问题2:缺少 break 语句导致“穿透”
数据类型错误(双引号表示字符串)

实验2

问题1:功能: 计算并返回一个正整数 n 的各位数字之和

问题2:能实现同样的输出,第一个是迭代法(原代码中的 while 循环),第二个是递归法

实验3

问题1:功能:功能是计算并返回 x 的 n 次幂

问题2:
c062dc13961f3b2754a779c33ad4babf_720

问题3:仍然正确,原写法(使用变量 t): 每次偶数递归只计算一次子问题,修改后的写法: 每次偶数递归时,程序会重复计算两次同一个子问题

#实验4
##源代码
#include<stdio.h>
int classify_triangle(int a,int b,int c);
int main(){
  int a,b,c;
  int n;
  while(printf("Enter a,b and c"),scanf("%d%d%d",&a,&b,&c)!=EOF){
    n=classify_triangle(a,b,c);
    switch(n){
    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;}}
  return 0;}
int classify_triangle(int a, int b, int c) {
    if (a + b <= c || a + c <= b || b + c <= a) {
        return 0; }
    if (a == b && b == c) {
        return 2;}
    if (a * a + b * b == c * c || 
        a * a + c * c == b * b || 
        b * b + c * c == a * a) {
        return 4;}
    if (a == b || a == c || b == c) {
        return 3;}
    return 1;
}

![屏幕截图 2026-11-19 113759](https://img2024.cnblogs.com/blog/3861716/202611/3861716-20261119211648027-87213940.png)

```c
#实验5
##源代码1
#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 > n || m < 0) {
        return 0;
    }
    if (m == 0 || m == n) {
        return 1;}
    if (m > n / 2) {
        m = n - m;
    }
    long long ans = 1;
    for (int i = 1; i <= m; i++) {
        ans = ans * (n - i + 1) / i;
    }
    return (int)ans;
}
##源代码2
#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 > n || m < 0) {
        return 0;}
    if (m == 0 || m == n) {
        return 1;}
    return func(n - 1, m) + func(n - 1, m - 1);
}

![屏幕截图 2026-11-19 114534](https://img2024.cnblogs.com/blog/3861716/202611/3861716-20261119211701036-1844056047.png)

```c
#实验6
##源代码
#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) {
    int min = a;
    if (b < min) min = b;
    if (c < min) min = c;
    if (min <= 0) return 1; 
    for (int i = min; i >= 1; i--) {
        if (a % i == 0 && b % i == 0 && c % i == 0) {
            return i; 
        }
    }
    return 1; 
}

![d43544b561981f34abfda15029588e83](https://img2024.cnblogs.com/blog/3861716/202611/3861716-20261119211920062-1362256415.jpg)


#实验7
##源代码
#include <stdio.h>
#include <stdlib.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) {
    for (int i = 0; i < n; i++) {
        int count = 2 * (n - i) - 1;
        int indent = i * 8;
        for (int k = 0; k < indent; k++) printf(" ");
        for (int j = 0; j < count; j++) {
            if (j == count - 1) printf("0\n");
            else printf("0       ");
        }
        for (int k = 0; k < indent; k++) printf(" ");
        for (int j = 0; j < count; j++) {
            if (j == count - 1) printf("<H>\n");
            else printf("<H>     ");
        }
        for (int k = 0; k < indent; k++) printf(" ");
        for (int j = 0; j < count; j++) {
            if (j == count - 1) printf("I I\n");
            else printf("I I     ");
        }
        if (i < n - 1) {
            printf("\n");
        }
    }
}

![屏幕截图 2026-11-19 210419](https://img2024.cnblogs.com/blog/3861716/202611/3861716-20261119211737876-545715756.png)
posted @ 2026-11-19 21:19  沉默的日夕  阅读(5)  评论(0)    收藏  举报