HDU 2424-Gary's Calculator(表达式计算+大数)

原创 2014年10月09日 23:09:50

Gary's Calculator

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 950    Accepted Submission(s): 209


Problem Description
Gary has finally decided to find a calculator to avoid making simple calculational mistakes in his math exam. Unable to find a suitable calculator in the market with enough precision, Gary has designed a high-precision calculator himself. Can you help him to write the necessary program that will make his design possible?
For simplicity, you only need to consider two kinds of calculations in your program: addition and multiplication. It is guaranteed that all input numbers to the calculator are non-negative and without leading zeroes.
 

Input
There are multiple test cases in the input file. Each test case starts with one positive integer N (N < 20), followed by a line containing N strings, describing the expression which Gary's calculator should evaluate. Each of the N strings might be a string representing a non-negative integer, a "*", or a "+". No integer in the input will exceed 109.
Input ends with End-of-File.
 

Output
For each test case, please output one single integer (with no leading zeros), the answer to Gary's expression. If Gary's expression is invalid, output "Invalid Expression!" instead. Please use the format indicated in the sample output. 
 

Sample Input
3 100 + 600 3 20 * 4 2 + 500 5 20 + 300 * 20
 

Sample Output
Case 1: 700 Case 2: 80 Case 3: Invalid Expression! Case 4: 6020
给出一个只含+和*的表达式,求其值。由于数据太大,使用BigInteger 。 可以采用栈来计算表达式,先算*,后算+;
import java.io.*;
import java.util.*;
import java.math.*;

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n, cas = 1;
		while (in.hasNext()) {
			n = in.nextInt();
			String[] s = new String[n];
			for (int i = 0; i < n; i++)
				s[i] = in.next();
			int flag = 1;
			if (n % 2 == 0)
				flag = 0;
			for (int i = 0; i < n; i++) {
				if ((i % 2 == 1 && s[i].charAt(0) != '+' && s[i].charAt(0) != '*')
						|| (i % 2 == 0 && (s[i].charAt(0) == '+' || s[i]
								.charAt(0) == '*')))
					flag = 0;
			}
			System.out.print("Case " + cas + ": ");
			cas++;
			if (flag == 0 || n == 0) {
				System.out.println("Invalid Expression!");
				continue;
			}
			Stack stack = new Stack();
			for (int i = 0; i < n; i++) {
				int tag = 0;
				if (s[i].charAt(0) != '+' && s[i].charAt(0) != '*') {
					if (stack.size() != 0) {
						String t = stack.peek().toString();
						if (t.charAt(0) == '*') {
							stack.pop();
							if (stack.size() != 0) {
								String tt = stack.pop().toString();
								BigInteger a = new BigInteger(s[i].toString());
								BigInteger b = new BigInteger(tt.toString());
								stack.push(a.multiply(b).toString());
								tag = 1;
							}
						}
					}
				}
				if (tag == 0)
					stack.push(s[i]);
			}
			BigInteger res = BigInteger.ZERO;
			while (stack.size() != 0) {
				String x = stack.pop().toString();
				if (x.charAt(0) != '+') {
					res = res.add(new BigInteger(x));
				}
			}
			System.out.println(res);
		}
	}
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

hdu 5215 Cycle(判断是否有奇数偶数的环)

Cycle Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total ...

HDU2860Regroup(并查集)

Regroup Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total ...

hdu2424 Gary's Calculator 高精度计算

Gary's Calculator Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Other...

HDU 2424-Gary's Calculator

表达式求值。 手动模拟吧。可以用站维护,这里我没用到栈来写。注意不能gets()  输入有换行。 还要用到高精度,套一个模板。 #include #include #include #include...

hdu2424Gary's Calculator

Gary's Calculator Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others...

HDU Gary's Calculator

Gary's Calculator Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)...
  • Wss0130
  • Wss0130
  • 2012年08月28日 21:48
  • 617

hdu1002大数相加

  • 2014年12月16日 12:44
  • 877B
  • 下载

hdu 2424

用java写高精度虽然简单,但是其中的原理必须得想清楚了! 这个题目是给出一个算式,期中只有数字 ,加号,乘号,空格这四种种元素。通过这个算式计算出一个结果。基本思想就是:用next()一个元素一个...

HDU_ACM_1002_大数相加C源代码

  • 2012年04月19日 19:21
  • 1KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 2424-Gary's Calculator(表达式计算+大数)
举报原因:
原因补充:

(最多只允许输入30个字)