#534568 (C++17) No.1178 Can you draw a Circle?

• 問題: No.1178 Can you draw a Circle?
• ユーザー: tanimani364
• 提出日時: 2020-08-21 21:41:17
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 2,601 bytes
• コンパイル時間: 2,078 ms
• コンパイル使用メモリ: 193,060 KB
• 最終ジャッジ日時: 2025-01-13 05:28:35
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
sample	AC * 2
other	AC * 5 WA * 10

ソースコード

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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
ll gcd(ll n, ll m)
{
    ll tmp;
    while (m != 0)
    {
        tmp = n % m;
        n = m;
        m = tmp;
    }
    return n;
}
ll lcm(ll n, ll m)
{
    return abs(n) / gcd(n, m) * abs(m); //gl=xy
}
using namespace std;
template<int mod>
struct Modint{
    int x;
    Modint():x(0){}
    Modint(int64_t y):x((y%mod+mod)%mod){}
    Modint &operator+=(const Modint &p){
            if((x+=p.x)>=mod)
                x -= mod;
            return *this;
        }
        Modint &operator-=(const Modint &p){
            if((x+=mod-p.x)>=mod)
                x -= mod;
            return *this;
        }
        Modint &operator*=(const Modint &p){
            x = (1LL * x * p.x) % mod;
            return *this;
        }
        Modint &operator/=(const Modint &p){
            *this *= p.inverse();
            return *this;
        }
        Modint operator-() const { return Modint(-x); }
        Modint operator+(const Modint &p) const{
            return Modint(*this) += p;
        }
        Modint operator-(const Modint &p) const{
            return Modint(*this) -= p;
        }
        Modint operator*(const Modint &p) const{
            return Modint(*this) *= p;
        }
        Modint operator/(const Modint &p) const{
            return Modint(*this) /= p;
        }
        bool operator==(const Modint &p) const { return x == p.x; }
        bool operator!=(const Modint &p) const{return x != p.x;}
        Modint inverse() const{//非再帰拡張ユークリッド
            int a = x, b = mod, u = 1, v = 0;
            while(b>0){
                int t = a / b;
                swap(a -= t * b, b);
                swap(u -= t * v, v);
            }
            return Modint(u);
        }
        Modint pow(int64_t n) const{//繰り返し二乗法
            Modint ret(1), mul(x);
            while(n>0){
                if(n&1)
                    ret *= mul;
                mul *= mul;
                n >>= 1;
            }
            return ret;
        }
        friend ostream &operator<<(ostream &os,const Modint &p){
            return os << p.x;
        }
};
using modint = Modint<mod>;
void solve()
{
    long double a,b,c,d,e,f;
    cin>>a>>b>>c>>d>>e>>f;
    cout<<sqrtl(c*c/(4*a)+d*d/(4*b)-e+f)<<"\n";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX