#410083 (Java21) No.955 ax^2+bx+c=0

提出ソース

結果

問題	No.955 ax^2+bx+c=0
ユーザー	uwi
提出日時	2019-12-18 15:06:08
言語	Java21 (openjdk 21)
結果	AC
実行時間	150 ms / 2,000 ms
コード長	5,944 bytes
コンパイル時間	3,554 ms
コンパイル使用メモリ	85,792 KB
実行使用メモリ	44,888 KB
最終ジャッジ日時	2024-09-18 22:11:56
合計ジャッジ時間	17,086 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	99 ms 40,296 KB
testcase_01	AC	97 ms 42,940 KB
testcase_02	AC	52 ms 37,080 KB
testcase_03	AC	51 ms 37,080 KB
testcase_04	AC	49 ms 37,044 KB
testcase_05	AC	48 ms 37,100 KB
testcase_06	AC	48 ms 36,964 KB
testcase_07	AC	48 ms 36,864 KB
testcase_08	AC	47 ms 36,968 KB
testcase_09	AC	47 ms 36,788 KB
testcase_10	AC	47 ms 36,800 KB
testcase_11	AC	46 ms 36,972 KB
testcase_12	AC	47 ms 36,932 KB
testcase_13	AC	48 ms 36,752 KB
testcase_14	AC	90 ms 42,448 KB
testcase_15	AC	90 ms 42,424 KB
testcase_16	AC	95 ms 42,348 KB
testcase_17	AC	96 ms 42,332 KB
testcase_18	AC	95 ms 42,160 KB
testcase_19	AC	94 ms 42,456 KB
testcase_20	AC	94 ms 41,944 KB
testcase_21	AC	96 ms 42,704 KB
testcase_22	AC	91 ms 42,704 KB
testcase_23	AC	95 ms 42,072 KB
testcase_24	AC	94 ms 42,436 KB
testcase_25	AC	93 ms 42,340 KB
testcase_26	AC	95 ms 41,920 KB
testcase_27	AC	94 ms 42,136 KB
testcase_28	AC	93 ms 42,084 KB
testcase_29	AC	93 ms 42,424 KB
testcase_30	AC	96 ms 42,472 KB
testcase_31	AC	97 ms 42,280 KB
testcase_32	AC	95 ms 42,572 KB
testcase_33	AC	94 ms 42,164 KB
testcase_34	AC	101 ms 40,840 KB
testcase_35	AC	103 ms 39,972 KB
testcase_36	AC	99 ms 40,396 KB
testcase_37	AC	98 ms 40,104 KB
testcase_38	AC	97 ms 40,344 KB
testcase_39	AC	98 ms 40,488 KB
testcase_40	AC	99 ms 39,984 KB
testcase_41	AC	102 ms 40,320 KB
testcase_42	AC	103 ms 40,600 KB
testcase_43	AC	102 ms 41,108 KB
testcase_44	AC	102 ms 40,464 KB
testcase_45	AC	98 ms 40,376 KB
testcase_46	AC	99 ms 40,408 KB
testcase_47	AC	84 ms 40,684 KB
testcase_48	AC	99 ms 40,640 KB
testcase_49	AC	103 ms 40,804 KB
testcase_50	AC	96 ms 40,632 KB
testcase_51	AC	104 ms 40,700 KB
testcase_52	AC	103 ms 40,184 KB
testcase_53	AC	101 ms 40,544 KB
testcase_54	AC	101 ms 40,808 KB
testcase_55	AC	102 ms 39,968 KB
testcase_56	AC	100 ms 40,744 KB
testcase_57	AC	101 ms 40,480 KB
testcase_58	AC	150 ms 44,008 KB
testcase_59	AC	144 ms 44,004 KB
testcase_60	AC	48 ms 36,696 KB
testcase_61	AC	47 ms 36,936 KB
testcase_62	AC	100 ms 39,844 KB
testcase_63	AC	100 ms 40,136 KB
testcase_64	AC	46 ms 36,904 KB
testcase_65	AC	96 ms 40,516 KB
testcase_66	AC	46 ms 36,676 KB
testcase_67	AC	97 ms 40,764 KB
testcase_68	AC	49 ms 36,960 KB
testcase_69	AC	99 ms 40,500 KB
testcase_70	AC	103 ms 40,148 KB
testcase_71	AC	46 ms 36,948 KB
testcase_72	AC	47 ms 36,748 KB
testcase_73	AC	98 ms 40,240 KB
testcase_74	AC	96 ms 40,848 KB
testcase_75	AC	47 ms 37,096 KB
testcase_76	AC	47 ms 37,024 KB
testcase_77	AC	99 ms 40,668 KB
testcase_78	AC	99 ms 40,188 KB
testcase_79	AC	99 ms 40,568 KB
testcase_80	AC	49 ms 36,652 KB
testcase_81	AC	99 ms 40,108 KB
testcase_82	AC	98 ms 42,084 KB
testcase_83	AC	87 ms 42,196 KB
testcase_84	AC	96 ms 42,176 KB
testcase_85	AC	94 ms 42,384 KB
testcase_86	AC	98 ms 42,592 KB
testcase_87	AC	96 ms 42,600 KB
testcase_88	AC	97 ms 42,424 KB
testcase_89	AC	92 ms 42,332 KB
testcase_90	AC	97 ms 42,420 KB
testcase_91	AC	100 ms 42,472 KB
testcase_92	AC	49 ms 37,052 KB
testcase_93	AC	47 ms 36,788 KB
testcase_94	AC	102 ms 42,424 KB
testcase_95	AC	92 ms 42,496 KB
testcase_96	AC	100 ms 42,508 KB
testcase_97	AC	102 ms 42,560 KB
testcase_98	AC	87 ms 42,264 KB
testcase_99	AC	94 ms 42,048 KB
testcase_100	AC	50 ms 36,744 KB
testcase_101	AC	98 ms 42,596 KB
testcase_102	AC	97 ms 42,364 KB
testcase_103	AC	96 ms 42,632 KB
testcase_104	AC	93 ms 42,456 KB
testcase_105	AC	98 ms 42,728 KB
testcase_106	AC	100 ms 42,440 KB
testcase_107	AC	97 ms 42,368 KB
testcase_108	AC	92 ms 42,548 KB
testcase_109	AC	94 ms 42,364 KB
testcase_110	AC	98 ms 42,528 KB
testcase_111	AC	93 ms 42,660 KB
testcase_112	AC	93 ms 42,708 KB
testcase_113	AC	85 ms 42,432 KB
testcase_114	AC	94 ms 42,284 KB
testcase_115	AC	93 ms 42,784 KB
testcase_116	AC	97 ms 42,204 KB
testcase_117	AC	99 ms 42,724 KB
testcase_118	AC	98 ms 42,592 KB
testcase_119	AC	98 ms 42,424 KB
testcase_120	AC	94 ms 42,560 KB
testcase_121	AC	97 ms 42,608 KB
testcase_122	AC	102 ms 40,280 KB
testcase_123	AC	142 ms 44,888 KB
testcase_124	AC	135 ms 43,608 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package adv2019;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.MathContext;
import java.util.Arrays;
import java.util.InputMismatchException;

