Submission #131780

---

Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.LinkedList;
public class Main {	
//	Scanner in = new Scanner(System.in);
	public static void main(String[] args){
		new Main();
	}
	public Main(){		
//		new problem_B();
		new Atcoder_A();
	}
	
	class Atcoder_A{
		public Atcoder_A() {
			java.util.Scanner in = new java.util.Scanner(System.in);
			int n = in.nextInt();
			System.out.println(n*2);
			
			
			
		}
	}
	
	class problem_B{
		public problem_B() {
			Scanner in = new Scanner(System.in);
			int n = in.nextInt();
			LinkedList<Integer> list = new LinkedList<Integer>();
			LinkedList<Integer> list2 = new LinkedList<Integer>();
			for(int i=0;i<n;i++){
				int input = in.nextInt();
				if(!list.contains(input))list.add(input);
				else if(!list2.contains(input))list2.push(input);
			}
			Collections.sort(list);Collections.sort(list2);
			if(list2.size()>0&&list.get(list.size()-1)==list2.get(list2.size()-1))list2.remove(list2.size()-1);
			
			//print
			System.out.println(list.size()+list2.size());
			for(int i=0;i<list.size()-1;i++)System.out.print(list.get(i)+" ");
			System.out.print(list.get(list.size()-1));
			if(list2.size()>0){
				System.out.print(" ");
				for(int i=list2.size()-1;i>0;i--)System.out.print(list2.get(i)+" ");
				System.out.print(list2.get(0));
			}
			System.out.println();
		}

	    class Scanner {
	         InputStream in;
	         byte[] buf = new byte[1 << 10];
	         int p, n;
	         boolean[] isSpace = new boolean[128];
	         Scanner(InputStream in) {
	              this.in = in;
	              isSpace[' '] = isSpace['\n'] = isSpace['\r'] = isSpace['\t'] = true;
	         }
	         int read() {
	              if (n == -1) return -1;
	              if (p >= n) {
	                   p = 0;
	                   try {
	                        n = in.read(buf);
	                   } catch (IOException e) {
	                        throw new RuntimeException(e);
	                   }
	                   if (n <= 0) return -1;
	              }
	              return buf[p++];
	         }
	         boolean hasNext() {
	              int c = read();
	              while (c >= 0 && isSpace[c]) c = read();
	              if (c == -1) return false;
	              p--;
	              return true;
	         }
	         String next() {
	              if (!hasNext()) throw new InputMismatchException();
	              StringBuilder sb = new StringBuilder();
	              int c = read();
	              while (c >= 0 && !isSpace[c]) {
	                   sb.append((char)c);
	                   c = read();
	              }
	              return sb.toString();
	         }
	         int nextInt() {
	              if (!hasNext()) throw new InputMismatchException();
	              int c = read();
	              int sgn = 1;
	              if (c == '-') {
	                   sgn = -1;
	                   c = read();
	              }
	              int res = 0;
	              do {
	                   if (c < '0' || c > '9') throw new InputMismatchException();
	                   res *= 10;
	                   res += c - '0';
	                   c = read();
	              } while (c >= 0 && !isSpace[c]);
	              return res * sgn;
	         }
	         long nextLong() {
	              if (!hasNext()) throw new InputMismatchException();
	              int c = read();
	              int sgn = 1;
	              if (c == '-') {
	                   sgn = -1;
	                   c = read();
	              }
	              long res = 0;
	              do {
	                   if (c < '0' || c > '9') throw new InputMismatchException();
	                   res *= 10;
	                   res += c - '0';
	                   c = read();
	              } while (c >= 0 && !isSpace[c]);
	              return res * sgn;
	         }
	         double nextDouble() {
	              return Double.parseDouble(next());
	         }
	    }
	}
	
	

//	class problem_A{
//		public problem_A() {
//			int n = in.nextInt();
//			ArrayList<Integer> list = new ArrayList<Integer>();
//			for(int i=0;i<n;i++)list.add(in.nextInt());
//			int sereja=0,dima=0,num=0;
//			for(int i=0;list.size()>0;i++){
//				if(list.get(0)>list.get(list.size()-1))num=list.remove(0);
//				else num=list.remove(list.size()-1);
//				if(i%2==0)sereja+=num;
//				else dima+=num;
//			}
//			System.out.println(sereja+" "+dima);
//		}
//	}

}

Submission Info

Judge Result