結果
問題 | No.1179 Quadratic Equation |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 21:47:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 235 ms / 2,000 ms |
コード長 | 1,843 bytes |
コンパイル時間 | 664 ms |
コンパイル使用メモリ | 87,196 KB |
実行使用メモリ | 92,588 KB |
最終ジャッジ日時 | 2023-08-22 13:04:42 |
合計ジャッジ時間 | 4,534 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 235 ms
92,528 KB |
testcase_01 | AC | 234 ms
92,464 KB |
testcase_02 | AC | 229 ms
92,356 KB |
testcase_03 | AC | 228 ms
92,200 KB |
testcase_04 | AC | 229 ms
92,328 KB |
testcase_05 | AC | 233 ms
92,436 KB |
testcase_06 | AC | 233 ms
92,584 KB |
testcase_07 | AC | 234 ms
92,416 KB |
testcase_08 | AC | 230 ms
92,460 KB |
testcase_09 | AC | 230 ms
92,416 KB |
testcase_10 | AC | 228 ms
92,524 KB |
testcase_11 | AC | 228 ms
92,328 KB |
testcase_12 | AC | 232 ms
92,588 KB |
testcase_13 | AC | 229 ms
92,584 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): def solve1(a, b, c): if b ** 2 < 4*a*c: print('imaginary') exit() A = (-b + sqrt(b**2 - 4*a*c)) / (2 * a) return A def solve2(a, b, c): if b ** 2 < 4*a*c: print('imaginary') exit() A = (-b - sqrt(b**2 - 4*a*c)) / (2 * a) return A a, b, c = i_map() A = solve1(a, b, c) B = solve2(a, b, c) if A == B: print(A) else: if A < B: print(A, B) else: print(B, A) if __name__ == '__main__': main()