Submission #345471


Source Code Expand

import java.util.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;



public class Main{
	
	// ArrayList<Integer> lis = new ArrayList<Integer>();
	// ArrayList<String> lis = new ArrayList<String>();
	// PriorityQueue<P> que = new PriorityQueue<P>();
	// PriorityQueue<Integer> que = new PriorityQueue<Integer>();
	//  Stack<Integer> que = new Stack<Integer>();
	//HashMap<Long,Long> map = new HashMap<Long,Long>();
    //	static long sum=0;
	// 1000000007 (10^9+7)
	static int mod = 1000000007;
	//static int mod = 1000000009; ArrayList<Integer> l[]= new ArrayList[n];
 //   static int dx[]={1,-1,0,0};
	//static int dy[]={0,0,1,-1};
//	static int dx[]={1,-1,0,0,1,1,-1,-1};
//  static int dy[]={0,0,1,-1,1,-1,1,-1};
	
	//static Set<Integer> set = new HashSet<Integer>();
	//static ArrayList<Integer> l[];
    //static int parent[][],depth[],node,max_log;
//   static ArrayList<Integer> nd[]= new ArrayList[2001];

public  static void main(String[] args)   throws Exception, IOException{

	//Scanner sc =new Scanner(System.in);
	
	Reader sc = new Reader(System.in);
   

	//int n=sc.nextInt();//,m=sc.nextInt(),k=sc.nextInt();
	//int a=sc.nextInt(),b=sc.nextInt(),c=sc.nextInt();
	
	//int n=sc.nextInt();//,k=sc.nextInt(),s=0;

   int a[]={sc.nextInt(),sc.nextInt(),sc.nextInt()};
sort(a);
   
System.out.println(a[1]);
}



 

/*
  static class P implements Comparable<P>{
	int id, d; ;
	P(int id,int d){
		this.id=id;
		this.d=d;
	} 
	
	public int compareTo(P x){
	//	return  (-x.d+d)>=0?1:-1  ; // ascend long
	//	return   -x.d+d  ; // ascend
		 return   x.d-d  ; //descend
	   }
 
}//*/


static void db(Object... os){
    System.err.println(Arrays.deepToString(os));

}

static boolean validpos(int x,int y,int r, int c){
	
	return x<r && 0<=x && y<c && 0<=y;
	
}

static boolean bit(int x,int k){
	// weather k-th bit (from right) be one or zero
	return  ( 0 < ( (x>>k) & 1 )  )  ? true:false;
}


}




class Reader
{ 
	private BufferedReader x;
	private StringTokenizer st;
	
	public Reader(InputStream in)
	{
		x = new BufferedReader(new InputStreamReader(in));
		st = null;
	}
	public String nextString() throws IOException
	{
		while( st==null || !st.hasMoreTokens() )
			st = new StringTokenizer(x.readLine());
		return st.nextToken();
	}
	public int nextInt() throws IOException
	{
		return Integer.parseInt(nextString());
	}
	public long nextLong() throws IOException
	{
		return Long.parseLong(nextString());
	}
	public double nextDouble() throws IOException
	{
		return Double.parseDouble(nextString());
	}
}

Submission Info

Submission Time
Task A - 高橋くんと年齢
User mukku
Language Java (OpenJDK 1.7.0)
Score 100
Code Size 2742 Byte
Status AC
Exec Time 447 ms
Memory 20772 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 24
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 411 ms 20736 KB
1.txt AC 413 ms 20740 KB
10.txt AC 421 ms 20772 KB
11.txt AC 412 ms 20748 KB
12.txt AC 408 ms 20644 KB
13.txt AC 418 ms 20640 KB
14.txt AC 413 ms 20744 KB
15.txt AC 411 ms 20656 KB
16.txt AC 411 ms 20644 KB
17.txt AC 413 ms 20652 KB
18.txt AC 410 ms 20616 KB
19.txt AC 409 ms 20648 KB
2.txt AC 411 ms 20748 KB
3.txt AC 418 ms 20636 KB
4.txt AC 416 ms 20660 KB
5.txt AC 410 ms 20672 KB
6.txt AC 410 ms 20748 KB
7.txt AC 411 ms 20660 KB
8.txt AC 413 ms 20684 KB
9.txt AC 415 ms 20704 KB
subtask0_sample_01.txt AC 421 ms 20728 KB
subtask0_sample_02.txt AC 447 ms 20664 KB
subtask0_sample_03.txt AC 424 ms 20684 KB
subtask0_sample_04.txt AC 422 ms 20680 KB