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

提出ソース

結果

問題	No.955 ax^2+bx+c=0
ユーザー	Suunn
提出日時	2020-05-07 07:52:57
言語	Java21 (openjdk 21)
結果	AC
実行時間	53 ms / 2,000 ms
コード長	5,859 bytes
コンパイル時間	2,864 ms
コンパイル使用メモリ	80,024 KB
実行使用メモリ	37,376 KB
最終ジャッジ日時	2024-07-03 09:17:37
合計ジャッジ時間	10,524 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	46 ms 37,184 KB
testcase_01	AC	46 ms 37,164 KB
testcase_02	AC	46 ms 36,884 KB
testcase_03	AC	46 ms 37,188 KB
testcase_04	AC	45 ms 37,056 KB
testcase_05	AC	47 ms 37,052 KB
testcase_06	AC	48 ms 37,140 KB
testcase_07	AC	49 ms 37,180 KB
testcase_08	AC	50 ms 37,248 KB
testcase_09	AC	50 ms 37,104 KB
testcase_10	AC	49 ms 37,104 KB
testcase_11	AC	48 ms 36,532 KB
testcase_12	AC	46 ms 37,080 KB
testcase_13	AC	46 ms 36,908 KB
testcase_14	AC	50 ms 36,992 KB
testcase_15	AC	48 ms 37,136 KB
testcase_16	AC	46 ms 37,088 KB
testcase_17	AC	45 ms 37,060 KB
testcase_18	AC	45 ms 37,180 KB
testcase_19	AC	43 ms 37,120 KB
testcase_20	AC	44 ms 36,984 KB
testcase_21	AC	47 ms 36,812 KB
testcase_22	AC	46 ms 37,084 KB
testcase_23	AC	45 ms 37,196 KB
testcase_24	AC	46 ms 36,664 KB
testcase_25	AC	46 ms 36,928 KB
testcase_26	AC	46 ms 36,684 KB
testcase_27	AC	45 ms 36,932 KB
testcase_28	AC	45 ms 36,644 KB
testcase_29	AC	45 ms 36,692 KB
testcase_30	AC	44 ms 36,932 KB
testcase_31	AC	47 ms 36,676 KB
testcase_32	AC	46 ms 37,036 KB
testcase_33	AC	46 ms 37,112 KB
testcase_34	AC	45 ms 36,888 KB
testcase_35	AC	45 ms 37,124 KB
testcase_36	AC	44 ms 36,692 KB
testcase_37	AC	46 ms 37,084 KB
testcase_38	AC	46 ms 37,032 KB
testcase_39	AC	44 ms 36,676 KB
testcase_40	AC	44 ms 36,972 KB
testcase_41	AC	45 ms 36,764 KB
testcase_42	AC	47 ms 37,176 KB
testcase_43	AC	48 ms 37,276 KB
testcase_44	AC	47 ms 36,904 KB
testcase_45	AC	49 ms 36,832 KB
testcase_46	AC	47 ms 36,668 KB
testcase_47	AC	47 ms 37,096 KB
testcase_48	AC	47 ms 36,988 KB
testcase_49	AC	45 ms 37,156 KB
testcase_50	AC	53 ms 37,240 KB
testcase_51	AC	45 ms 37,108 KB
testcase_52	AC	45 ms 37,240 KB
testcase_53	AC	46 ms 37,236 KB
testcase_54	AC	45 ms 37,308 KB
testcase_55	AC	45 ms 37,036 KB
testcase_56	AC	46 ms 37,240 KB
testcase_57	AC	45 ms 37,256 KB
testcase_58	AC	45 ms 37,308 KB
testcase_59	AC	47 ms 37,276 KB
testcase_60	AC	47 ms 36,892 KB
testcase_61	AC	48 ms 36,676 KB
testcase_62	AC	48 ms 37,112 KB
testcase_63	AC	49 ms 37,244 KB
testcase_64	AC	48 ms 37,108 KB
testcase_65	AC	50 ms 37,148 KB
testcase_66	AC	48 ms 37,140 KB
testcase_67	AC	46 ms 37,164 KB
testcase_68	AC	46 ms 37,052 KB
testcase_69	AC	47 ms 37,036 KB
testcase_70	AC	49 ms 36,652 KB
testcase_71	AC	49 ms 36,900 KB
testcase_72	AC	49 ms 36,992 KB
testcase_73	AC	48 ms 37,108 KB
testcase_74	AC	46 ms 36,864 KB
testcase_75	AC	45 ms 37,112 KB
testcase_76	AC	45 ms 37,108 KB
testcase_77	AC	47 ms 37,100 KB
testcase_78	AC	45 ms 37,136 KB
testcase_79	AC	45 ms 36,792 KB
testcase_80	AC	44 ms 36,676 KB
testcase_81	AC	45 ms 37,236 KB
testcase_82	AC	45 ms 37,248 KB
testcase_83	AC	46 ms 36,520 KB
testcase_84	AC	44 ms 37,108 KB
testcase_85	AC	44 ms 37,156 KB
testcase_86	AC	46 ms 36,804 KB
testcase_87	AC	48 ms 37,168 KB
testcase_88	AC	47 ms 36,804 KB
testcase_89	AC	44 ms 36,828 KB
testcase_90	AC	45 ms 37,112 KB
testcase_91	AC	44 ms 37,000 KB
testcase_92	AC	44 ms 36,980 KB
testcase_93	AC	46 ms 36,904 KB
testcase_94	AC	48 ms 36,820 KB
testcase_95	AC	47 ms 37,168 KB
testcase_96	AC	44 ms 36,904 KB
testcase_97	AC	44 ms 37,140 KB
testcase_98	AC	44 ms 37,188 KB
testcase_99	AC	46 ms 37,220 KB
testcase_100	AC	46 ms 37,016 KB
testcase_101	AC	45 ms 37,268 KB
testcase_102	AC	48 ms 36,864 KB
testcase_103	AC	46 ms 36,864 KB
testcase_104	AC	47 ms 37,240 KB
testcase_105	AC	47 ms 37,068 KB
testcase_106	AC	46 ms 36,780 KB
testcase_107	AC	46 ms 37,124 KB
testcase_108	AC	46 ms 36,804 KB
testcase_109	AC	45 ms 37,096 KB
testcase_110	AC	46 ms 37,248 KB
testcase_111	AC	44 ms 36,864 KB
testcase_112	AC	45 ms 36,876 KB
testcase_113	AC	47 ms 36,676 KB
testcase_114	AC	46 ms 37,092 KB
testcase_115	AC	47 ms 37,092 KB
testcase_116	AC	45 ms 37,316 KB
testcase_117	AC	46 ms 37,180 KB
testcase_118	AC	46 ms 37,312 KB
testcase_119	AC	46 ms 36,880 KB
testcase_120	AC	46 ms 37,376 KB
testcase_121	AC	45 ms 37,100 KB
testcase_122	AC	47 ms 37,124 KB
testcase_123	AC	46 ms 36,772 KB
testcase_124	AC	47 ms 37,112 KB

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

