Submission #2701112
Source Code Expand
#include <iostream> #include <algorithm> #include <cmath> #include <iomanip> #include <vector> #include <utility> #include <numeric> #include <string> #include <set> #include <map> #include <tuple> #include <queue> #define rep(i, a, n) for(int i = int(a);i < int(n);++i) #define repe(i, a, n) for(int i = int(a);i <= int(n);++i) #define repr(i, a, n) for(int i = int(a);i > int(n);--i) #define reper(i, a, n) for(int i = int(a);i >= int(n);--i) #define SIZE(x) ((int)(x).size()) #define ALL(x) (x).begin(), (x).end() #define ALLARY(x) begin(x), end(x) #define YES cout << "YES" << endl #define NO cout << "NO" << endl #define Yes cout << "Yes" << endl #define No cout << "No" << endl #define yes cout << "yes" << endl; #define no cout << "no" << endl; #define pb push_back #define EPS (1e-20) #define INF 2147483647 #define MOD 1000000007 using llint = long long; using VI = std::vector<int>; using PII = std::pair<int, int>; using SI = std::set<int>; using MII = std::map<int, int>; using namespace std; int main(){ int abc[3]; cin >> abc[0] >> abc[1] >> abc[2]; sort(ALLARY(abc)); cout << abc[1] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 高橋くんと年齢 |
User | AqFv |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1174 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 KB |
1.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
14.txt | AC | 1 ms | 256 KB |
15.txt | AC | 1 ms | 256 KB |
16.txt | AC | 1 ms | 256 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | AC | 1 ms | 256 KB |
19.txt | AC | 1 ms | 256 KB |
2.txt | AC | 1 ms | 256 KB |
3.txt | AC | 1 ms | 256 KB |
4.txt | AC | 1 ms | 256 KB |
5.txt | AC | 1 ms | 256 KB |
6.txt | AC | 1 ms | 256 KB |
7.txt | AC | 1 ms | 256 KB |
8.txt | AC | 1 ms | 256 KB |
9.txt | AC | 1 ms | 256 KB |
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask0_sample_04.txt | AC | 1 ms | 256 KB |