Problem:


Score : 100 points

Problem Statement

Snuke has a favorite restaurant.

The price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.

So far, Snuke has ordered N meals at the restaurant.
Let the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.
Find x-y.

Constraints

1 ≤ N ≤ 100

Input

The input is given from Standard Input in the following format:

N

Output

Print the answer.

Sample Input 1

20

Sample Output 1

15800

So far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.

Sample Input 2

60

Sample Output 2

47200

Snuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.



Sample input:
20


Sample output:
15800

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    print(N * 800 - (N // 15) * 200)


main()

Submission status: Accepted

Solution code:
n=int(input())
print(800*n-(n//15)*200)

Submission status: Accepted

Solution code:
A = int(input())
print(A*800-200*(A//15))

Submission status: Accepted

Solution code:
num = int(input())

print(800*num-200*(num//15))

Submission status: Accepted

Solution code:
n = int(input())
paid = n * 800
gain = int(n / 15) * 200
print(paid - gain)

Submission status: Accepted

Solution code:
x = int(input())
print(x*800 - int(x/15)*200)

Submission status: Accepted

Solution code:
n = int(input())
print ((n*800)-200*(n//15))

Submission status: Accepted

Solution code:
n = int(input())
print(800*n - n // 15 * 200)

Submission status: Accepted

Solution code:
n = int(input())

x = n * 800
y = (n // 15) * 200
print(x-y)

Submission status: Accepted

Solution code:
import math
n = int(input())
print(n*800-math.floor(n/15)*200)

Submission status: Accepted

Solution code:

def main():
    num = int(input())
    print(800 * num - (num // 15) * 200)






if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
n = N // 15

print(N * 800 - n * 200)

Submission status: Accepted

Solution code:
N = int(input())
a = N//15
ans = 800*N - 200*a
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
x=n*800
y=((n-n%15)/15)*200
print(int(x-y))

Submission status: Accepted

Solution code:
s=int(input())
print(s*800-(s//15)*200)

Submission status: Accepted

Solution code:
N = int(input())
paid = 800*N
refund = (N//15)*200
print(paid-refund)

Submission status: Accepted

Solution code:
n = int(input())
ans = 800 * n - n // 15 * 200
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

ans= n*800-int(n/15)*200

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
print(N * 800 - N//15*200)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

c = N // 15

a = N * 800 - c * 200

print(a)

Submission status: Accepted

Solution code:
n = int(input())
print((n * 800) - (n//15)*200)

Submission status: Accepted

Solution code:
a=int(input())
print(800*a-(a//15*200))

Submission status: Accepted

Solution code:
a = int(input())
print(a * 800 - a // 15 * 200)

Submission status: Accepted

Solution code:
import sys
pagos=0
lines = sys.stdin.readlines()
for linea in lines:
    c = linea.split()
    c = list(map(int,c))
list(c)
p = c[0]
x = c[0]*800
for k in range(1,(p+1)):
  if k%15 ==0:
    pagos+=200
total = x-pagos
print(total)

Submission status: Accepted

Solution code:
n=int(input())
can=n*800
p=n
des=200
if n<15:
  total=can
elif n>=15 and n<30:
  total=can-200
elif n>=30 and n<45:
  total=can-400
elif n>=45 and n<60:
  total=can-600
elif n>=60 and n<75:
  total=can-800
elif n>=75 and n<90:
  total=can-1000
elif n>=90 and n<=100:
  total=can-1200
print(total)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    print(800*n-200*(n//15))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(N: int):
    ret = 800 * N - (N // 15) * 200
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

N = int(input())

print( 800 * N - 200 * (N//15))

Submission status: Accepted

Solution code:
a = int(input())
print(a * 800 - a // 15 * 200)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC55 A

n = int(input())

print(800*n - 200*(n//15))

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

n = int(input())
p = 600 * (n // 15) + 800 * (n - n // 15)
print(p)

Submission status: Accepted

Solution code:
N = int(input())

y = int(N // 15)

ans = (N * 800) - (y * 200)

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
x = 800*n
y = 200 *(n//15)
print(x-y)

Submission status: Accepted

Solution code:
n = int(input())
print(800 * n - n // 15 *200)

Submission status: Accepted

Solution code:
#x, y = map(int,input().split())
#ls = list(map(int,input().split()))
n = int(input())
#s = input()
#x, y = input().split()

num = n//15 * 200
print(800 * n - num)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# input
N = int(input())

# solve & output
print(800 * N - 200 * int(N / 15))

Submission status: Accepted

Solution code:
n = int(input())
print(800*n - 200 * (n//15))

Submission status: Accepted

Solution code:
n = int(input())

a = 800
c = int(n / 15)

for i in range(c + 1):
    b = 200*i

x = a * n
y = b
print(x - y)

Submission status: Accepted

Solution code:
a = int(input())
print(a*800 - (a//15)*200)

Submission status: Accepted

Solution code:
n = int(input())
accept = n // 15
print(n*800 - accept*200)

Submission status: Accepted

Solution code:
N = int(input())
print(N * 800 - int(N/15) * 200)

Submission status: Accepted

Solution code:
n = int(input())
print(800 * n - (n // 15) * 200)

Submission status: Accepted

Solution code:
n = int(input())

x = 800 * n
y = n // 15 * 200

print(x-y)

Submission status: Accepted

Solution code:
import math
N = int(input())
print((N*800)-(math.floor((N/15))*200))

Submission status: Accepted

Solution code:
N = int(input())

print(800*N - 200* (N//15))

Submission status: Accepted

Solution code:
a = int(input())
print(800*a-200*(a//15))

Submission status: Accepted

Solution code:
x = 0
for i in range(int(input())):
	x+=800
	if (i+1)%15==0:
		x-=200
print(x)

Submission status: Accepted

Solution code:
n = int(input())

x = n * 800
y = int(n / 15) * 200
print(x - y)

Submission status: Accepted

Solution code:
N = int(input())
print((800*N)-(200*(N//15)))

Submission status: Accepted

Solution code:
N=int(input())
print(800*N-(N//15)*200)

Submission status: Accepted

Solution code:
n = int(input())

x = 800 * n
y = 200 * (n // 15)

print(x-y)

Submission status: Accepted

Solution code:
n = int(input())
x=n*800
y=int(n/15)*200
print(x-y)

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

N = n()
print(800 * N - N // 15 * 200)

Submission status: Accepted

Solution code:
n = int(input())
print((800 * n) - (200 * (n//15)))

Submission status: Accepted

Solution code:
a = int(input())

m = 0

for i in range(1, 1000):
    m += 800
    if i % 15 == 0:
        m -= 200
    
    if i == a:
        break

print(m)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

N = int(input())
print(N * 800 - N // 15 * 200)

Submission status: Accepted

Solution code:
x=int(input())
print(x*800-x//15*200)

Submission status: Accepted

Solution code:
N = int(input())

ans = N*800-(N//15)*200
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
x = N // 15
print(N * 800 - x * 200)

Submission status: Accepted

Solution code:
n = int(input())

print(n*800-((n//15)*200))

Submission status: Accepted

Solution code:
n = int(input())

print(n * 800 - ((n // 15) * 200))

Submission status: Accepted

Solution code:
N = int(input())

# print(N)

result = (N * 800) - (int(N / 15) * 200)

print(result)

Submission status: Accepted

Solution code:
n=int(input())

x=800*n
y=200*(n//15)
print(x-y)

Submission status: Accepted

Solution code:
def abc():
    n = int(input())
    x = 800 * n
    y = 200 * int(n / 15)
    print(x -y)


abc()

Submission status: Accepted

Solution code:
x=int(input())
print(800*x-(x//15)*200)

Submission status: Accepted

Solution code:
N = int(input())
pay = N*800
get = (N//15)*200
print(pay-get)

Submission status: Accepted

Solution code:
N = int(input())

x = N * 800
y = N // 15 * 200
print(x-y)

Submission status: Accepted

Solution code:
n=int(input())

print((800*n)-(200*(n//15)))

Submission status: Accepted

Solution code:
n = int(input())
print(n * 800 - ((n // 15) * 200))

Submission status: Accepted

Solution code:
n = int(input())
x = 800*n
y = 200 * (n//15)
print(x-y)

Submission status: Accepted

Solution code:
n = int(input())
a = n*800
b = n//15
print(a-b*200)

Submission status: Accepted

Solution code:
n = int(input())
print(n*800 - 200*(int(n/15)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n = int(input())

ans = n*800-(n//15)*200
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
print("{0}".format(N * 800 - int(N / 15) * 200))

Submission status: Accepted

Solution code:
n = int(input())
cnt = n//15
print(800*n-200*cnt)

Submission status: Accepted

Solution code:
n = int(input())
print(int(n*800-200*(n//15)))

Submission status: Accepted

Solution code:
N = int(input())

print(N*800 - (N//15)*200)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - Restaurant
https://atcoder.jp/contests/abc055/tasks/abc055_a

"""
import sys


def solve(N):
    return N*800 - (N//15*200)


def main(args):
    N = int(input())
    ans = solve(N)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
n = int(input())
x = 800 * n
y = 200 * (n // 15)
print(x-y)

Submission status: Accepted

Solution code:
N = int(input())
fee = 0
back = 0
fee = N * 800
back = N // 15 * 200

print(fee-back)

Submission status: Accepted

Solution code:
a = int(input())
print( 800*a - 200*(a//15) )

Submission status: Accepted

Solution code:
###template###
import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())
###template###

N = int(input())

print(N*800-(N//15)*200)

Submission status: Accepted

Solution code:
a = int(input())
x=800*a
y=200*(a//15)
print(x-y)

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    n = f()[0]
    print(n*800 - n//15 * 200)

solve()

Submission status: Accepted

Solution code:
ate = int(input())

print(800 * ate - ate // 15 * 200)

Submission status: Accepted

Solution code:
s = input()
a = s * 800
b = s / 15
c = b * 200
x = a - c
print x

Submission status: Accepted

Solution code:
N = int(input())
print(int(N*800- (N//15)*200))

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

N = int(input())
x = N*800
y = N // 15 * 200

print(x-y)

Submission status: Accepted

Solution code:
N = int(input())
x = 800 * N
y = (N // 15) * 200
ans = x - y
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
print(n*800 - int(n/15)*200)

Submission status: Accepted

Solution code:
# 入力
n = int(input())

# 計算と出力
print(800*n-200*(int(n/15)))

Submission status: Accepted

Solution code:
N = int(input())
print(800 * N - 200*(N//15))

Submission status: Accepted

Solution code:
a=int(input())
 
print(a*800-200*(a//15))

Submission status: Accepted

Solution code:
n = int(input())
x = 800 * n
import math
y = math.floor(n / 15) * 200
print(x-y)

Submission status: Accepted

Solution code:
a = int(input())
print(800*a - (a//15)*200)

Submission status: Accepted

Solution code:
import math


nums=int(input())

cost=800*nums

save=200*(math.floor(nums/15))

print(cost-save)

Submission status: Accepted

Solution code:
num_meals = int(input())
print(800*num_meals-(num_meals//15*200))

Submission status: Accepted

Solution code:
N = int(input())
x = 800 * N
y = 200*(N // 15)
print(x-y)

Submission status: Accepted

Solution code:
N = int(input())
payment = N * 800 - (N // 15) * 200
print(payment)

Submission status: Accepted

Solution code:
meal_fee=800
cash_back=200
cash_back_count=15
N=int(input())
x=N*meal_fee
y=int(N/cash_back_count) * cash_back
print(x-y)

Submission status: Accepted

Solution code:
N = int(input())

back = int(N/15)
print(800*N-200*back)

Submission status: Accepted

Solution code:
N = int(input())
back = (N//15) * 200
print(800*N - back)

Submission status: Accepted

Solution code:
N=int(input())
price = N* 800 -(N // 15) * 200
print(price)

Submission status: Accepted

Solution code:
n = int(input())
ret = (n * 800) - (n // 15) * 200
print(ret)

Submission status: Accepted

Solution code:
n = int(input())
a = n//15
print(800*n-a*200)

Submission status: Accepted

Solution code:
n = int(input())
print(n*800 - (n//15)*200)

Submission status: Accepted

Solution code:
N = int(input())
m = N // 15
print((N*800) - (m * 200))

Submission status: Accepted

Solution code:
n = int(input())
print(n*800-int(n/15)*200)

Submission status: Accepted

Solution code:
N = int(input())
print(800*N-200*(N//15))

Submission status: Accepted

Solution code:
N = int(input())
M = 800 * N
print(M-M//12000*200)

Submission status: Accepted

Solution code:
N = int(input())
print(800 * N - N // 15 * 200)

Submission status: Accepted

Solution code:
N = int(input())

amount = 0
c_back = 0

amount = N*800
c_back = int(N/15)*200

print(amount - c_back)

Submission status: Accepted

Solution code:
N=int(input())
print(800*N-(200*int((N/15))))

Submission status: Accepted

Solution code:
n = int(input())

x = 800 * n
y = (n // 15) * 200
print(x-y)

Submission status: Accepted

Solution code:
n = int(input())
ans = 800 * n - (n // 15) * 200
print(ans)

Submission status: Accepted

Solution code:
n=int(input())

k=n//15

print(int(800*n-200*k))

Submission status: Accepted

Solution code:
a = int(input())
print(a*800 - int(a/15)*200)

Submission status: Accepted

Solution code:

def read_input():
    x = int(input())
    return x

def submit():
    x = read_input()

    bonus = x // 15
    print(x * 800 - bonus * 200)


if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
a = int(input())

print(a * 800 - 200 * (a // 15))

Submission status: Accepted

Solution code:
N = int(input())

ans = 0
ans += 800 * N
ans -= 200 * (N // 15)

print(ans)

Submission status: Accepted

Solution code:
z=int(input())
print(z*800-(z//15)*200)

Submission status: Accepted

Solution code:
a=int(input())
print(a*800-int(a/15)*200)

Submission status: Accepted

Solution code:
x = int(input())

print(int((x * 800) - (int(x / 15) * 200)))

Submission status: Accepted

Solution code:
# ABC055A - Restaurant
n = int(input())
print(n * 800 - (n // 15) * 200)

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


a= inp()
print(800*a -(a//15)*200)

Submission status: Accepted

Solution code:
import math
n = int(input())
y = (n-n%15)/15if n >= 15 else 0
print(math.floor(800*n - y*200))

Submission status: Accepted

Solution code:
n = int(input())
a = n // 15
print(n*800 - a*200)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n = int(input())

print(n*800 - n//15*200)

Submission status: Accepted

Solution code:
n = int(input())

sum = 0

a = n//15

sum = 800 * n - 200 * a

print(sum)

Submission status: Accepted

Solution code:
n=int(input())

print(800*n-n//15*200)

Submission status: Accepted

Solution code:
n = int(input())

print((n * 800) - (int(n/15) * 200))

Submission status: Accepted

Solution code:
N = int(input())
y = N // 15
print((N*800)-(y*200))

Submission status: Accepted

Solution code:
N = int(input())
ans = 0
ans += N * 800
ans -= (N // 15) * 200
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
print(N * 800 - (N // 15) * 200)

Submission status: Accepted

Solution code:
x=int(input())
print(x*800-(x//15)*200)

Submission status: Accepted

Solution code:
a = int(input())
b = a * 800
if a >= 15:
    c = (a // 15) * 200
    print(b-c)
else:
  print(b)

Submission status: Accepted

Solution code:
n = int(input())
x = n*800
y = (n//15)*200
ans=x-y
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
x =n*800
y =200*(n//15)
print(x-y)

Submission status: Accepted

Solution code:
N = int(input())

x = 800*N
y = 200*(N//15)
print(x-y)

Submission status: Accepted

Solution code:
N =int(input())
print(N * 800 - (N // 15) * 200)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n = int(input())
    pay = 800 * n
    ret = 200 * (n // 15)
    print(pay - ret)

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    N = int(input())

    x = 800 * N
    y = 200 * (N // 15)

    return x - y


if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
N = int(input())
calc = N*800 - ((N // 15))*200
print(calc)

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # N! を求める
    # f = math.factorial(N)
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    # 1e10

    # 初期値用:十分小さい数(-100億)
    # -1e10
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    N = int(input().rstrip())
    print(N*800-(N//15)*200)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A = int(input())
print(A*800-int(A/15)*200)

Submission status: Accepted

Solution code:
n = int(input())
x = 800 * n
y = (n // 15) * 200

print(x - y)

Submission status: Accepted

Solution code:
N = int(input())
print(N * 800 - N //15 * 200)

Submission status: Accepted

Solution code:
# -*- coding utf-8 *-

x =int(input())

ans1 = 800*x

z = x//15

ans2 = ans1-(z*200) 

print(ans2)

Submission status: Accepted

Solution code:
N = int(input())
wari = N //15

goukei = N*800 - wari*200
print(goukei)

Submission status: Accepted

Solution code:
n = int(input())
m = n // 15
print(n * 800 - m * 200)

Submission status: Accepted

Solution code:
N = int(input())
count = 0
morta = 0


for i in range(N):
    count+=800
    if (i+1)%15==0:
        morta += 200

print(count-morta)

Submission status: Accepted

Solution code:
def restaurant(N: int) -> int:
    x = 800 * N
    y = 200 * (N // 15)
    return x - y


if __name__ == "__main__":
    N = int(input())
    ans = restaurant(N)
    print(ans)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def POW(x, y):
    if y == 0:
        return 1
    elif y == 1:
        return x
    elif y % 2 == 0:
        return POW(x, y // 2) ** 2 % MOD
    else:
        return POW(x, y // 2) ** 2 * x % MOD
def mod_factorial(x, y): return x * POW(y, MOD - 2) % MOD
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()
from functools import reduce

def main():
    N = II()
    x = 800 * N
    y = 200 * (N // 15)
    ans = x - y
    return ans

print(main())

Submission status: Accepted

Solution code:
n=int(input())

print(800*n-200*(n//15))

Submission status: Accepted

Solution code:
N=int(input());print(800*N-N//15*200)

Submission status: Accepted

Solution code:
import math
n = int(input())
ans = n * 800
ans -= 200 * math.floor(n / 15)
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n = int(input())

print(n*800-(n//15)*200)

Submission status: Accepted

Solution code:
x=int(input())*800
print(x-x//12000*200)

Submission status: Accepted

Solution code:
def I_N():
	return int(input())

def I_N_S():
	return map(int, input().split())

N = I_N()
print(N*800 - (N//15)*200)

Submission status: Accepted

Solution code:
N=int(input())
print(N*800-(int(N/15))*200)

Submission status: Accepted

Solution code:
n = int(input())
a = n * 800
b = (n//15) * 200
print(a-b)

Submission status: Accepted

Solution code:
n = int(input());print(n*800 - n//15*200)

Submission status: Accepted

Solution code:
N = int(input())

x = N*800
y = (N//15)*200
print(x-y)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
x = 800 * n 
y = 200 * (n // 15)
print(x - y)

Submission status: Accepted

Solution code:
N = int(input())

import math
x = 800 * N
y = 200 * (math.floor(N / 15))

print(x - y)

Submission status: Accepted

Solution code:
n = int(input())
s = n//15
print(800*n-200*s)

Submission status: Accepted

Solution code:
N=int(input())
x=N*800
y=(N//15)*200
ans=x-y
print(ans)

Submission status: Accepted

Solution code:
x=int(input());print(800*x-x//15*200)

Submission status: Accepted

Solution code:
N = int(input())
x = N*800
y = int(N/15)*200
print(x-y)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
print(800 * N - 200 * (N // 15))

Submission status: Accepted

Solution code:
N=int(input())
x=800*N
y=200*(N//15)
z=x-y
print(z)

Submission status: Accepted

Solution code:
n = int(input())
sub = n // 15
print(n*800 - sub*200)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    print(800 * N - N//15 * 200)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a=int(input())
print(a*800-200*(a//15))

Submission status: Accepted

Solution code:
N = int(input())
x = 800*N
y = 200*(N//15)
print(int(x-y))

Submission status: Accepted

Solution code:
x=int(input());print(x*800-x//15*200)

Submission status: Accepted

Solution code:
# coding: utf-8
n = int(input())
back = n // 15
print(800 * n - 200 * back)

Submission status: Accepted

Solution code:
#55
n = int(input())
print(800*n - int(n/15)*200)

Submission status: Accepted

Solution code:
N=int(input())
print(str(800*N-200*(N//15)))

Submission status: Accepted

Solution code:
N = int(input())
x = N * 800
y = N // 15 * 200
print(x - y)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    n = II()
    ans = n * 800
    print(ans-(n//15)*200)
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
def A():
    n = I()
    print(n*800-200*(n//15))

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

def J():
    return

def K():
    return

#Solve
if __name__ == "__main__":
    A()

Submission status: Accepted

Solution code:
def main() -> None:
    N = int(input())
    print(800 * N - N // 15 * 200)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
print(n * 800 - (200 * (n//15)))

Submission status: Accepted

Solution code:
N = int(input())
print(N*800 - (N//15) * 200)

Submission status: Accepted

Solution code:
a = int(input())
x = a*800
n = int(a/15)
y = n*200
print(int(x-y))

Submission status: Accepted

Solution code:
n = int(input())

x = n * 800
y = (n // 15) * 200

print(x - y)

Submission status: Accepted

Solution code:
#10:03
N = int(input())
svc = int(N/15)*200 
print(N*800 - svc)

Submission status: Accepted

Solution code:
N = int(input())
print((N*800)-((N//15)*200))

Submission status: Accepted

Solution code:
N = int(input())
print(N*800-(int(N/15)*200))

Submission status: Accepted

Solution code:
N = int(input())
ans = 800*N - 200*(N//15)
print(ans)

Submission status: Accepted

Solution code:
a=int(input())
q=a*800-(a//15)*200
print(q)

Submission status: Accepted

Solution code:
n = int(input())
print(800*n - int(n/15)*200)

Submission status: Accepted

Solution code:
N = int(input())
a = N // 15
ans = 800 * N - 200 * a
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys

def main():
	n = int(input())
	
	yen = n * 800
	wari = (n // 15) * 200
	
	print(yen - wari)
	
if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
from sys import stdin
n =int(stdin.readline().rstrip())
print(n*800 - (n//15)*200)

Submission status: Accepted

Solution code:
N = int(input())
y = N // 15 * 200

print ((N * 800) - y)

Submission status: Accepted

Solution code:
N = int(input())
x = N * 800
y = (N // 15) * 200
print(x - y if N >= 15 else x)

Submission status: Accepted

Solution code:
n = int(input())

print(n*800 - (n//15)*200)

Submission status: Accepted

Solution code:
# coding: utf-8
n = int(input())
print(n * 800 - n // 15 * 200)

Submission status: Accepted

Solution code:
N=int(input())
print (int((N*800-int(N/15)*200)))

Submission status: Accepted

Solution code:
# ABC 055 A - Restaurant
n=int(input())

ans = n * 800 - (n//15 *200)
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
"""A-Restaurant"""

def main():
    N = int(input())
    bill = N * 800
    bill = bill - (N // 15) * 200
    print(bill)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=int(input())
print(a*800 -int(a/15) * 200)

Submission status: Accepted

Solution code:
n = int(input())
print(n*800 - n // 15 * 200)

Submission status: Accepted

Solution code:
n=int(input());print(n*800-200*(n//15))

Submission status: Accepted

Solution code:
C = 800
K = 15
B = 200
N = int(input())
x = N * C
y = (N // 15) * 200
print(x-y)

Submission status: Accepted

Solution code:
def fun():
     print('ac')
     print('ac')
     print('ac')
     print('ac')
N=eval(input())
result=N*800-(N//15)*200
print(result)

Submission status: Accepted

Solution code:
N = int(input())

x = 800 * N
y = 200 * (N // 15)
ans = x - y

print(ans)
print()

Submission status: Accepted

Solution code:
import math
n = int(input())

sum = (800 * n)-math.floor(n/15) * 200
print(sum)

Submission status: Accepted

Solution code:
N=input()
print N*800-N/15*200

Submission status: Accepted

Solution code:
N=int(input())
d=N//15
print(800*N-200*d)

Submission status: Accepted

Solution code:
n=int(input())
print(n*800-200*(n//15))

Submission status: Accepted

Solution code:
n = int(input())
print(800*n-n//15*200)

Submission status: Accepted

Solution code:
import math
n=int(input())
print(n*800-200* math.floor(n/15))

Submission status: Accepted

Solution code:
a=int(input())
print(800*a-200*(int(a/15)))

Submission status: Accepted

Solution code:
N = int(input())
print(N*800 - N//15*200)

Submission status: Accepted

Solution code:
n = int(input())
ans = 800*n - (n//15)*200
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
print(800*n-(int(n/15)*200))

Submission status: Accepted

Solution code:
a = int(input())
print(a*800-(int(a/15)*200))

Submission status: Accepted

Solution code:
print((lambda x=input(): int(x) * 800 if int(x) < 15 else (int(x) * 800 - (200) * int(int(x) / 15)))())