- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
《计算机软件基础》补充教材 V2.1
K2-
4
n4[n] = i4; n6[n] = i6; n9[n] = i9; cost[n] = i4*c4 + i6*c6 + i9*c9; printf("cost = %2d*%2d+%2d*%2d+%2d*%2d = %2d\n", i4, c4, i6, c6, i9, c9, cost[n]); n++; } printf("n=%2d\n", n); } 4-4A4 定义含有n4,n6,n9和cost的结构数组rs[]。 #include <stdio.h> #define RS struct rs #define MAX_N 300 RS { int n4, n6, n9, cost; }; main() { int c4=20, c6=25, c9=30, e4=100/4, e6=100/6, e9=100/9; int n=0, n4, n6, n9, i; RS rs[MAX_N]; for(n4=1; n4<=e4; n4++) for(n6=1; n6<=e6; n6++) for(n9=1; n9<=e9; n9++) if(n4*4 + n6*6 + n9*9 == 100) { rs[n].n4 = n4; rs[n].n6 = n6; rs[n].n9 = n9; rs[n++].cost = n4*c4 + n6*c6 + n9*c9; } for(i=0; i<n; i++) printf("cost = %2d*%2d+%2d*%2d+%2d*%2d = %2d\n", rs[i].n4, c4, rs[i].n6, c6, rs[i].n9, c9, rs[i].cost); printf("n=%2d\n", n); } 4-4A5 定义指针n4,n6,n9和cost,动态分配存储单元。 #include <stdio.h> main() { int c4=20, c6=25, c9=30, e4=100/4, e6=100/6, e9=100/9, n=0; int *n4, *n6, *n9, *cost, i4, i6, i9;
《计算机软件基础》补充教材 V2.1
K2-
6
4-4A7 定义含有n4,n6,n9,cost和结构指针的结构指针prs。每得到一种方案,动态分配 一结构单元,用指针链结各个结构。 #include <stdio.h> #define PRS struct prs PRS { int n4, n6, n9, cost; PRS *next; }; main() { int c4=20, c6=25, c9=30, e4=100/4, e6=100/6, e9=100/9; PRS *prs=NULL, *tmp; int i4, i6, i9, n=0; for(i4=1; i4<=e4; i4++) for(i6=1; i6<=e6; i6++) for(i9=1; i9<=e9; i9++) if(i4*4 + i6*6 + i9*9 == 100) { tmp = (PRS *)malloc(sizeof(PRS)); tmp->n4 = i4; tmp->n6 = i6; tmp->n9 = i9; tmp->cost = i4*c4 + i6*c6 + i9*c9; tmp->next = prs; prs = tmp; } for(tmp=prs; tmp!=NULL; tmp=tmp->next, n++) printf("cost = %2d*%2d+%2d*%2d+%2d*%2d = %2d\n", tmp->n4, c4, tmp->n6, c6, tmp->n9, c9, tmp->cost); printf("n=%2d\n", n); } 4-4B3 定义数组n4[],n6[],n9[]和cost[]。用void drawer()计算。 #include <stdio.h> void drawer(n4, n6, n9, cost, n) int n4[], n6[], n9[], cost[], *n; { int c4=20, c6=25, c9=30, e4=100/4, e6=100/6, e9=100/9; int i4, i6, i9; for(i4=1; i4<=e4; i4++) for(i6=1; i6<=e6; i6++) for(i9=1; i9<=e9; i9++) if(i4*4 + i6*6 + i9*9 == 100)
《计算机软件基础》补充教材 V2.1
K2-
2
} return(n); } int getTop(n) int n; { int top, i; float maxScore; for(maxScore=0.0, top=-1, i=0; i<n; i++) if(Student[i].score > maxScore) { top = i; maxScore = Student[i].score; } if(top >= 0) Student[top].score = -Student[top].score; return(top); } main() { int i, n, top; n = readFile(); for(i=0; i<3; i++) { if((top = getTop(n)) < 0) error("cannot find top student.\n"); printf("Name: %-20s ", Student[top].name); printf("score=%5.2f ", -Student[top].score); printf("exercise=%5.2f ", Student[top].exercise); printf("practice=%5.2f\n",Student[top].practice); } } 4-4A1 定义n4, n6,n9和cost为变量。 #include <stdio.h> main() { int c4=20, c6=25, c9=30, e4=100/4, e6=100/6, e9=100/9, n=0; int n4, n6, n9, cost； for(n9=1; n9<=e9; n9++) for(n6=1; n6<=e6; n6++) for(n4=1; n4<=e4; n4++) if(n4*4 + n6*6 + n9*9 == 100) {
《计算机软件基础》补充教材 V2.1
K2-
3
cost = n4*c4 + n6*c6 + n9*c9; printf("cost = %2d*%2d+%2d*%2d+%2d*%2d = %2d\n", n4, c4, n6, c6, n9, c9, cost); n++; } printf("n=%2d\n", n); } 4-4A2 定义含有n4,n6,n9和cost的结构变量rs。 #include <stdio.h> #define RS struct rs RS { int n4, n6, n9, cost; }; main() { int c4=20, c6=25, c9=30, e4=100/4, e6=100/6, e9=100/9, n=0; RS rs; for(rs.n4=1; rs.n4<=e4; rs.n4++) for(rs.n6=1; rs.n6<=e6; rs.n6++) for(rs.n9=1; rs.n9<=e9; rs.n9++) if(rs.n4*4 + rs.n6*6 + rs.n9*9 == 100) { rs.cost = rs.n4*c4 + rs.n6*c6 + rs.n9*c9; printf("cost= %2d*%2d+%2d*%2d+%2d*%2d= %2d\n", rs.n4, c4, rs.n6, c6, rs.n9, c9, rs.cost); n++; } printf("n=%2d\n", n); } 4-4A3 定义数组n4[],n6[],n9[]和cost[]。 #include <stdio.h> #define MAX_N 500 main() { int c4=20, c6=25, c9=30, e4=100/4, e6=100/6, e9=100/9, n=0; int n4[MAX_N], n6[MAX_N], n9[MAX_N], cost[MAX_N]; int i4, i6, i9; for(i9=1; i9<=e9; i9++) for(i6=1; i6<=e6; i6++) for(i4=1; i4<=e4; i4++) if(i4*4 + i6*6 + i9*9 == 100) {