public class D17_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long a = nl(), b = nl(), c = nl();
		long[][] res = solveQuad(a, b, c);
		if(res == null){
			out.println(-1);
		}else{
			out.println(res.length);
			for(long[] u : res){
				out.println(
				BigDecimal.valueOf(u[0]).add(BigDecimal.valueOf(u[1]).multiply(sqrt(u[2]), cx))
				.divide(BigDecimal.valueOf(u[3]), cx).toPlainString());
				
//				out.printf("%.20f\n", (u[0] + u[1] * Math.sqrt(u[2])) / u[3]);
			}
		}
	}
	
	MathContext cx = new MathContext(128);
	
	BigDecimal sqrt(long a)
	{
		BigDecimal cur = BigDecimal.ONE;
		// (x+a/x)/2
		for(int rep = 0;rep < 200;rep++){
			cur = cur.add(BigDecimal.valueOf(a).divide(cur, cx)).divide(BigDecimal.valueOf(2), cx);
		}
		return cur;
	}
	
	public static long[][] solveQuad(long A, long B, long C)
	{
		if(A == 0){
			if(B == 0){
				return C == 0 ? null : new long[0][];
			}else{
				return new long[][]{reducex(new long[]{-C, 0, 0, B})};
			}
		}
		
		long D = B*B-4*A*C;
		if(D < 0){
			return new long[0][];
		}else if(D == 0){
			return new long[][]{reducex(new long[]{-B, 0, 0, 2L*A})};
		}else{
			if(A > 0){
				return new long[][]{
						reducex(new long[]{-B, -1, D, 2L*A}),
						reducex(new long[]{-B, 1, D, 2L*A})
				};
			}else{
				return new long[][]{
						reducex(new long[]{-B, 1, D, 2L*A}),
						reducex(new long[]{-B, -1, D, 2L*A})
				};
			}
		}
	}
	
	public static long gcd(long a, long b) {
		while (b > 0) {
			long c = a;
			a = b;
			b = c % b;
		}
		return a;
	}
	
	
	public static long[] reducex(long[] f)
	{
		if(f[2] == 0)return f;
		long g = gcd(Math.abs(f[0]), Math.abs(f[3]));
		if(g == 0)return f;
		for(long p = 2;p*p <= g;p++){
			if(g % p == 0 && f[2] % (p*p) == 0){
				f[2] /= p*p;
				g /= p;
				f[0] /= p;
				f[3] /= p;
			}
		}
		
		return f;
//		// f[2] < 0 ??
//		if(f[2] == 0)f[1] = 0;
//		if(f[1] == 0)f[2] = 0;
//		if(f[2] == 0 || f[1] == 0){
//			// normal fraction
//			if(f[3] == 0) { // n/0
//				f[0] = 1;
//			}else if(f[0] == 0) { // 0/n
//				f[3] = 1;
//			}else {
//				if(f[3] < 0) { // -a/-b ->a/b
//					f[0] = -f[0];
//					f[3] = -f[3];
//				}
//				long a = Math.abs(f[0]), b = f[3];
//				while (b > 0) {
//					long c = a;
//					a = b;
//					b = c % b;
//				}
//				f[0] /= a;
//				f[3] /= a;
//			}
//		}else{
//			for(long p = 2;p * p <= f[2];p++){
//				while(f[2] % (p*p) == 0){
//					f[1] *= p;
//					f[2] /= p*p;
//				}
//			}
//			if(f[3] == 0) { // n/0
//				f[0] = 1;
//				f[1] = f[2] = 0;
//			}else {
//				if(f[3] < 0) { // -a/-b ->a/b
//					f[0] = -f[0];
//					f[1] = -f[1];
//					f[3] = -f[3];
//				}
//				long a = Math.abs(f[0]), b = f[3];
//				while (b > 0) {
//					long c = a;
//					a = b;
//					b = c % b;
//				}
//				b = Math.abs(f[1]);
//				while (b > 0) {
//					long c = a;
//					a = b;
//					b = c % b;
//				}
//				
//				f[0] /= a;
//				f[1] /= a;
//				f[3] /= a;
//			}
//		}
//		return f;
	}

	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new D17_2().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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)); }
}

yukicoder

結果

テストケース

ソースコード