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:
i = int(input())
d = i * 800
b = i // 15

if 0 <= b:
    c = d - (200 * b)
    print(c)
else:
    print(c)

Submission status: Accepted

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

ans = 800*N - 200*a
print(ans)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!python3

# input
N = int(input())


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

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

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

Submission status: Accepted

Solution code:
N = int(input())

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

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_times_str=input()

N_times=int(N_times_str)

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

Submission status: Accepted

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

print(800*N-200*CB)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

res = n * 800 - n // 15 * 200

print(res)

Submission status: Accepted

Solution code:
n = int(input())
x = 800 * n
if n >= 15 :
    waribiki = n//15
    total = x - waribiki*200
    print(total)
else:
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n = ii()
    print(800 * n - 200 * (n // 15))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import stdin
def I(): return int(stdin.readline().rstrip())

n = I()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

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:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

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 = 0

for i in range(1,N+1):
    if i % 15 == 0:
        y = y + 200

ans = x-y        
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

pay = 800 * n
get = (n // 15) * 200

ans = pay - get

print(ans)

Submission status: Accepted

Solution code:
n = int(input())

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

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

main()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
# L = 800 / N 
B = 0
for i in range(1,N+1):
    if i % 15 == 0:
        B += 1
L = 800 * N
C = B * 200
print(L - C)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 16:57:57 2020

@author: shinba
"""

n = int(input())

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

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())
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:
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())


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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
import sys
#from collections import defaultdict, deque, Counter
#from bisect import bisect_left
#import heapq
#import math
#from itertools import groupby as gb
#from itertools import permutations as perm
#from itertools import combinations as comb
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

n = int(stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
#n,m = map(int, stdin.readline().rstrip().split())
#AB = [list(map(int, stdin.readline().rstrip().split())) for _ in range(n)]
ans = 800*n - (n//15)*200
print(ans)

Submission status: Accepted

Solution code:
def discount(x):
  return (x // 15) * 200

def cost(x):
  return x * 800

N = int(input())
Sum = cost(N) - discount(N)

print(Sum)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
#Restaurant
def ABC_55_A():
    N = int(input())

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

    print(odai)


if __name__ == '__main__':

    ABC_55_A()

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7

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

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

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

Submission status: Accepted

Solution code:
#a,b=map(int,input().split())
n=int(input())
#s=input()
if n<15:
  print(n*800)
else:
  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())
x = n * 800
y = n // 15 * 200
print(x-y)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
 
#  = input()
n  = int(input())
#  = map(int, input().split())
#  = list(map(int, input().split()))
#  = [int(input()) for i in range(N)]
#
# c = collections.Counter()

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

Submission status: Accepted

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

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

print(x-y)

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

print(x-y)

Submission status: Accepted

Solution code:
import math

n = int(input())

a = math.floor(n / 15)

print(800 * n - 200 * a)

Submission status: Accepted

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

N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

a = n // 15

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if '__main__' == __name__:
    resolve()

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:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    print(800*n-(n//15)*200)
resolve()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

# import sys
# input = sys.stdin.readline
# 
# sys.setrecursionlimit(10 ** 7)
# 
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
#     while abs(ok - ng) > 1:
#         mid = (ok + ng) // 2
#         if func(mid):
#             ok = mid
#         else:
#             ng = mid
#     return ok

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
div, mod = divmod(N, 15)
x = N * 800
y = div * 200

print(x - y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import sys

input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
N=int(input())
print(N*800-N//15*200)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
# MOD = 10 ** 9 + 7
# INF = float("inf")


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:

import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right

# https://atcoder.jp/contests/abc055/tasks/abc055_a

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

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 heapq import heapify, heappop, heappush
 
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()
x = N * 800
y = N // 15 * 200
print(x - y)

Submission status: Accepted

Solution code:
n = int(input())

sum = n * 800
minus = (n//15) * 200

print(sum-minus)

Submission status: Accepted

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

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
import math
N=int(input())
x=800*N
y=N//15
if (y+1)*15<=N:
  y+=1
print(x-200*y)

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(800*N-math.floor(N/15)*200)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N=I()
    print(N*800-(N//15*200))
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

print (x - y)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    n = I()
    x = n*800
    y = (n//15)*200
    print(x-y)
    return

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

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

Submission status: Accepted

Solution code:
#%%code
def resolve():
    N=int(input())
    ans=0
    cnt=0
    for i in range(N):
        ans+=800
        cnt+=1
        if cnt==15:
            ans-=200
            cnt=0
    print(ans)
#%%submit!
resolve()

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

Submission status: Accepted

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