#534254 (C++17) No.1179 Quadratic Equation

• 問題: No.1179 Quadratic Equation
• ユーザー: Ebishu
• 提出日時: 2020-08-21 21:27:49
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 2,854 bytes
• コンパイル時間: 1,138 ms
• コンパイル使用メモリ: 116,032 KB
• 最終ジャッジ日時: 2025-01-13 05:04:55
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 11

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
using namespace std;
using lint = int64_t;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define repn(i, a, b) for(int i = (a); i < (b); ++i)
#define rep_inv(i, n) for (int i = (n); i >= 0; --i)
#define all(vec) vec.begin(), vec.end()
#define cend printf("\n")
//constexpr lint mod = 998'244'353LL;
constexpr lint Mod = 1000'000'007LL;
constexpr lint Inf = 4'500'000'000'000'000'007LL; //4.5e18+7
constexpr double Pi = 3.141592653589793;
template<class T> using prique     = priority_queue<T>;
template<class T> using prique_inv = priority_queue<T, vector<T>, greater<T>>;
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& rhs) { return is >> rhs.first >> rhs.second; }
template<class T, class U>inline ostream& operator<<(ostream& os, const pair<T, U>& rhs) { return os << rhs.first << " " << rhs.second; }
template<class InputIterator> void arrin(InputIterator first, InputIterator last) { for (; first != last; ++first) cin >> (*first); }
template<class InputIterator> void arrout(InputIterator first, InputIterator last) {
    for (; first != last; ++first) {
        cout << (*first) << ((first + 1) != last ? " " : "\n");
    }
}
bool pri(lint x) { 
    for (lint i = 2; i * i <= x; ++i) {
        if (x % i == 0) return false;
    }
    return 1 < x; 
}
lint fact[3000000];
void fact_init(lint n, lint m = Mod) {
    if (3000000 <= n) return;
    fact[0] = fact[1] = 1;
    for (lint i = 2; i <= n; ++i) {
        fact[i] = i * fact[i - 1] % m;
    }
}
lint modpow(lint x, lint n, lint m = Mod) {
    lint res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % m;
        x = x * x % m;
        n >>= 1;
    }
    return res;
}
lint intpow(lint x, lint n) {
    lint res = 1;
    while (n > 0) {
        if (n & 1) res *= x;
        x *= x;
        n >>= 1;
    }
    return res;
}
lint comb(lint n, lint r, lint m = Mod) {
    if (r == 0 || r == n) return 1;
    lint res = fact[n] * modpow(fact[n - r], m - 2, m) % m * modpow(fact[r], m - 2, m) % m;
    return res < 0 ? res + m : res;
}
map<lint, lint> factring(lint n) {
    map<lint, lint> res;
    for (lint i = 2; i * i <= n; ++i) {
        while (n % i == 0) {
            n /= i;
            ++res[i];
        }
    }
    if (n != 1) ++res[n];
    return res;
}
int main() {
    double a, b, c;
    cin >> a >> b >> c;
    double d = b * b - 4 * a * c;
    if (d < 0.0) cout << "imaginary\n";
    else if (fabs(d) < 1e-12) {
        cout << -0.5 * b / a << endl;
    }
    else {
        double x1, x2, t;
        if (0.0 < b) {
            t = -b - sqrt(d);
        }
        else {
            t = -b + sqrt(d);
        }
        x1 = 2 * c / t;
        x2 = 0.5 * t / a;
        if (x1 > x2) swap(x1, x2);
        cout << x1 << " " << x2 << endl;
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX