experiment3
任务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;
}
+运行截图

+问题回答
1.给不同的分数划分等级
2.改后代码若输入一个数值后不会停止而会继续执行switch里的语句直到default
任务2
+源代码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;
}
+运行截图

+问题回答
1.计算一个数的各位数之和
2.可以,源代码是逐位相加利用循环而改之后的代码是递归法计算。
任务3
++源代码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;
}
}
+运行截图

+问题回答
1.计算x的n次方
2.递归出口是x等于0时

3.任然正确,满足运算规律源代码只调用一次x,(n/2)而改后代码却要重复调用源代码调用5此改后调用31次
任务4
源代码task4.c
#include <stdio.h>
int classify_triangle(int a, int b, int c);
int main(void)
{
int a, b, c;
while (scanf("%d %d %d", &a, &b, &c) == 3)
{
int ret = classify_triangle(a, b, c);
switch(ret)
{
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
源代码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 res = 1;
int i = 1;
for(i;i<=m;i++){
res = res*n / i;
n--;
}
}
#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 res = 1;
// int i = 1;
// for(i;i<=m;i++){
// res = res*n / i;
// n--;
// }
//}
int func(int n,int m){
if(m>n){
return 0;
}
if(m == n || m == 0){
return 1;
}
return func(n-1,m) + func(n-1,m-1);
}
+测试截图


任务6
源代码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){
int t;
while(b != 0){
t =a % b;
a = b;
b = t;
}
b = c;
while(b != 0){
t =a % b;
a= b;
b = t;
}
return a;
}
+测试截图

任务7
源代码task7.c
#include <stdio.h>
#include <stdlib.h>
int print_charman(n);
int main() {
int n;
printf("Enter n: ");
scanf("%d", &n);
print_charman(n);
return 0;
}
int print_charman(n){
int i, j, k;
for(i = n; i >= 1; i--)
{
for(k = 1; k <= n - i; k++)
{
printf("\t");
}
for(j = 1; j <= 2*i - 1; j++)
{
printf(" 0\t");
}
printf("\n");
for(k = 1; k <= n - i; k++)
{
printf("\t");
}
for(j = 1; j <= 2*i - 1; j++)
{
printf("<H>\t");
}
printf("\n");
for(k = 1; k <= n - i; k++)
{
printf("\t");
}
for(j = 1; j <= 2*i - 1; j++)
{
printf("I I\t");
}
printf("\n");
}
}
+测试截图


浙公网安备 33010602011771号