結果
問題 | No.222 引き算と足し算 |
ユーザー | McGregorsh |
提出日時 | 2022-06-19 15:49:07 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 113 ms / 1,000 ms |
コード長 | 2,047 bytes |
コンパイル時間 | 695 ms |
コンパイル使用メモリ | 82,660 KB |
実行使用メモリ | 83,692 KB |
最終ジャッジ日時 | 2024-04-19 23:29:38 |
合計ジャッジ時間 | 5,172 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 109 ms
83,504 KB |
testcase_01 | AC | 108 ms
83,380 KB |
testcase_02 | AC | 107 ms
83,452 KB |
testcase_03 | AC | 113 ms
83,304 KB |
testcase_04 | AC | 111 ms
83,472 KB |
testcase_05 | AC | 111 ms
83,416 KB |
testcase_06 | AC | 109 ms
83,304 KB |
testcase_07 | AC | 110 ms
83,512 KB |
testcase_08 | AC | 106 ms
83,424 KB |
testcase_09 | AC | 109 ms
83,104 KB |
testcase_10 | AC | 107 ms
83,128 KB |
testcase_11 | AC | 107 ms
83,692 KB |
testcase_12 | AC | 107 ms
83,584 KB |
testcase_13 | AC | 104 ms
83,444 KB |
testcase_14 | AC | 108 ms
83,492 KB |
testcase_15 | AC | 108 ms
83,488 KB |
testcase_16 | AC | 113 ms
83,384 KB |
testcase_17 | AC | 107 ms
83,184 KB |
testcase_18 | AC | 107 ms
83,456 KB |
testcase_19 | AC | 107 ms
83,400 KB |
testcase_20 | AC | 107 ms
83,556 KB |
testcase_21 | AC | 106 ms
83,336 KB |
testcase_22 | AC | 109 ms
83,664 KB |
testcase_23 | AC | 108 ms
83,508 KB |
testcase_24 | AC | 106 ms
83,216 KB |
testcase_25 | AC | 108 ms
83,568 KB |
testcase_26 | AC | 107 ms
83,592 KB |
testcase_27 | AC | 109 ms
83,224 KB |
testcase_28 | AC | 109 ms
83,496 KB |
testcase_29 | AC | 110 ms
83,468 KB |
testcase_30 | AC | 110 ms
83,160 KB |
testcase_31 | AC | 113 ms
83,416 KB |
testcase_32 | AC | 113 ms
83,112 KB |
testcase_33 | AC | 108 ms
83,524 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(): num = input() base1 = 1 line1 = 0 num1 = '' for i in range(len(num)): if i == 0: if num[i] == '-': base1 = -1 elif num[i] == '+': base1 = 1 else: num1 += num[i] else: if num[i] == '-' or num[i] == '+': line1 = i break else: num1 += num[i] int_num1 = base1 * int(num1) if num[line1+1] == '-': base2 = -1 num2 = int(num[line1+2:]) int_num2 = base2 * num2 elif num[line1+1] == '+': base2 = 1 num2 = int(num[line1+2:]) int_num2 = base2 * num2 else: base2 = 1 num2 = int(num[line1+1:]) int_num2 = base2 * num2 #print(int_num1, int_num2) if num[line1] == '+': print(int_num1 - int_num2) else: print(int_num1 + int_num2) if __name__ == '__main__': main()