๐Ÿ˜Š ๋ฐฑ์ค€ 1541 : ์žƒ์–ด๋ฒ„๋ฆฐ ๊ด„ํ˜ธ

3Juhwanยท2021๋…„ 2์›” 27์ผ
0

Algorithm

๋ชฉ๋ก ๋ณด๊ธฐ
13/23

1541: ์žƒ์–ด๋ฒ„๋ฆฐ ๊ด„ํ˜ธ

Greedy ์„ธ ๋ฒˆ์งธ ๋ฌธ์ œ~!
์ด๊ฒƒ๋„ ๊ฐ„๋‹จํ•œ ๋ฌธ์ œ์˜€๋‹ค.


๐Ÿ“Œ Try 1

import re

_input = input()
numbers = re.findall('\d+', _input)
strings = re.findall('\D+', _input)
_sum, bump = int(numbers[0]), 0

for i in range(len(strings)):
    num = int(numbers[i+1])
    strr = strings[i]
    if strr == '+':
        if bump:
            bump += num
        else:
            _sum += num
    elif strr == '-':
        if bump:
            _sum -= bump
        bump = num
            
if bump:
    _sum -= bump
    
print(_sum)

re๋ชจ๋“ˆ์œผ๋กœ ์ •๊ทœ์‹์„ ์ด์šฉํ•ด์„œ ํ’€์—ˆ๋‹ค.


๐ŸŽฏ ๋‹ค๋ฅธ ๋ถ„ ์ฝ”๋“œ

a = input().split('-')
num = []
for i in a:
    cnt = 0
    s = i.split('+')
    for j in s:
        cnt += int(j)
    num.append(cnt)
n = num[0]
for i in range(1, len(num)):
    n -= num[i]
print(n

์ด ์ฝ”๋“œ๊ฐ€ ๋” ์ง๊ด€์ ์ธ ๊ฒƒ ๊ฐ™์•„์„œ ์ฒจ๋ถ€ํ–ˆ๋‹ค.


๐ŸŽ Reference

profile
Codeforces์™€ USACO ํ’€์ด๋ฅผ ๊ธฐ๋กํ•ฉ๋‹ˆ๋‹ค. ์ด์ „ ๊ธ€๋„ ๊ณ„์† ์—…๋ฐ์ดํŠธ ๋ฉ๋‹ˆ๋‹ค.

0๊ฐœ์˜ ๋Œ“๊ธ€