← Back to List

26562번: Presidents ↗

Solutions

Python 3
701 B | 701 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)

BLANK = " "

# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print

  
def solve():
  d = {
    "Franklin": 100,
    "Grant": 50,
    "Jackson": 20,
    "Hamilton": 10,
    "Lincoln": 5,
    "Washington": 1
  }
  
  l = input().split()
  
  ans = 0
  for i in l:
    ans += d[i]
  
  p(f"${ans}")
  
  

if __name__ == "__main__":
  tc = ii()

  for t in range(1, tc+1):
    ret = solve()