-
Notifications
You must be signed in to change notification settings - Fork 0
/
cameltrading.cpp
102 lines (88 loc) · 1.86 KB
/
cameltrading.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <cstring>
#include <map>
#include <sstream>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> pii;
ll mx(string str){
ll ret = 1;
vector<int> num;
vector<char> op;
ll n = 0;
for(int i=0;i<str.size();i++){
if(str[i]>='0' && str[i]<='9')
n = n*10 + str[i]-'0';
else{
num.push_back(n);
n = 0;
op.push_back(str[i]);
}
}
num.push_back(n);
ll now = num[0];
vector<ll> after;
for(int i=0;i<op.size();i++){
if(op[i]=='+')
now+=num[i+1];
else if(op[i]=='*'){
after.push_back(now);
now=num[i+1];
}
}
after.push_back(now);
for(auto i:after)
ret*=i;
return ret;
}
ll mn(string str){
ll ret = 0;
vector<int> num;
vector<char> op;
ll n = 0;
for(int i=0;i<str.size();i++){
if(str[i]>='0' && str[i]<='9')
n = n*10 + str[i]-'0';
else{
num.push_back(n);
n = 0;
op.push_back(str[i]);
}
}
num.push_back(n);
ll now = num[0];
vector<ll> after;
for(int i=0;i<op.size();i++){
if(op[i]=='+'){
after.push_back(now);
now=num[i+1];
}
else if(op[i]=='*')
now*=num[i+1];
}
after.push_back(now);
for(auto i:after)
ret+=i;
return ret;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n;
cin>>n;
cin.ignore();
while(n--){
string str;
getline(cin,str);
cout<<"The maximum and minimum are "<<mx(str)<<" and "<<mn(str)<<".\n";
}
return 0;
}