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:
""" AtCoder """

N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())
print(n//15*11800+n % 15*800)

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())
x = 800 * n
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(n * 800 - n // 15 * 200)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
# from collections import Counter, defaultdict

INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(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()


n = II()

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

Submission status: Accepted

Solution code:
a=int(input())
print((8*a-2*(a//15))*100)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
int_n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = int(n/15)

print(n*800 - ans*200)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(sum([800-200 if i%15==0 else 800 for i in range(1,int(input())+1)]))

Submission status: Accepted

Solution code:
N = int(input())
P,Q = divmod(N, 15)
print(N*800-P*200)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:


def main():
    #a, b, c, d = map(int, input().split())
    a = int(input())
    print(800*a-(int(a/15)*200))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math

x = input().split()
#y = input().split()
a = []
for i in range(len(x)):
   a.append(int(x[i]))

print(int(a[0]*800-200*int(a[0]/15)))

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    """Function."""
    n = int(input())
    print(800 * n - 200 * (n//15))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())#レストランに行った回数の入力
M = N * 800 # レストランに払ったお金
L = int(N // 15) #レストランからお金をもらった回数
print("{}".format(M - 200*L))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

Solution code:
import sys

N = int(sys.stdin.readline().strip())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
print(n*800-round(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())
print(str(800*N-200*int(N/15)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input().rstrip())
x = 800 * N
y = int(N / 15) * 200
print(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:
a=int(input())

b=(a*800)-(int(a/15)*200)

print(b)

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(1000000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v


# Width First Search (+ Distance)
def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk


# Depth First Search (+Distance)
def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False

# --------------------------------------------

dp = None


def main():
    N = int(input())

    d = N // 15

    print(N * 800 - d * 200)


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
print 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:
N = int(input())
print(800 * N - int(N / 15) * 200)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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(n*800 -(int(n/15))*200)

Submission status: Accepted

Solution code:
N = int(input())

#値引き回数
g = N // 15

x = N * 800
y = g * 200
print((x-y))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(x-y)

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 * 800) - ((n // 15) * 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:
a=int(input())
total=0
count=0
for i in range(a):
    total+=800
    count+=1
    if count%15==0:
        total-=200
print(total)

Submission status: Accepted

Solution code:
n = int(input())

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

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) if n >= 15 else n * 800)

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())
print(800 * n - int(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())

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

print(x - y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/python3

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

print(x-y)

Submission status: Accepted

Solution code:
x=int(input());print(x*800-(x//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:
def main():
    N = int(input())
    prices = N * 800
    discount = (N // 15) * 200
    print(prices - discount)

if __name__ == '__main__':
    main()

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 = 200*(N // 15)

print(x-y)

Submission status: Accepted

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

ynum=N//15

ans=800*N-ynum*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())

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

print(x-y)

Submission status: Accepted

Solution code:
n = int(input())
print((n*800)-(int(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:
n = int(input())
print(800 * n - int(n / 15) * 200)

Submission status: Accepted

Solution code:
#55a
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-*-

def main():
    n = int(input())

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

if __name__ == '__main__':
    main()

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:
#coding:utf-8
n=int(input())
count=800*n-200*int(n/15)
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

reward = int(n /15)

print(800*n - 200*reward)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:

def main():
    n = int(input())

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

if __name__ == "__main__":
        main()

Submission status: Accepted

Solution code:
# input
N = int(input())

a = N // 15
b = N % 15

ans = (800 * 15 - 200) * a + 800 * b
print(ans)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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())

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

Submission status: Accepted

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

N = int(input())

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

print(x - y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
i=int(input())
print((i*800)-(i//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:
x = int(input())
print(800*x - (x//15)*200)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
print('{}'.format((n*800)-(n//15)*200))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ６月５日
a = int(input())
b = 800*a
c = a//15
d = 200*c
print(b-d)

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:
n = int(input())
print(800 * n - (n //15) * 200)

Submission status: Accepted

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

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

print(x-y)

Submission status: Accepted

Solution code:
a = int(input())

siharai = a * 800
omake = (a // 15) * 200

print(siharai - omake)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
print a*800-(a/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:
n = int(input())
pay = 800 *n
back = int(n/15) * 200
print(pay-back)

Submission status: Accepted

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

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())
x = 800 * N
y = int(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())
x = 800*n
y = 200*(int(n/15))
print(x-y)

Submission status: Accepted

Solution code:
N = int(raw_input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
a = int(input())
b = a//15
print(a*800-b*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 = 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:
# -*- coding: utf-8 -*-

# AtCoder Beginner Contest
# Problem A

if __name__ == '__main__':
    dish_count = int(input())
    paid_money_yen = dish_count * 800
    cash_back_yen = (dish_count // 15) * 200

    print(paid_money_yen - cash_back_yen)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import floor

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#__author__ = "tatuo"
#__date__ = "$Mar 3, 2018 12:34:20 PM$"

import math
import re
import sys


def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result




arr_data = getinputdata()

n = int(arr_data[0][0])

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

#x = "ABC" if n <1200 else "ARC"
#
#print(x)

#s1 = arr_data[0][0][0]
#s2 = arr_data[1][0][1]
#s3 = arr_data[2][0][2]
#
#print(s1+s2+s3)
#

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

if n < 15:
  print(n * 800)
else:
  m = n // 15
  print(n * 800 - m * 200)

Submission status: Accepted

Solution code:
x = input()
print 800*x-x/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())

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=input()
print N*800-(N/15)*200 if N>=15 else N*800

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:
def main():
    N = int(input())

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

    print(x - y)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

if n < 15:
    print(n*800)
else:
    print(n*800-(n//15)*200)

Submission status: Accepted

Solution code:
print(sum([(800,600)[i%15==14] for i in range(int(input()))]))

Submission status: Accepted

Solution code:
n = int(input())
ans = int(n*800-(n//15)*200)
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())
a=int(N/15)
print(800*N-200*a)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
p = N // 15
print(N*800 - p*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 - int(N / 15) * 200)

Submission status: Accepted

Solution code:
num = int(input())

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

Submission status: Accepted

Solution code:
def Restuarant():
	n=raw_input()
	k= int(n)
	x=k*800
	y= (k//15)*200
	return x-y

print Restuarant()

Submission status: Accepted

Solution code:
x = int(raw_input())
print(x*800 - (x/15) * 200)
#asdf#asdf#asdf#asdf#asdf#asdf#asdf#asdf#asdf#asdf#asdf#asdf#asdf

Submission status: Accepted

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

"""code length ...... """

Submission status: Accepted

Solution code:
n = int(input())

x = 800*n

y = (n // 15) * 200

print(x-y)

Submission status: Accepted

Solution code:
num = int(input())
print(num * 800 - num//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:
a = int(input())
b = int(a/15)
print(800*a-200*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
import sys
import itertools
import numpy as np
import functools
import collections
mo = 1000000007
INF = 10**100
r = range

class infix(object):
    def __init__(self, function):
        self.function = function

    def __ror__(self, other):
        self.left = other
        return self

    def __or__(self, other):
        return self.function(self.left, other)

    def __call__(self, value1, value2):
        return self.function(value1, value2)

@infix
def c(f_t_u, f_u_r): return lambda t: f_u_r(f_t_u(t))

class _Ap(object):
    def __rlshift__(self, other):
        self.value = other
        return self

    def __rshift__(self, other):
        return other(self.value)
Ap = _Ap()
ap = Ap

#d = {1:2, 3:5, 6:10, 1000043:3814}
#zip(d.keys(), d.values())<<ap>>(list |c| sorted |c| reversed |c| list |c| print)

n = input()<<ap>>int
print(n*800-n//15*200)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

M = N // 15
X = 800 * N - 200 * M

print(X)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
import math

n = int(raw_input())
x = 800 * n
y = math.floor(n/15)*200
print int(x - y)

Submission status: Accepted

Solution code:
n = int(input())

pay = n * 800
gain = int(n /15) * 200
print(pay - gain)

Submission status: Accepted

Solution code:
import sys

for x in map(int, [x.strip() for x in sys.stdin]):
	price = x*800
	discount = x/15*200
	print price-discount

Submission status: Accepted

Solution code:
N = int(input())

x = N*800

n = N // 15
y = n * 200

print(x - y)

Submission status: Accepted

Solution code:
def inint(): return int(input())
def inlint(): return list(map(int, input().split()))
def infloat(): return float(input())
def inlffloat(): return list(map(float, input().split()))
def inl(): return list(input())
def putlint(): return "".join(list(map(str, ans)))

n = inint()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-



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

if __name__ == "__main__": main()

Submission status: Accepted

Solution code:
n = int(raw_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
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())

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

print(x-y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = 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:
N = int(raw_input())
print N*800-N/15*200

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 - int(A / 15) * 200)

Submission status: Accepted

Solution code:
A= int(input())

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

Submission status: Accepted

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
N = int(input())

pay = N * 800
back = N // 15

pay = pay - (back * 200)

print(pay)

Submission status: Accepted

Solution code:
a = int(input())


x = 800*a
y = int(a/15)*200

print(x-y)

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
user=int(input())

x=user*800
y=(int(user/15))*200

print(x-y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

x = int(n)*800
y = int(int(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:
n = int(input())

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

print (x - y)

Submission status: Accepted

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

Submission status: Accepted

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

S=N*800-200*math.floor(N/15)

print(S)

Submission status: Accepted

Solution code:
a = map(int,raw_input().split())

print a[0]*800 - a[0]/15*200

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
n = int(input())

take = n * 800
give = int(n / 15) * 200

print(take - give)

Submission status: Accepted

Solution code:
N = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
#すぬけくんはレストランに通うのが好きです。
#すぬけくん行きつけのレストランは何を食べても 1 食 800 円で、15 食食べる毎にその場で 200 円もらえます。
#すぬけくんは今までで合計 N 食食べました。 今までに払った金額を x 円、レストランからもらった金額を y 円として、x−y を求めなさい。

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

Submission status: Accepted

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

import sys
import os


N = int(input())

morau = N // 15

x = 800 * N
y = 200 * morau

print(x-y)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = int(input())
x = n * 800
y = (n // 15) * 200
ans = x - y
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

n = int(raw_input())

x = 800 * n

y = int(n / 15) * 200

print(x-y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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