← Back to List

32805번: A Stack of Gold ↗

Solutions

Python 3
898 B | 898 chars
"""
[32805: A Stack of Gold](https://www.acmicpc.net/problem/32805)

Tier: Bronze 2 
Category: math
"""


import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta

SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "

if SET_RECURSION:
  sys.setrecursionlimit(RECURSION_LIMIT)

inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda : [*map(int,inp().split())]
mfi = lambda : [*map(float,inp().split())]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print

def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)


def solve():
  w, s = mii()

  cnt= s * (s + 1) // 2

  total = 29260 * cnt

  extra = w - total

  print(extra // 110)

if __name__ == "__main__":
  tc = 1
  for t in range(1, tc+1):
    ret = solve()