UVa 397 - Equation Elation

題目:已知一個等式左邊是數字四則運算,右邊是未知數,每次計算一步,求出未知數的值。

分析:模擬,字符串。首先將左邊的數字算式分解成計算數和計算符,然後模擬計算即可。

             每次找到最左邊的乘除法,沒有的話直接計算第一個,然後把前面的都向後移即可。

說明:注意數據的符號,╮(╯▽╰)╭。

#include <cstdlib>
#include <cstring>
#include <cstdio>

char buf[1001];
int  integers[22];
char operators[22];
char variable[22];

int is_operator(char c)
{
	if (c == '+') return 1;
	if (c == '-') return 1;
	if (c == '*') return 1;
	if (c == '/') return 1;
	return 0;
}

int is_number(char c)
{
	return c >= '0' && c <= '9';
}

int main()
{
	int cases = 0;
	while (gets(buf)) {
		if (!strcmp(buf, "")) {
			continue;
		} 
		if (cases ++) {
			puts("");
		}
		//divide the data
		int count = 0, state = 0, value = 0, sign = 1;
		for (int i = 0; buf[i]; ++ i) {
			if (state == 0) {
				if (buf[i] == '+' || buf[i] == '-' || is_number(buf[i])) {
					state = 1;
					if (buf[i] == '-')
						sign = -1;
					else if (buf[i] == '+') 
						sign = +1;
					else 
						value = buf[i]-'0';
				}
			}else if (state == 1) {
				if (buf[i] == ' ' || buf[i] == '=' || is_operator(buf[i])) {
					integers[count] = value*sign;
					sign = +1;
					value = 0;
					if (is_operator(buf[i])) {
						operators[count ++] = buf[i];
						state = 0;
					}else if (buf[i] == '=') {
						operators[count ++] = buf[i];
						state = 3;
					}else {
						state = 2;
					}
				}else {
					value = value*10 + buf[i]-'0';
				}
			}else if (state == 2) {
				operators[count ++] = buf[i];
				if (is_operator(buf[i])) {
					state = 0;
				}else if (buf[i] == '=') {
					state = 3;
				}
			}else if (state == 3) {
				if (buf[i] != ' ') {
					strcpy(variable, &buf[i]);
					while (variable[strlen(variable)-1] == ' ') {
						variable[strlen(variable)-1] = 0;
					}
					break;
				}
			}
		}
		// calculate the equation and output
		for (int i = 0; i < count; ++ i) {
			for (int j = i; j < count-1; ++ j) {
				printf("%d %c ",integers[j],operators[j]);
			}
			printf("%d = %s\n",integers[count-1],variable);
			int space = i;
			for (int j = count-1; j >= i; -- j) {
				if (operators[j] == '*' || operators[j] == '/') {
					space = j;
				}
			}
			if (operators[space] == '+') {
				integers[space+1] = integers[space] + integers[space+1];
			}else if (operators[space] == '-') {
				integers[space+1] = integers[space] - integers[space+1];
			}else if (operators[space] == '*') {
				integers[space+1] = integers[space] * integers[space+1];
			}else if (operators[space] == '/') {
				integers[space+1] = integers[space] / integers[space+1];
			}
			for (int j = space; j >= i; -- j) {
				integers[j] = integers[j-1];
				operators[j] = operators[j-1];
			}
		}
	}
	return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值