結果

問題 No.280 歯車の問題(1)
ユーザー uwi
提出日時 2015-09-18 22:23:05
言語 Java8
(openjdk 1.8.0.222)
結果
AC  
実行時間 79 ms
コード長 2,897 Byte
コンパイル時間 2,554 ms
使用メモリ 19,236 KB
最終ジャッジ日時 2019-09-19 15:36:35

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
01.in AC 74 ms
19,228 KB
02.in AC 75 ms
19,232 KB
03.in AC 75 ms
19,232 KB
04.in AC 75 ms
19,232 KB
05.in AC 74 ms
19,232 KB
06.in AC 75 ms
19,228 KB
07.in AC 75 ms
19,232 KB
08.in AC 75 ms
19,232 KB
09.in AC 75 ms
19,232 KB
10.in AC 79 ms
19,228 KB
11.in AC 74 ms
19,232 KB
12.in AC 75 ms
19,228 KB
13.in AC 75 ms
19,228 KB
14.in AC 75 ms
19,228 KB
15.in AC 75 ms
19,228 KB
16.in AC 75 ms
19,236 KB
17.in AC 75 ms
19,228 KB
18.in AC 75 ms
19,228 KB
19.in AC 75 ms
19,232 KB
20.in AC 77 ms
19,232 KB
21.in AC 75 ms
19,228 KB
22.in AC 76 ms
19,228 KB
23.in AC 75 ms
19,232 KB
24.in AC 76 ms
19,232 KB
25.in AC 75 ms
19,228 KB
26.in AC 75 ms
19,228 KB
27.in AC 75 ms
19,228 KB
28.in AC 74 ms
19,232 KB
29.in AC 75 ms
19,232 KB
30.in AC 73 ms
19,232 KB
challenge01.txt AC 74 ms
19,228 KB
テストケース一括ダウンロード

ソースコード

diff #
package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q604 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		out.println(a[n-1] + "/" + a[0]);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q604().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0