Question

ISAS题目：用C语言编写一个小学算术加减运算测试程序

Answer 1

#include
#include
#include
#include
#define stacksize 100

typedef char datatype;
typedef int datamath;

typedef struct{
datatype data[stacksize];
int top;
}seqstack;

void initstack(seqstack *s){
s->top=0;
}

int stackempty(seqstack *s){
return s->top==0;
}

int stackfull(seqstack *s){
return s->top==stacksize;
}

void push(seqstack *s,datatype x){
if(stackfull(s))printf("full \n");
s->data[s->top]=x;
++s->top;
}

datatype pop(seqstack *s){
if(stackempty(s))printf("no data!");
s->top--;
return s->data[s->top];
}

datatype stacktop(seqstack *s){
if(stackempty(s))printf("no data!");
return s->data[s->top-1];
}

typedef struct{
datamath data[stacksize];
int top;
}mathstack;

void initstack2(mathstack *s){
s->top=0;
}

int stackempty2(mathstack *s){
return s->top==0;
}

int stackfull2(mathstack *s){
return s->top==stacksize;
}

void push2(mathstack *s,datamath x){
if(stackfull2(s))printf("full \n");
s->data[s->top]=x;
++s->top;
}

datamath pop2(mathstack *s){
if(stackempty2(s))printf("no data!");
s->top--;
return s->data[s->top];
}

datamath stacktop2(mathstack *s){
if(stackempty2(s))printf("no data!");
return s->data[s->top-1];
}

int fuhaoweizhi(char ysf){
switch(ysf){
case '+':return 0;
case '-':return 1;
case '*':return 2;
case '^':return 3;
case '(':return 4;
case ')':return 5;
case '#':return 6;
default:return 9;
}
}

char panduan(char zhanding,char jingzhan){
char a[7][7]={{'>','>','<','<','<','>','>'},
{'>','>','<','<','<','>','>'},
{'>','>','>','<','<','>','>'},
{'>','>','>','>','<','>','>'},
{'<','<','<','<','<','=','a'},
{'>','>','>','>','a','>','>'},
{'<','<','<','<','<','a','='}};
int m,n;
m=fuhaoweizhi(zhanding);
n=fuhaoweizhi(jingzhan);
return a[m][n];
}

int yunsuan(int first,int second,char yunsuanfu){
double f,s;
if(yunsuanfu=='+'){return first+second;}
else if(yunsuanfu=='-'){return first-second;}
else if(yunsuanfu=='*'){return first*second;}
else if(yunsuanfu=='^'){
f=(double)(first);
s=(double)(second);
return (int)(pow(f,s));
}
}

void main(){
seqstack oper;
mathstack shu;
char *a;
char b[20];
int results;
char pd;
char yusuanf;
int qq=0;
int sec,fir;
int jg;
initstack(&oper);
initstack2(&shu);
printf("enter please:");
scanf("%s",b);
a=b;
while(*a){
if(!((*a)>='0'&&(*a)<='9')){
if(stackempty(&oper)){push(&oper,*a);}
else{
pd=panduan(stacktop(&oper),*a);
if(pd=='>'){
yusuanf=pop(&oper);
sec=pop2(&shu);
fir=pop2(&shu);
push2(&shu,yunsuan(fir,sec,yusuanf));
a--;
}
else if(pd=='<'){push(&oper,*a);}
else if(pd=='='){yusuanf=pop(&oper);}
}
a++;
}
else{
qq=(int)((*a)-'0'+0);
push2(&shu,qq);
a++;
}
}
jg=pop2(&shu);
printf("the result is %d",jg);
getch();
}

Answer 2

#include "stdio.h" #include "stdlib.h" #include "time.h" int main() { int n,f; int a,b,c,t; int s=1; while(s==1) { t=1,f=0; printf("欢迎进入小学算数测试系统。。请输入你要挑战的题量："); sca

Answer 3

我擦，不会啊