ソースコード

raw source code

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.NoSuchElementException;
import java.util.Queue;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.TreeSet;

public class Main {
	static MLScanner sc = new MLScanner(System.in);
	static PrintWriter ot = new PrintWriter(System.out);
	static String sp = " ";
	public static void main(String[] args) {
		int T = 1;
		for(int i=0;i<T;i++) {
			long A = sc.nextLong();
			long B = sc.nextLong();
			long C = sc.nextLong();
			double a = A;
			double b = B;
			double c = C;
			if(A==0&&B==0) {
				if(C==0)ot.println(-1);
				else ot.println(0);
			}else if(A==0) {
				ot.println(1);
				ot.println(-c/b);
			}else {
				if(B<0) {
					A *= -1;
					B *= -1;
					C *= -1;
					a *= -1;
					b *= -1;
					c *= -1;
				}
				long D = B*B-4*A*C;
				if(D<0) ot.println(0);
				else if(D==0) {
					ot.println(1);
					ot.println(-b/(2*a));
				}
				else {
					double ans1 = -(b+Math.sqrt(D))/(2*a);
					double ans2 = -(B*B-D)/(2*a*(b+Math.sqrt(D)));
					if(ans1>ans2) {
						double tmp = ans1;
						ans1 = ans2;
						ans2 = tmp;
					}
					ot.println(2);
					ot.println(ans1);
					ot.println(ans2);
				}
			}
		}
		ot.flush();
	
	}
}

class MLScanner {
	  private static final int BUFFER_SIZE = 1024;
	  
	  private final InputStream stream;
	  private final byte[] buffer;
	  private int pointer;
	  private int bufferLength;
	  
	  MLScanner(InputStream stream) {
	    this.stream = stream;
	    this.buffer = new byte[BUFFER_SIZE];
	    this.pointer = 0;
	    this.bufferLength = 0;
	  }
	  
	  private boolean hasNextByte() {
	    if (pointer < bufferLength) {
	      return true;
	    }
	    
	    pointer = 0;
	    try {
	      bufferLength = stream.read(buffer);
	    } catch (IOException e) {
	      throw new RuntimeException(e);
	    }
	    return bufferLength > 0;
	  }
	  
