Submission #3258003


Source Code Expand

Copy
#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
#include<cassert>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
int main()
{
	int a,b,c;cin>>a>>b>>c;cout<<a+b+c+max(a,max(b,c))*9<<endl;
}

Submission Info

Submission Time
Task A - Maximize the Formula
User sky58
Language C++14 (Clang 3.8.0)
Score 100
Code Size 793 Byte
Status
Exec Time 7 ms
Memory 888 KB

Test Cases

Set Name Score / Max Score Test Cases
All 100 / 100 sample_01, sample_02, sample_03, testcase1, testcase2, testcase3, testcase4, testcase5, testcase6, testcase7
Sample 0 / 0 sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 7 ms 888 KB
sample_02 1 ms 256 KB
sample_03 1 ms 256 KB
testcase1 1 ms 256 KB
testcase2 1 ms 256 KB
testcase3 1 ms 256 KB
testcase4 1 ms 256 KB
testcase5 1 ms 256 KB
testcase6 1 ms 256 KB
testcase7 1 ms 256 KB