Kiritow/OJ-Problems-Source
1
0
Fork 0
mirror of https://github.com/Kiritow/OJ-Problems-Source.git synced 2024-03-22 13:11:29 +08:00
Code Issues Projects Releases Wiki Activity

Create 1884.cpp

Browse Source
This commit is contained in:
Kirigaya Kazuto 2016-11-09 16:13:03 +08:00 committed by GitHub
parent 74379325f9
commit 4b418100d3
1 changed files with 99 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

99
QUSTOJ/1884.cpp Normal file
View File

@ -0,0 +1,99 @@
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <stack>
using namespace std;
char buff[1024];
const long long MOD=10000;
int main()
{
gets(buff);
int len=strlen(buff);
int isReadingNumber=0;
long long NumberCache;
stack<long long> val;
stack<char> op;
for(int i=0;i<len;i++)
{
if(buff[i]>='0'&&buff[i]<='9')
{
if(isReadingNumber)
{
NumberCache=NumberCache*10+buff[i]-'0';
}
else
{
isReadingNumber=1;
NumberCache=buff[i]-'0';
}
}
else if(buff[i]=='+')
{
isReadingNumber=0;
val.push(NumberCache);
if(op.empty()) op.push(buff[i]);
else if(op.top()=='+') op.push(buff[i]);
else /// op.top()=='*'
{
long long preans=val.top();
val.pop();
while(!op.empty()&&op.top()=='*')
{
preans=(preans*(val.top()))%MOD;
val.pop();
op.pop();
}
val.push(preans);
op.push(buff[i]);
}
}
else if(buff[i]=='*')
{
isReadingNumber=0;
val.push(NumberCache);
op.push(buff[i]);
}
}
if(isReadingNumber)
{
isReadingNumber=0;
val.push(NumberCache);
}
if(!op.empty()&&op.top()=='*')
{
long long preans=val.top();
val.pop();
while(!op.empty()&&op.top()=='*')
{
preans=(preans*(val.top()))%MOD;
val.pop();
op.pop();
}
val.push(preans);
}
if(!op.empty())
{
long long preans=val.top();
val.pop();
while(!op.empty())
{
preans=(preans+(val.top()))%MOD;
val.pop();
op.pop();
}
val.push(preans);
}
long long ans=val.top()%MOD;
printf("%lld\n",ans);
return 0;
}
/*
11*414+225*44+11
*/