結果
問題 | No.338 アンケート機能 |
ユーザー | McGregorsh |
提出日時 | 2022-06-20 21:56:53 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,127 bytes |
コンパイル時間 | 378 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 90,112 KB |
最終ジャッジ日時 | 2024-04-21 12:02:47 |
合計ジャッジ時間 | 9,301 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 210 ms
89,984 KB |
testcase_01 | AC | 209 ms
89,840 KB |
testcase_02 | AC | 206 ms
89,728 KB |
testcase_03 | AC | 212 ms
89,728 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 201 ms
89,984 KB |
testcase_09 | WA | - |
testcase_10 | AC | 206 ms
89,472 KB |
testcase_11 | AC | 205 ms
89,344 KB |
testcase_12 | AC | 212 ms
89,600 KB |
testcase_13 | AC | 203 ms
89,728 KB |
testcase_14 | AC | 203 ms
89,856 KB |
testcase_15 | AC | 205 ms
89,856 KB |
testcase_16 | AC | 205 ms
89,856 KB |
testcase_17 | AC | 208 ms
89,728 KB |
testcase_18 | AC | 203 ms
89,728 KB |
testcase_19 | AC | 206 ms
89,856 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 202 ms
89,984 KB |
testcase_24 | AC | 203 ms
89,728 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 206 ms
89,728 KB |
testcase_29 | AC | 208 ms
89,984 KB |
testcase_30 | AC | 204 ms
89,728 KB |
ソースコード
import sys, re 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 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): a, b = i_map() def unpi(a, b): num = 100*a/(a+b) juge = False str_num = str(num) for i in range(len(str_num)): if str_num[i] == '.': line = i break if int(str_num[line+1]) >= 5: juge = True if juge: return floor(num)+1 else: return floor(num) def unpi1(a, b): num = 100*b/(a+b) juge = False str_num = str(num) for i in range(len(str_num)): if str_num[i] == '.': line = i break if int(str_num[line+1]) >= 5: juge = True if juge: return floor(num) + 1 else: return floor(num) ans = INF for i in range(1, 101): for j in range(1, 101): cou1 = unpi(i, j) cou2 = unpi1(i, j) if cou1 == a and cou2 == b: ans = min(ans, i + j) print(ans) if __name__ == '__main__': main()