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

提出ソース

結果

問題	No.955 ax^2+bx+c=0
ユーザー	Oland
提出日時	2019-12-22 13:56:01
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	7,204 bytes
コンパイル時間	2,451 ms
コンパイル使用メモリ	78,508 KB
実行使用メモリ	37,564 KB
最終ジャッジ日時	2024-09-14 05:32:48
合計ジャッジ時間	12,260 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	52 ms 37,364 KB
testcase_01	AC	52 ms 37,180 KB
testcase_02	AC	51 ms 37,140 KB
testcase_03	AC	52 ms 36,732 KB
testcase_04	AC	52 ms 36,920 KB
testcase_05	AC	52 ms 37,088 KB
testcase_06	AC	52 ms 36,860 KB
testcase_07	AC	51 ms 37,324 KB
testcase_08	AC	51 ms 37,132 KB
testcase_09	AC	51 ms 37,064 KB
testcase_10	AC	54 ms 36,860 KB
testcase_11	AC	51 ms 36,732 KB
testcase_12	AC	51 ms 37,292 KB
testcase_13	AC	53 ms 37,108 KB
testcase_14	AC	53 ms 37,088 KB
testcase_15	AC	53 ms 36,984 KB
testcase_16	AC	51 ms 37,164 KB
testcase_17	AC	52 ms 36,844 KB
testcase_18	AC	53 ms 37,132 KB
testcase_19	AC	56 ms 37,120 KB
testcase_20	AC	57 ms 37,132 KB
testcase_21	AC	54 ms 37,324 KB
testcase_22	AC	54 ms 37,116 KB
testcase_23	AC	54 ms 37,244 KB
testcase_24	AC	53 ms 37,324 KB
testcase_25	AC	53 ms 37,292 KB
testcase_26	AC	54 ms 36,936 KB
testcase_27	AC	55 ms 37,292 KB
testcase_28	AC	54 ms 36,960 KB
testcase_29	AC	54 ms 37,352 KB
testcase_30	AC	55 ms 37,260 KB
testcase_31	AC	54 ms 37,432 KB
testcase_32	AC	54 ms 36,996 KB
testcase_33	AC	53 ms 37,372 KB
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	WA	-
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	AC	55 ms 37,256 KB
testcase_59	WA	-
testcase_60	AC	55 ms 37,268 KB
testcase_61	AC	55 ms 37,420 KB
testcase_62	AC	55 ms 37,356 KB
testcase_63	WA	-
testcase_64	AC	55 ms 37,012 KB
testcase_65	WA	-
testcase_66	AC	54 ms 37,088 KB
testcase_67	AC	55 ms 37,448 KB
testcase_68	AC	55 ms 37,324 KB
testcase_69	AC	56 ms 37,420 KB
testcase_70	WA	-
testcase_71	AC	56 ms 37,088 KB
testcase_72	AC	54 ms 37,324 KB
testcase_73	AC	55 ms 37,132 KB
testcase_74	AC	54 ms 37,412 KB
testcase_75	AC	55 ms 37,140 KB
testcase_76	AC	55 ms 37,056 KB
testcase_77	WA	-
testcase_78	WA	-
testcase_79	WA	-
testcase_80	AC	56 ms 37,452 KB
testcase_81	AC	55 ms 36,928 KB
testcase_82	AC	56 ms 36,928 KB
testcase_83	AC	55 ms 37,140 KB
testcase_84	AC	55 ms 37,452 KB
testcase_85	AC	54 ms 37,448 KB
testcase_86	AC	54 ms 37,444 KB
testcase_87	AC	54 ms 37,344 KB
testcase_88	AC	54 ms 37,272 KB
testcase_89	AC	54 ms 37,260 KB
testcase_90	AC	54 ms 37,168 KB
testcase_91	AC	54 ms 36,936 KB
testcase_92	AC	54 ms 37,352 KB
testcase_93	AC	54 ms 37,084 KB
testcase_94	AC	55 ms 37,340 KB
testcase_95	AC	55 ms 37,172 KB
testcase_96	AC	54 ms 37,292 KB
testcase_97	AC	55 ms 37,444 KB
testcase_98	AC	54 ms 37,328 KB
testcase_99	AC	53 ms 37,248 KB
testcase_100	AC	53 ms 37,360 KB
testcase_101	AC	55 ms 37,292 KB
testcase_102	AC	53 ms 37,180 KB
testcase_103	AC	54 ms 37,260 KB
testcase_104	AC	55 ms 36,936 KB
testcase_105	AC	55 ms 37,412 KB
testcase_106	AC	55 ms 37,324 KB
testcase_107	AC	56 ms 37,260 KB
testcase_108	AC	54 ms 37,408 KB
testcase_109	AC	55 ms 37,432 KB
testcase_110	AC	57 ms 37,136 KB
testcase_111	AC	54 ms 37,292 KB
testcase_112	AC	54 ms 37,260 KB
testcase_113	AC	55 ms 37,448 KB
testcase_114	AC	55 ms 37,432 KB
testcase_115	AC	55 ms 37,372 KB
testcase_116	AC	55 ms 37,372 KB
testcase_117	AC	55 ms 37,152 KB
testcase_118	AC	54 ms 37,292 KB
testcase_119	AC	55 ms 37,448 KB
testcase_120	AC	55 ms 37,140 KB
testcase_121	AC	55 ms 37,180 KB
testcase_122	WA	-
testcase_123	AC	55 ms 37,292 KB
testcase_124	WA	-

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

ソースコード

raw source code

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 f = Math.sqrt((double) d);
                out.println("2");
                out.println((e - f) / 2 / a);
                out.println((e + f) / 2 / a);
            }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;
        }
    }
}

yukicoder

結果

テストケース

ソースコード