实验3
实验1
1源代码
点击查看代码
#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;
}
实验2
1源代码
点击查看代码
#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;
}

3结论:sum_digits 功能:递归计算一个正整数所有各位数字之和。能,本代码:先递归算高位的和,再加当前个位,反过来写法,先拿个位,再加上高位递归结果。数学上加法交换,总和不变,只是递归计算时相加顺序不同。
实验3
1源代码:
点击查看代码
#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;
}
}

实验4
1源代码
点击查看代码
#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)
{
int res = classify_triangle(a, b, c);
switch(res)
{
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 <= 0 || b <= 0 || c <= 0 || 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;
}

实验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, 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 - m)
m = n - m;
int res = 1;
for(int i = 1; i <= m; i++)
{
res = res * (n - m + i) / i;
}
return res;
}
截图

截图

点击查看代码
#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, 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-1) + func(n-1, m);
}
实验6
1源代码
点击查看代码
#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", ans);
}
return 0;
}
int gcd(int a, int b, int c)
{
int min = a;
if(b < min) min = b;
if(c < min) min = c;
for(int i = min; i >= 1; i--)
{
if(a % i == 0 && b % i == 0 && c % i == 0)
{
return i;
}
}
return 1;
}

实验7
1源代码
点击查看代码
#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 k = n; k >= 1; k--)
{
for(int i = 0; i < k; i++)
{
printf(" 0 ");
}
printf("\n");
for(int i = 0; i < k; i++)
{
printf(" <H> ");
}
printf("\n");
for(int i = 0; i < k; i++)
{
printf(" I I ");
}
printf("\n\n");
}
}
浙公网安备 33010602011771号