【HDOJ】2424 Gary's Calculator

大数乘法加法，直接java A了。

 1 import java.util.Scanner;
 2 import java.math.BigInteger;
 3
 4 public class Main {
 5     public static void main(String[] args) {
 6         Scanner cin = new Scanner(System.in);
 7         int n;
 8         int i, j, k, tmp;
 9         int top;
10         boolean flag;
11         int t = 0;
12         while (cin.hasNext()) {
13             n = cin.nextInt();
14             for (i=0; i<n; ++i)
15                 buf[i] = cin.next();
16             flag = true;
17             if ((n&1) == 0)
18                 flag = false;
19             for (i=0; flag&&i<n; ++i) {
20                 if ((i & 1) == 1) {
21                     if (buf[i].charAt(0)!=‘+‘ && buf[i].charAt(0)!=‘*‘)
22                         flag = false;
23                 } else {
24                     if (buf[i].charAt(0)==‘+‘ || buf[i].charAt(0)==‘*‘)
25                         flag = false;
26                 }
27             }
28             System.out.printf("Case %d: ", ++t);
29             if (flag==false || n==0) {
30                 System.out.println("Invalid Expression!");
31                 continue;
32             }
33             top = 0;
34             bi[top++] = new BigInteger(buf[0]);
35             i = 1;
36             while (i < n) {
37                 if (buf[i].charAt(0) == ‘*‘) {
38                     BigInteger a = bi[top-1];
39                     BigInteger b = new BigInteger(buf[i+1]);
40                     bi[top-1] = a.multiply(b);
41                 } else {
42                     bi[top++] = new BigInteger(buf[i+1]);
43                 }
44                 i += 2;
45             }
46             BigInteger sum = BigInteger.ZERO;
47             for (i=0; i<top; ++i) {
48                 sum = sum.add(bi[i]);
49             }
50             System.out.println(sum.toString());
51         }
52     }
53
54     final public static int MAXN = 25;
55     public static String[] buf = new String[MAXN];
56     public static BigInteger[] bi = new BigInteger[MAXN];
57 }

时间： 2024-12-14 03:57:08

【HDOJ】2424 Gary's Calculator的相关文章

【HDOJ】4956 Poor Hanamichi

基本数学题一道,看错位数,当成大数减做了,而且还把方向看反了.所求为最接近l的值. 1 #include <cstdio> 2 3 int f(__int64 x) { 4 int i, sum; 5 6 i = sum = 0; 7 while (x) { 8 if (i & 1) 9 sum -= x%10; 10 else 11 sum += x%10; 12 ++i; 13 x/=10; 14 } 15 return sum; 16 } 17 18 int main() { 1

【HDOJ】1099 Lottery

题意超难懂,实则一道概率论的题目.求P(n).P(n) = n*(1+1/2+1/3+1/4+...+1/n).结果如果可以除尽则表示为整数,否则表示为假分数. 1 #include <cstdio> 2 #include <cstring> 3 4 #define MAXN 25 5 6 __int64 buf[MAXN]; 7 8 __int64 gcd(__int64 a, __int64 b) { 9 if (b == 0) return a; 10 else return

【HDOJ】2844 Coins

完全背包. 1 #include <stdio.h> 2 #include <string.h> 3 4 int a[105], c[105]; 5 int n, m; 6 int dp[100005]; 7 8 int mymax(int a, int b) { 9 return a>b ? a:b; 10 } 11 12 void CompletePack(int c) { 13 int i; 14 15 for (i=c; i<=m; ++i) 16 dp[i]

【HDOJ】3509 Buge's Fibonacci Number Problem

快速矩阵幂,系数矩阵由多个二项分布组成.第1列是(0,(a+b)^k)第2列是(0,(a+b)^(k-1),0)第3列是(0,(a+b)^(k-2),0,0)以此类推. 1 /* 3509 */ 2 #include <iostream> 3 #include <string> 4 #include <map> 5 #include <queue> 6 #include <set> 7 #include <stack> 8 #incl

【HDOJ】1818 It's not a Bug, It's a Feature!

状态压缩+优先级bfs. 1 /* 1818 */ 2 #include <iostream> 3 #include <queue> 4 #include <cstdio> 5 #include <cstring> 6 #include <cstdlib> 7 #include <algorithm> 8 using namespace std; 9 10 #define MAXM 105 11 12 typedef struct {

【HDOJ】2425 Hiking Trip

优先级队列+BFS. 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <queue> 5 using namespace std; 6 7 #define MAXN 25 8 9 typedef struct node_st { 10 int x, y, t; 11 node_st() {} 12 node_st(int xx, int yy, int tt)

【HDOJ】1686 Oulipo

kmp算法. 1 #include <cstdio> 2 #include <cstring> 3 4 char src[10005], des[1000005]; 5 int next[10005], total; 6 7 void kmp(char des[], char src[]){ 8 int ld = strlen(des); 9 int ls = strlen(src); 10 int i, j; 11 12 total = i = j = 0; 13 while (

【HDOJ】2795 Billboard

线段树.注意h范围(小于等于n). 1 #include <stdio.h> 2 #include <string.h> 3 4 #define MAXN 200005 5 #define lson l, mid, rt<<1 6 #define rson mid+1, r, rt<<1|1 7 #define mymax(x, y) (x>y) ? x:y 8 9 int nums[MAXN<<2]; 10 int h, w; 11 12

【HDOJ】2149 Public Sale

看Discuss说是博弈论,没学到这个分类.不过仔细想了想,发现.如果m<=n,那么可能结果为m,m+1...n.否则,如果m%(n+1) == 0,那么无论如何都会输,因为无论先报价什么数,如a,另一个人只要报价n+1-a就可以取得最后的土地:而相反,m%(n+1)!=0,那么第一次报价为余数,余下报价只需要报价n+1-b就可以取得最后的土地. 1 #include <stdio.h> 2 3 int main() { 4 int m, n; 5 int i; 6 7 while (s