Submission #3434811
Source Code Expand
#include<iostream> using namespace std; void sort(int a[],int N) { for(int i = N-1;i>0;i--) { for(int j=0;j<i;j++) { if(a[i] > a[j]) { int tmp = a[j]; a[j] =a[i]; a[i] = tmp; } } } } int main() { int card[3]; for(int i=0;i<3;i++) { cin >> card[i]; } sort(card,3); cout << card[0]*10 + card[1] + card[2] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Maximize the Formula |
User | marumine51 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 405 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | Sample | ||||
---|---|---|---|---|---|---|
Score / Max Score | 100 / 100 | 0 / 0 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
All | sample_01, sample_02, sample_03, testcase1, testcase2, testcase3, testcase4, testcase5, testcase6, testcase7 |
Sample | sample_01, sample_02, sample_03 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01 | AC | 1 ms | 256 KB |
sample_02 | AC | 1 ms | 256 KB |
sample_03 | AC | 1 ms | 256 KB |
testcase1 | AC | 1 ms | 256 KB |
testcase2 | AC | 1 ms | 256 KB |
testcase3 | AC | 1 ms | 256 KB |
testcase4 | AC | 1 ms | 256 KB |
testcase5 | AC | 1 ms | 256 KB |
testcase6 | AC | 1 ms | 256 KB |
testcase7 | AC | 1 ms | 256 KB |