发布时间 : 星期日 文章利用栈求表达式的值_可供小学生作业_并能给出分数_数据结构课程设计说明书格式更新完毕开始阅读
free(m); exit(0); }
fwrite(m,sizeof(int),num,mp); fclose(mp); }//Recmark
void LookMark(int *m,int num) {//查看得分记录 FILE *mp;
mp=fopen(\ if(mp==NULL) {
printf(\不能打开markrec.txt\\n\ free(m); exit(0); }
fread(m,sizeof(int),num,mp); fclose(mp); }
//************************************* void RecN(int *m,int num) {//把m的值记录到n_rec.txt中 FILE *mp;
mp=fopen(\ if(mp==NULL) {
printf(\不能创建n_rec.txt\\n\ free(m);
12
exit(0); }
fwrite(m,sizeof(int),num,mp); fclose(mp); }//Recmark
void LookN(int *m,int num) {//查看m的值 FILE *mp;
mp=fopen(\ if(mp==NULL) {
printf(\不能打开n_rec.txt\\n\ free(m); exit(0); }
fread(m,sizeof(int),num,mp); fclose(mp); }
//************************************* int excersice_begin() {
int i, j, temp, KEY[20]; int mark,count=0; int *Mark; char g;
SqStack1 s1,*OPND; SqStack2 s2,*OPTR; xuanti *XT; OPND=&s1;
13
OPTR=&s2;
Mark=(int *)malloc(20*sizeof(int)); XT=(xuanti *)malloc(20*sizeof(xuanti)); ReadFromFile(XT,20); do {
mark=0;
srand((unsigned)time(NULL)); KEY[0] = rand() ; for(i=1;i<20;i++) {
while(1) {
temp = rand() ; for(j=0;j
if(KEY[j]==temp) break; }
if(j==i) {
KEY[i]=temp; break; } } }
system(\
printf(\随机的10个练习题 :\\n\ for(i=0;i<10;i++)
14
{
printf(\第%d个练习题:\ printf(\ printf(\请输入计算结果:\ scanf(\ fflush(stdin);
if(XT[KEY[i]].result==result(XT[KEY[i]].a,OPND,OPTR)) {
mark+=10;
printf(\答案正确!\ printf(\ }
else {
printf(\答案错误!\ printf(\ } }
printf(\得分情况****\\n\ printf(\最后的得分为:%d\\n\ if(mark>=90)
printf(\ else if(mark>=60) printf(\成绩不错。\\n\
else printf(\很遗憾成绩不及格!\\n\ printf(\ RecMark(Mark,count); Mark[count]=mark; count++;//记录次数递增
15