Submission #345277
Source Code Expand
#include <string> #include <vector> #include <algorithm> #include <numeric> #include <set> #include <map> #include <queue> #include <iostream> #include <sstream> #include <cstdio> #include <cmath> #include <ctime> #include <cstring> #include <cctype> #include <cassert> #include <limits> #include <functional> #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i)) #if defined(_MSC_VER) || __cplusplus > 199711L #define aut(r,v) auto r = (v) #else #define aut(r,v) __typeof(v) r = (v) #endif #define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it) #define all(o) (o).begin(), (o).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset(m,v,sizeof(m)) #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3fLL using namespace std; typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll; template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; } template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; } int main() { int a[3]; cin >> a[0] >> a[1] >> a[2]; sort(a, a + 3); cout << a[1] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 高橋くんと年齢 |
User | anta |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1324 Byte |
Status | AC |
Exec Time | 25 ms |
Memory | 924 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt |
All | 0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0.txt | AC | 22 ms | 680 KB |
1.txt | AC | 24 ms | 676 KB |
10.txt | AC | 23 ms | 800 KB |
11.txt | AC | 25 ms | 732 KB |
12.txt | AC | 22 ms | 800 KB |
13.txt | AC | 23 ms | 676 KB |
14.txt | AC | 23 ms | 672 KB |
15.txt | AC | 21 ms | 800 KB |
16.txt | AC | 24 ms | 800 KB |
17.txt | AC | 23 ms | 796 KB |
18.txt | AC | 22 ms | 924 KB |
19.txt | AC | 22 ms | 716 KB |
2.txt | AC | 24 ms | 752 KB |
3.txt | AC | 22 ms | 796 KB |
4.txt | AC | 23 ms | 796 KB |
5.txt | AC | 23 ms | 800 KB |
6.txt | AC | 23 ms | 736 KB |
7.txt | AC | 24 ms | 800 KB |
8.txt | AC | 24 ms | 912 KB |
9.txt | AC | 23 ms | 796 KB |
subtask0_sample_01.txt | AC | 24 ms | 792 KB |
subtask0_sample_02.txt | AC | 23 ms | 788 KB |
subtask0_sample_03.txt | AC | 23 ms | 800 KB |
subtask0_sample_04.txt | AC | 23 ms | 800 KB |