	  private int readByte() {
	    if (hasNextByte()) {
	      return buffer[pointer++];
	    } else {
	      return -1;
	    }
	  }
	  
	  private static boolean isPrintableChar(int c) {
	    return 33 <= c && c <= 126;
	  }
	  
	  public boolean hasNext() {
	    while (hasNextByte() && !isPrintableChar(buffer[pointer])) {
	      pointer++;
	    }
	    return hasNextByte();
	  }
	  
	  public String next() {
	    if (!hasNext()) {
	      throw new NoSuchElementException();
	    }
	    StringBuilder sb = new StringBuilder();
	    while(true) {
	      int b = readByte();
	      if (!isPrintableChar(b)) {
	        break;
	      }
	      sb.appendCodePoint(b);
	    }
	    return sb.toString();
	  }
	  
	  public char nextChar() {
	    return next().charAt(0);
	  }
	  
	  public int nextInt() {
	    long nl = nextLong();
	    if (nl < Integer.MIN_VALUE || Integer.MAX_VALUE < nl) {
	      throw new NumberFormatException();
	    }
	    return (int) nl;
	  }
	  
	  public long nextLong() {
	    if (!hasNext()) {
	      throw new NoSuchElementException();
	    }
	    
	    long n = 0;
	    boolean minus = false;
	    
	    {
	      int b = readByte();
	      if (b == '-') {
	        minus = true;
	      } else if ('0' <= b && b <= '9') {
	        n = b - '0';
	      } else {
	        throw new NumberFormatException();
	      }
	    }
	    
	    while(true){
	      int b = readByte();
	      if ('0' <= b && b <= '9') {
	        n *= 10;
	        n += b - '0';
	      } else if (b == -1 || !isPrintableChar(b)) {
	        return minus ? -n : n;
	      } else {
	        throw new NumberFormatException();
	      }
	    }
	  }
	  
	  public double nextDouble() {
	    return Double.parseDouble(next());
	  }
	  
	  public String[] next(int n) {
	    String[] array = new String[n];
	    for (int i = 0; i < n; i++) {
	      array[i] = next();
	    }
	    return array;
	  }
	  
	  public char[] nextChar(int n) {
	    char[] array = new char[n];
	    for (int i = 0; i < n; i++) {
	      array[i] = nextChar();
	    }
	    return array;
	  }
	  
	  public int[] nextInt(int n) {
	    int[] array = new int[n];
	    for (int i = 0; i < n; i++) {
	      array[i] = nextInt();
	    }
	    return array;
	  }
	  
	  public long[] nextLong(int n) {
	    long[] array = new long[n];
	    for (int i = 0; i < n; i++) {
	      array[i] = nextLong();
	    }
	    return array;
	  }
	  
	  public double[] nextDouble(int n) {
	    double[] array = new double[n];
	    for (int i = 0; i < n; i++) {
	      array[i] = nextDouble();
	    }
	    return array;
	  }
	  
	  public char[] nextCharArray() {
	    return next().toCharArray();
	  }
	  
	  public int[][] nextInt(int n, int m) {
	    int[][] matrix = new int[n][m];
	    for (int i = 0; i < n; i++) {
	      for (int j = 0; j < m; j++) {
	        matrix[i][j] = nextInt();
	      }
	    }
	    return matrix;
	  }
	  
	  public char[][] nextChar(int n, int m) {
	    char[][] matrix = new char[n][m];
	    for (int i = 0; i < n; i++) {
	      for (int j = 0; j < m; j++) {
	        matrix[i][j] = nextChar();
	      }
	    }
	    return matrix;
	  }
	  
	  public long[][] nextLong(int n, int m) {
	    long[][] matrix = new long[n][m];
	    for (int i = 0; i < n; i++) {
	      for (int j = 0; j < m; j++) {
	        matrix[i][j] = nextLong();
	      }
	    }
	    return matrix;
	  }
	  
	  public double[][] nextDouble(int n, int m) {
	    double[][] matrix = new double[n][m];
	    for (int i = 0; i < n; i++) {
	      for (int j = 0; j < m; j++) {
	        matrix[i][j] = nextDouble();
	      }
	    }
	    return matrix;
	  }
	  
	  public char[][] nextCharArray(int n) {
	    char[][] matrix = new char[n][];
	    for (int i = 0; i < n; i++) {
	      matrix[i] = next().toCharArray();
	    }
	    return matrix;
	  }
	}

yukicoder

結果

テストケース

ソースコード