結果

問題 No.229 線分上を往復する3つの動点の一致
ユーザー uwi
提出日時 2015-06-19 23:12:49
言語 Java
(openjdk 23)
結果
AC  
実行時間 81 ms / 5,000 ms
コード長 3,710 bytes
コンパイル時間 3,393 ms
コンパイル使用メモリ 81,164 KB
実行使用メモリ 51,692 KB
最終ジャッジ日時 2024-07-07 04:15:23
合計ジャッジ時間 7,528 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

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 Q6617 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long a = nl(), b = nl(), c = nl();

		long[][][] ds = new long[2][2][];
		ds[0][0] = new long[]{b*a, b-a};
		ds[0][1] = new long[]{a*b, a+b};
		ds[1][0] = new long[]{c*b, c-b};
		ds[1][1] = new long[]{b*c, b+c};
		for(int i = 0;i < 2;i++){
			for(int j = 0;j < 2;j++){
				long g = gcd(ds[i][j][0], ds[i][j][1]);
				ds[i][j][0] /= g; ds[i][j][1] /= g;
			}
		}
		// a/b, c/d
		// ak/b=cl/d
		// adk=bcl
		long bnum = 1, bden = 0;
		for(int i = 0;i < 2;i++){
			for(int j = 0;j < 2;j++){
				long ad = ds[0][i][0]*ds[1][j][1];
				long bc = ds[0][i][1]*ds[1][j][0];
				long K = bc/gcd(ad,bc);
				long nn = ds[0][i][0]*K;
				long dd = ds[0][i][1];
				long gg = gcd(nn,dd);
				nn/=gg; dd/=gg;
				if(nn*bden < dd*bnum){
					bnum = nn;
					bden = dd;
				}
			}
		}
		out.println(bnum + "/" + bden);
	}
	
	public static long gcd(long a, long b) {
		while (b > 0) {
			long c = a;
			a = b;
			b = c % b;
		}
		return a;
	}
	
	
	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 Q6617().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