結果
問題 | No.1178 Can you draw a Circle? |
ユーザー | Ebishu |
提出日時 | 2020-08-21 21:31:14 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,622 bytes |
コンパイル時間 | 1,309 ms |
コンパイル使用メモリ | 114,908 KB |
最終ジャッジ日時 | 2025-01-13 05:14:05 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | WA | - |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 1 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
ソースコード
#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+7constexpr 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, d, e, f;cin >> a >> b >> c >> d >> e >> f;e -= f;double r = 0.25 * c * c / a + 0.25 * d * d / b - e;cout << sqrt(r) << endl;}