結果
問題 | No.1179 Quadratic Equation |
ユーザー |
|
提出日時 | 2020-09-03 02:32:31 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,073 bytes |
コンパイル時間 | 1,989 ms |
コンパイル使用メモリ | 193,740 KB |
最終ジャッジ日時 | 2025-01-14 03:56:49 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 WA * 1 |
other | AC * 3 WA * 8 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using P = pair<ll, ll>;using Pld = pair<ld, ld>;using Vec = vector<ll>;using VecP = vector<P>;using VecB = vector<bool>;using VecC = vector<char>;using VecD = vector<ld>;using VecS = vector<string>;template <class T>using Vec2 = vector<vector<T>>;#define REP(i, m, n) for(ll i = (m); i < (n); ++i)#define REPN(i, m, n) for(ll i = (m); i <= (n); ++i)#define REPR(i, m, n) for(ll i = (m)-1; i >= (n); --i)#define REPNR(i, m, n) for(ll i = (m); i >= (n); --i)#define rep(i, n) REP(i, 0, n)#define repn(i, n) REPN(i, 1, n)#define repr(i, n) REPR(i, n, 0)#define repnr(i, n) REPNR(i, n, 1)#define all(s) (s).begin(), (s).end()#define pb push_back#define fs first#define sc secondtemplate <class T1, class T2>bool chmax(T1 &a, const T2 b){if(a < b){a = b; return true;} return false;}template <class T1, class T2>bool chmin(T1 &a, const T2 b){if(a > b){a = b; return true;} return false;}ll pow2(const int n){return (1LL << n);}void co() { cout << endl; }template <class Head, class... Tail>void co(Head&& head, Tail&&... tail) {cout << head << ' ';co(forward<Tail>(tail)...);}void ce() { cerr << endl; }template <class Head, class... Tail>void ce(Head&& head, Tail&&... tail) {cerr << head << ' ';ce(forward<Tail>(tail)...);}void sonic(){ios::sync_with_stdio(false); cin.tie(0);}void setp(const int n){cout << fixed << setprecision(n);}constexpr int INF = 1e9+1;constexpr ll LINF = 1e18L+1;constexpr ll MOD = 1e9L+7;constexpr ll MOD_N = 998244353;constexpr ld EPS = 1e-11;const double PI = acos(-1);int main(void){ll a, b, c;cin >> a >> b >> c;setp(30);ll d = b * b - 4 * a * c;if(d < 0)puts("imaginary");else if(d == 0){co((ld)(-b) / 2 / a);}else{ld e = sqrt((ld)d);co(e);ld x1 = (ld)(-b - e) / 2 / a, x2 = (ld)(-b + e) / 2 / a;if (x1 > x2) swap(x1, x2);co(x1, x2);}return 0;}