标签:结束 http cst string i++ acm key log cte
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19060 Accepted Submission(s): 6711
JGShining | We have carefully selected several similar problems for you: 1230 1235 1234 1236 1229
模拟计算
代码:
#include<iostream> #include<cstdio> #include<cstring> #include<stack> using namespace std; int main() { char ch[420]; while(gets(ch)&&strcmp(ch,"0")) { stack<char>s; stack<double>n; for(int i=0;ch[i];i++) { if(ch[i]>=‘0‘&&ch[i]<=‘9‘) { double tem=0; while(ch[i]>=‘0‘&&ch[i]<=‘9‘) { tem=tem*10+ch[i]-‘0‘; i++; } i--; n.push(tem); } else if(ch[i]==‘+‘||ch[i]==‘-‘) { if(!s.empty()) { char c=s.top(); s.pop(); double x1=n.top(); n.pop(); double x2=n.top(); n.pop(); if(c==‘+‘) x2+=x1; else x2-=x1; n.push(x2); } s.push(ch[i]); } else if(ch[i]==‘*‘||ch[i]==‘/‘) { double x1=n.top(); n.pop(); double x2=0; int j=i; i+=2; while(ch[i]>=‘0‘&&ch[i]<=‘9‘) { x2=x2*10+ch[i]-‘0‘; i++; } i--; if(ch[j]==‘*‘) x1*=x2; else x1/=x2; n.push(x1); } } while(!s.empty()) { char c=s.top(); s.pop(); double x1=n.top(); n.pop(); double x2=n.top(); n.pop(); if(c==‘+‘) x2+=x1; else x2-=x1; n.push(x2); } printf("%.2lf\n",n.top()); } return 0; }
标签:结束 http cst string i++ acm key log cte
原文地址:http://www.cnblogs.com/--ZHIYUAN/p/6143048.html