Moderator: Board moderators
) and I got Accepted 
Code: Select all
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<iterator>
#include <ctype.h>
#include<cassert>
#include <sstream>
using namespace std;
/*------- Constants---- */
#define MX 130000
#define ll long long
#define ull unsigned long long
#define mod 1000000007
/* -------Global Variables ------ */
ll x,y,d;
/*---- short Cuts ------- */
#define ms(ara_name,value) memset(ara_name,value,sizeof(ara_name))
/*------ template functions ------ */
template < class T > inline T gcd(T a , T b ) { if(b==0) return a; else return gcd(b, a%b);}
template < class T > inline T lcm(T a , T b ) { return a*b / gcd(a, b);}
template < class T > inline T extended_euclid_returning_gcd(T a,T b){ T t; if(b==0){d = a;x=1;y=0;} else {extended_euclid_returning_gcd(b, a%b); t=x; x=y;y = t-(a*y/b);}}
template < class T > inline T absolute(T a ) { if(a>0) return a; else return -a;}
template < class T > inline T reverse_num( T a ){ T x=0,tmp = a; while(tmp) { x=10*x+ tmp % 10; tmp/=10;} return x;}
template <class T > inline T big_mod(T base, T power){ T res=1; while (power) { if(power&1){ res*=base; power--;} base =base *base; power/=2;} return res;}
char in[100],var[100];
vector<int> oprd,op;
char mappin[1000];
void print()
{
for (int i=0; i<op.size(); i++) {
printf("%d %c ",oprd[i],mappin[op[i]]);
}
printf("%d = %s\n",oprd[op.size()],var);
return;
}
int main()
{
int res=0,flag=0,sign=1,first=0;
mappin[1] = '+';
mappin[2] = '-';
mappin[3] = '*';
mappin[4] = '/';
while (gets(in)!=NULL) {
if(in[0]=='\0') break;
for (int i=0,k=0; in[i]; i++) {
if(in[i]=='-'&& in[i+1]>='0' && in[i+1]<='9') {sign=-1;continue;}
if(in[i]=='+' && in[i+1]>='0' && in[i+1]<='9') {sign=1;continue;}
if(in[i]>='0' && in[i]<='9'){
flag=1;
res = res*10 + in[i]-'0';
}
else {
if(flag)oprd.push_back(sign*res);
res=0;
sign=1;
flag=0;
if(in[i]=='+') op.push_back(1);
if(in[i]=='-') op.push_back(2);
if(in[i]=='*') op.push_back(3);
if(in[i]=='/') op.push_back(4);
if(in[i]=='=') {
for ( k=i+1; !isalpha(in[k]); k++);
for ( int p=0; ; k++,p++) {
var[p] = in[k];
if(!in[k]) break;
}
break;
}
}
}
if(first) printf("\n");
first=1;
print();
int sum=0;
while (oprd.size()>1) {
sum=0;
for (int i=0; i<op.size(); i++) {
if(op[i]==3 || op[i]==4){
if(op[i]==3) oprd[i+1] = oprd[i]*oprd[i+1];
else oprd[i+1] = oprd[i]/oprd[i+1];
op.erase(op.begin()+i);
oprd.erase(oprd.begin()+i);
print();
sum=1;
break;
}
}
if (sum==0) {
for (int i=0;op.size()>=1;) {
if(op[i]==1 || op[i]==2){
if(op[i]==1)oprd[i+1] = oprd[i]+oprd[i+1];
else oprd[i+1] = oprd[i]-oprd[i+1];
op.erase(op.begin()+i);
oprd.erase(oprd.begin()+i);
print();
break;
}
}
}
}
op.clear();
oprd.clear();
}
}