結果
問題 | No.722 100×100=1000 |
ユーザー | McGregorsh |
提出日時 | 2023-04-12 14:23:12 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,564 bytes |
コンパイル時間 | 168 ms |
コンパイル使用メモリ | 82,436 KB |
実行使用メモリ | 89,684 KB |
最終ジャッジ日時 | 2024-04-17 03:12:40 |
合計ジャッジ時間 | 4,902 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 122 ms
89,552 KB |
testcase_01 | AC | 119 ms
89,428 KB |
testcase_02 | AC | 121 ms
89,172 KB |
testcase_03 | AC | 128 ms
89,432 KB |
testcase_04 | AC | 119 ms
89,684 KB |
testcase_05 | AC | 123 ms
89,664 KB |
testcase_06 | AC | 119 ms
89,544 KB |
testcase_07 | AC | 119 ms
89,568 KB |
testcase_08 | AC | 119 ms
89,624 KB |
testcase_09 | AC | 121 ms
89,628 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 120 ms
89,236 KB |
testcase_13 | AC | 126 ms
89,600 KB |
testcase_14 | AC | 125 ms
89,300 KB |
testcase_15 | AC | 116 ms
89,424 KB |
testcase_16 | AC | 121 ms
89,176 KB |
testcase_17 | AC | 115 ms
89,184 KB |
testcase_18 | AC | 122 ms
89,464 KB |
testcase_19 | AC | 121 ms
89,392 KB |
testcase_20 | AC | 123 ms
89,596 KB |
testcase_21 | AC | 116 ms
89,644 KB |
testcase_22 | AC | 117 ms
89,440 KB |
testcase_23 | AC | 119 ms
89,580 KB |
testcase_24 | AC | 117 ms
89,224 KB |
testcase_25 | AC | 120 ms
89,540 KB |
testcase_26 | AC | 118 ms
89,592 KB |
testcase_27 | WA | - |
testcase_28 | AC | 140 ms
89,616 KB |
testcase_29 | AC | 125 ms
89,572 KB |
testcase_30 | AC | 126 ms
89,448 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(): A, B = i_map() if A % 100 == 0 and B % 100 == 0: c = A * B // 10 print(c) else: c = A * B if -99999999 <= c <= 99999999: print(c) else: print('E') if __name__ == '__main__': main()