結果

問題 No.955 ax^2+bx+c=0
ユーザー OlandOland
提出日時 2019-12-22 14:12:50
言語 Java21
(openjdk 21)
結果
AC  
実行時間 61 ms / 2,000 ms
コード長 7,579 bytes
コンパイル時間 3,640 ms
コンパイル使用メモリ 78,728 KB
実行使用メモリ 53,728 KB
最終ジャッジ日時 2023-10-19 02:17:20
合計ジャッジ時間 13,661 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
52,648 KB
testcase_01 AC 57 ms
52,668 KB
testcase_02 AC 58 ms
53,680 KB
testcase_03 AC 58 ms
53,672 KB
testcase_04 AC 57 ms
52,584 KB
testcase_05 AC 57 ms
53,676 KB
testcase_06 AC 57 ms
52,636 KB
testcase_07 AC 55 ms
53,672 KB
testcase_08 AC 56 ms
53,620 KB
testcase_09 AC 58 ms
53,672 KB
testcase_10 AC 58 ms
53,680 KB
testcase_11 AC 58 ms
53,680 KB
testcase_12 AC 58 ms
53,676 KB
testcase_13 AC 58 ms
53,672 KB
testcase_14 AC 58 ms
52,568 KB
testcase_15 AC 58 ms
52,628 KB
testcase_16 AC 59 ms
53,676 KB
testcase_17 AC 57 ms
52,632 KB
testcase_18 AC 59 ms
52,560 KB
testcase_19 AC 60 ms
53,684 KB
testcase_20 AC 57 ms
53,672 KB
testcase_21 AC 57 ms
52,584 KB
testcase_22 AC 57 ms
53,620 KB
testcase_23 AC 57 ms
52,624 KB
testcase_24 AC 58 ms
53,684 KB
testcase_25 AC 59 ms
52,612 KB
testcase_26 AC 58 ms
53,684 KB
testcase_27 AC 59 ms
53,676 KB
testcase_28 AC 58 ms
53,680 KB
testcase_29 AC 59 ms
52,620 KB
testcase_30 AC 61 ms
52,584 KB
testcase_31 AC 58 ms
53,684 KB
testcase_32 AC 58 ms
53,684 KB
testcase_33 AC 58 ms
53,692 KB
testcase_34 AC 58 ms
50,624 KB
testcase_35 AC 57 ms
52,612 KB
testcase_36 AC 58 ms
53,696 KB
testcase_37 AC 59 ms
53,704 KB
testcase_38 AC 58 ms
53,704 KB
testcase_39 AC 56 ms
53,708 KB
testcase_40 AC 58 ms
52,668 KB
testcase_41 AC 56 ms
53,708 KB
testcase_42 AC 58 ms
52,632 KB
testcase_43 AC 57 ms
50,580 KB
testcase_44 AC 59 ms
53,708 KB
testcase_45 AC 59 ms
52,656 KB
testcase_46 AC 60 ms
53,712 KB
testcase_47 AC 60 ms
53,716 KB
testcase_48 AC 58 ms
53,704 KB
testcase_49 AC 58 ms
51,664 KB
testcase_50 AC 58 ms
53,708 KB
testcase_51 AC 60 ms
53,712 KB
testcase_52 AC 59 ms
52,612 KB
testcase_53 AC 58 ms
52,636 KB
testcase_54 AC 57 ms
52,652 KB
testcase_55 AC 58 ms
53,708 KB
testcase_56 AC 58 ms
53,704 KB
testcase_57 AC 57 ms
53,696 KB
testcase_58 AC 59 ms
53,708 KB
testcase_59 AC 57 ms
51,656 KB
testcase_60 AC 58 ms
53,692 KB
testcase_61 AC 59 ms
52,608 KB
testcase_62 AC 58 ms
51,708 KB
testcase_63 AC 58 ms
52,656 KB
testcase_64 AC 58 ms
53,688 KB
testcase_65 AC 58 ms
53,704 KB
testcase_66 AC 58 ms
53,672 KB
testcase_67 AC 57 ms
53,704 KB
testcase_68 AC 58 ms
53,680 KB
testcase_69 AC 57 ms
53,704 KB
testcase_70 AC 57 ms
53,696 KB
testcase_71 AC 57 ms
52,612 KB
testcase_72 AC 57 ms
52,568 KB
testcase_73 AC 59 ms
53,704 KB
testcase_74 AC 58 ms
53,708 KB
testcase_75 AC 58 ms
52,620 KB
testcase_76 AC 59 ms
53,676 KB
testcase_77 AC 59 ms
52,608 KB
testcase_78 AC 57 ms
53,704 KB
testcase_79 AC 57 ms
53,696 KB
testcase_80 AC 58 ms
53,684 KB
testcase_81 AC 58 ms
53,700 KB
testcase_82 AC 56 ms
52,660 KB
testcase_83 AC 57 ms
53,708 KB
testcase_84 AC 57 ms
53,704 KB
testcase_85 AC 58 ms
52,636 KB
testcase_86 AC 57 ms
52,640 KB
testcase_87 AC 56 ms
53,672 KB
testcase_88 AC 56 ms
52,620 KB
testcase_89 AC 57 ms
53,684 KB
testcase_90 AC 57 ms
53,696 KB
testcase_91 AC 58 ms
53,648 KB
testcase_92 AC 56 ms
52,624 KB
testcase_93 AC 57 ms
53,680 KB
testcase_94 AC 57 ms
53,696 KB
testcase_95 AC 57 ms
52,628 KB
testcase_96 AC 57 ms
52,628 KB
testcase_97 AC 57 ms
53,696 KB
testcase_98 AC 58 ms
53,708 KB
testcase_99 AC 57 ms
52,632 KB
testcase_100 AC 57 ms
53,680 KB
testcase_101 AC 57 ms
53,696 KB
testcase_102 AC 57 ms
53,700 KB
testcase_103 AC 57 ms
53,704 KB
testcase_104 AC 56 ms
52,696 KB
testcase_105 AC 56 ms
52,636 KB
testcase_106 AC 58 ms
53,728 KB
testcase_107 AC 57 ms
53,704 KB
testcase_108 AC 58 ms
52,648 KB
testcase_109 AC 58 ms
52,604 KB
testcase_110 AC 58 ms
53,712 KB
testcase_111 AC 59 ms
53,720 KB
testcase_112 AC 58 ms
53,696 KB
testcase_113 AC 57 ms
53,648 KB
testcase_114 AC 56 ms
53,708 KB
testcase_115 AC 57 ms
53,716 KB
testcase_116 AC 57 ms
52,660 KB
testcase_117 AC 58 ms
52,624 KB
testcase_118 AC 57 ms
53,708 KB
testcase_119 AC 60 ms
52,660 KB
testcase_120 AC 58 ms
52,664 KB
testcase_121 AC 57 ms
53,696 KB
testcase_122 AC 58 ms
53,696 KB
testcase_123 AC 59 ms
53,704 KB
testcase_124 AC 57 ms
53,708 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve() {
        long a = in.nextLong(), b = in.nextLong(), c = in.nextLong(), d = b * b - 4 * a * c;
        if(a == 0){
            if(b == 0){
                if(c == 0){
                    out.println("-1");
                }else{
                    out.println("0");
                }
            }else{
                out.println("1");
                out.println((double)(-c) / b);
            }
        }else{
            double e = (double) (-b);
            if(d == 0){
                out.println("1");
                out.println(e / 2 / a);
            }else if(d > 0){
                double x1 = 0, x2 = 0, f = Math.sqrt((double) d);
                if(b > 0){
                    x1 = (- b - f) / 2 / a;
                    x2 = (double)(c) / a / x1;
                }else if(b < 0){
                    x2 = (- b + f) / 2 / a;
                    x1 = (double)(c) / a / x2;
                }else{
                    x1 = - f / 2 / a;
                    x2 = f / 2 / a;
                }
                out.println("2");
                out.println(Math.min(x1, x2));
                out.println(Math.max(x1, x2));
            }else{
                out.println("0");
            }
        }
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "output.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0