結果
問題 | No.49 算数の宿題 |
ユーザー | McGregorsh |
提出日時 | 2022-06-13 18:20:23 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 240 ms / 5,000 ms |
コード長 | 1,750 bytes |
コンパイル時間 | 312 ms |
コンパイル使用メモリ | 87,232 KB |
実行使用メモリ | 92,624 KB |
最終ジャッジ日時 | 2023-08-24 17:51:31 |
合計ジャッジ時間 | 3,490 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 235 ms
92,372 KB |
testcase_01 | AC | 238 ms
92,276 KB |
testcase_02 | AC | 236 ms
92,624 KB |
testcase_03 | AC | 240 ms
92,492 KB |
testcase_04 | AC | 234 ms
92,616 KB |
testcase_05 | AC | 233 ms
92,368 KB |
testcase_06 | AC | 232 ms
92,624 KB |
testcase_07 | AC | 233 ms
92,280 KB |
testcase_08 | AC | 233 ms
92,568 KB |
testcase_09 | AC | 231 ms
92,412 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 ** 6) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): s = input() nums = [-1] for i in range(len(s)): if s[i] == '*' or s[i] == '+': nums.append(i) nums.append(len(s)) lines = [] for i in range(1, len(nums)): lines.append(int(s[nums[i-1]+1:nums[i]])) del nums[0] del nums[-1] new = [] for i in range(len(nums)): new.append(lines[i]) new.append(s[nums[i]]) new.append(lines[-1]) #print(new) ans = new[0] for i in range(1, len(new), 2): if new[i] == '*': ans += new[i+1] else: ans *= new[i+1] print(ans) if __name__ == '__main__': main()