#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cctype>
#include <cmath>
using namespace std;
int main()
{
char s1[11000];
while(gets(s1) != NULL)
{
printf("Expression: %s\n", s1);
int al[30];
for(int i = 1; i <= 26; ++i)
al[i] = i;
int len = strlen(s1);
int k = 0;
char s[11000];
for(int i = 0; i < len; ++i)
if(s1[i] != ' ')
s[k++] = s1[i];
len = k;
int ans[11000];
int len_ans = 0;
bool vis[30];
memset(vis, false, sizeof(vis));
for(int i = 0; i < len; ++i)
{
if(isalpha(s[i]))
{
vis[s[i]-'a'+1] = true;
if(i-2 >= 0 && s[i-1] == s[i-2])
{
if(s[i-1] == '-') --al[s[i]-'a'+1];
else ++al[s[i]-'a'+1];
s[i-1] = s[i-2] = ' ';
}
ans[len_ans++] = al[s[i] - 'a' + 1];
if(i+2 < len && s[i+1] == s[i+2])
{
if(s[i+1] == '-') --al[s[i]-'a'+1];
else ++al[s[i]-'a'+1];
s[i+1] = s[i+2] = ' ';
}
}
}
int sum = ans[0];
for(int i = 0, k = 1; i < len; ++i)
{
if(s[i] == '-')
sum -= ans[k++];
else if(s[i] == '+')
sum += ans[k++];
}
printf(" value = %d\n", sum);
for(int i = 1; i <= 26; ++i)
if(vis[i])
printf(" %c = %d\n", 'a'+i-1, al[i]);
memset(s, 0, sizeof(s));
}
return 0;
}
//注意-- a的情况
uva 327 - Evaluating Simple C Expressions
最新推荐文章于 2017-09-03 18:03:52 发布