結果

問題 No.236 鴛鴦茶
ユーザー uwiuwi
提出日時 2015-07-05 22:22:35
言語 Java19
(openjdk 21)
結果
AC  
実行時間 119 ms / 2,000 ms
コード長 2,930 bytes
コンパイル時間 4,684 ms
コンパイル使用メモリ 77,676 KB
実行使用メモリ 56,044 KB
最終ジャッジ日時 2023-09-10 21:44:52
合計ジャッジ時間 8,926 ms
ジャッジサーバーID
(参考情報)
judge11 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 119 ms
55,496 KB
testcase_01 AC 116 ms
55,464 KB
testcase_02 AC 115 ms
55,376 KB
testcase_03 AC 116 ms
55,480 KB
testcase_04 AC 115 ms
55,732 KB
testcase_05 AC 115 ms
53,424 KB
testcase_06 AC 114 ms
55,736 KB
testcase_07 AC 114 ms
55,344 KB
testcase_08 AC 114 ms
55,208 KB
testcase_09 AC 111 ms
55,432 KB
testcase_10 AC 116 ms
55,764 KB
testcase_11 AC 115 ms
55,576 KB
testcase_12 AC 116 ms
55,488 KB
testcase_13 AC 114 ms
56,044 KB
testcase_14 AC 114 ms
55,184 KB
testcase_15 AC 115 ms
55,604 KB
testcase_16 AC 117 ms
55,432 KB
testcase_17 AC 115 ms
55,740 KB
testcase_18 AC 115 ms
55,632 KB
testcase_19 AC 117 ms
55,676 KB
testcase_20 AC 115 ms
55,244 KB
testcase_21 AC 115 ms
55,888 KB
testcase_22 AC 116 ms
55,464 KB
testcase_23 AC 116 ms
55,376 KB
testcase_24 AC 115 ms
55,172 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 Q592 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		double a = nd(), b = nd() ,x = nd(), y = nd();
		double zy = y * (a+b) / b;
		double zx = x * (a+b) / a;
		out.printf("%.12f\n", Math.min(zx, zy));
	}
	
	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 Q592().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