Submission #598285
Source Code Expand
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) memset((a),0,sizeof(a))
#define MCLR(a) memset((a),-1,sizeof(a))
#define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI > VVI;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef pair<int,int> PII;
const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};
int main(){
int n;
VI N;
REP(i,3){
cin >> n;
N.PB(n);
}
sort(N.begin(),N.end());
cout << N[1] << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 高橋くんと年齢 |
User |
litchi0503 |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
1255 Byte |
Status |
AC |
Exec Time |
28 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 |
23 ms |
924 KB |
1.txt |
AC |
24 ms |
796 KB |
10.txt |
AC |
24 ms |
920 KB |
11.txt |
AC |
27 ms |
796 KB |
12.txt |
AC |
23 ms |
836 KB |
13.txt |
AC |
24 ms |
796 KB |
14.txt |
AC |
24 ms |
800 KB |
15.txt |
AC |
23 ms |
796 KB |
16.txt |
AC |
25 ms |
828 KB |
17.txt |
AC |
24 ms |
800 KB |
18.txt |
AC |
24 ms |
924 KB |
19.txt |
AC |
24 ms |
800 KB |
2.txt |
AC |
25 ms |
924 KB |
3.txt |
AC |
24 ms |
792 KB |
4.txt |
AC |
26 ms |
800 KB |
5.txt |
AC |
25 ms |
924 KB |
6.txt |
AC |
26 ms |
924 KB |
7.txt |
AC |
27 ms |
800 KB |
8.txt |
AC |
27 ms |
924 KB |
9.txt |
AC |
24 ms |
800 KB |
subtask0_sample_01.txt |
AC |
28 ms |
840 KB |
subtask0_sample_02.txt |
AC |
25 ms |
796 KB |
subtask0_sample_03.txt |
AC |
24 ms |
800 KB |
subtask0_sample_04.txt |
AC |
25 ms |
800 KB |