← Back to List

31610번: 飴の袋詰め (Drops Packing) ↗

Solutions

Python 3
532 B | 532 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():
    a = ii()
    b = ii()
    c = ii()

    p(a * b + c)

if __name__ == "__main__":
  tc = 1

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