Repository navigation
Expand file tree
/
Copy pathA - Expression.cpp
More file actions
71 lines (52 loc) · 1.91 KB
/
Copy pathA - Expression.cpp
File metadata and controls
71 lines (52 loc) · 1.91 KB
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
// https://codeforces.com/contest/479/problem/A
//Bismillahir rahmanir rahim
//Arman Hossain C193033
//Programming is nothing but an addiction.
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long;
using vi = vector < int >;
using vll = vector < ll >;
using vc = vector < char >;
using vs = vector < string >;
using vvi = vector < vector < int > >;
using vpi = vector < pair < int,int > >;
using vvs = vector < vector < string > >;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(s) (s).length()
#define digits(x) trunc(log10(x))+1
#define all(x) (x).begin(), (x).end()
#define sumvec(x) accumulate((x).begin() , (x).end() , 0)
#define rev_sortv sort(v.begin(), v.end(), greater<int>())
#define maxelement(x) max_element(v.begin(),v.end()) - v.begin()
#define minelement(x) min_element(v.begin(),v.end()) - v.begin()
#define out(v) for(auto value:v){cout<<value<<" ";}cout<<endl;
#define inv vi v;for(int i = 0; i < n; ++i){int x;cin >> x; v.pb(x);};
#define pout(p) for(auto value:p){cout<<value.ff<<" "<<value.ss<<endl;}cout<<endl;
// string to int stoi(x)
// int/double to string to_string(x)
int dx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
int dy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
string alpha = " abcdefghijklmnopqrstuvwxyz";
int main()
{
#ifndef ONLINE_JUDGE
freopen("F:input.txt", "r", stdin);
freopen("F:output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a , b , c;
cin >> a >> b >> c;
int x , y , p , q;
x = a+b+c;
y = max(((a+b)*c) , (a+(b*c)));
p = max(((a*b)+c) , (a*(b+c)));
q = a*b*c;
cout << max(x , max(y , max(p,q)));
return 0;
}