結果

問題 No.328 きれいな連立方程式
ユーザー uwiuwi
提出日時 2015-12-21 04:04:43
言語 Java21
(openjdk 21)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 3,607 bytes
コンパイル時間 3,338 ms
コンパイル使用メモリ 83,396 KB
実行使用メモリ 50,284 KB
最終ジャッジ日時 2024-09-17 21:16:07
合計ジャッジ時間 6,748 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 49 ms
49,812 KB
testcase_02 AC 49 ms
50,000 KB
testcase_03 AC 48 ms
50,124 KB
testcase_04 AC 48 ms
50,252 KB
testcase_05 AC 50 ms
50,160 KB
testcase_06 AC 51 ms
50,092 KB
testcase_07 AC 52 ms
50,272 KB
testcase_08 AC 52 ms
49,800 KB
testcase_09 AC 51 ms
50,004 KB
testcase_10 AC 50 ms
50,284 KB
testcase_11 AC 52 ms
50,136 KB
testcase_12 AC 50 ms
49,956 KB
testcase_13 AC 50 ms
49,724 KB
testcase_14 AC 51 ms
50,168 KB
testcase_15 AC 52 ms
50,172 KB
testcase_16 AC 51 ms
49,944 KB
testcase_17 AC 50 ms
50,184 KB
testcase_18 AC 49 ms
50,240 KB
testcase_19 AC 49 ms
50,144 KB
testcase_20 AC 49 ms
50,184 KB
testcase_21 AC 50 ms
50,060 KB
testcase_22 AC 53 ms
50,192 KB
testcase_23 AC 50 ms
50,196 KB
testcase_24 AC 50 ms
50,188 KB
testcase_25 AC 52 ms
49,812 KB
testcase_26 AC 52 ms
50,216 KB
testcase_27 AC 53 ms
50,204 KB
testcase_28 AC 52 ms
49,816 KB
testcase_29 AC 53 ms
50,120 KB
testcase_30 AC 51 ms
49,904 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 Q703 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int c1 = ni();
		int c2 = ni();
		int c3 = ni();
		int c4 = ni();
		if(c1 == 0){
			out.println("R");
			return;
		}
		// c3=c1((c2/c1)^2-b^2)
		// b^2=(c2/c1)^2-c3/c1 ?
		// c4=c1((c2/c1)^3-3(c2/c1)b^2)
		// 3(c2/c1)b^2=(c2/c1)^3-c4/c1
		// b^2=(c2/c1)^2/3-c4/3c2
		long num = c2*c2-c3*c1;
//		long den = c1*c1;
		long den = 1L;
		if(c2 != 0){
			long xnum = (long)c2*c2*c2-(long)c4*c1*c1;
	//		long xden = 3L*c2*c1*c1;
			long xden = 3L*c2;
			if(num < 0 || xnum*xden < 0){
				out.println("R");
				return;
			}
			if(num*xden == den*xnum){
				out.println("I");
			}else{
				out.println("R");
			}
		}else{
			if(c4 != 0 || num < 0){
				out.println("R");
				return;
			}
			out.println("I");
		}
	}
	
	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 Q703().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