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:
# 入力
n = int(input())
# 払った金額
x = n*800
# N食を１５で割った商×200円
y = 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 - Restaurant

# 1食800円、15食食べるごとに200円もらえる
# 合計N食食べた場合、もらった金額を差し引いた総支払額はいくらか？

pay_count = int(input())

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

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

answer = x - y

print(answer)

Submission status: Accepted

Solution code:
# abc055_a
# 合計がN食
# 今まで払った金がx円
# レストランからもらったお金がy円
# x-y円を出力せよ

N = int(input())

x = N * 800
# //は切り捨ての除算
# 例えば、5//2の時は求まる2となる。5/2の時の商のみ。
y = N // 15 * 200
print(x - y)

Submission status: Accepted

Solution code:
N = int(input())

x = N * 800
# //は切り捨ての除算
# 例えば、5//2の時は求まる2となる。5/2の時の商のみ。
y = N // 15 * 200
print(x - y)

Submission status: Accepted

Solution code:
# 055_a
N = int(input())
if 1 <= N & N <= 100:
    count = int(N / 15)
    x = 800 * N
    y = 200 * count
    print(x - y)

Submission status: Accepted

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

# 制約
# 1 <= N <= 100

# 整数をNに入力できるようにする

N = int(input())

# 今までに払った金額　N * 800 = x
x = N * 800

# レストランからもらった金額yを計算
y = N // 15 * 200

# x-y
print(x-y)

Submission status: Accepted

Solution code:
#   AtCoder abc055 a

#   入力
n = int(input())

#   処理
# total_pay = n * 800
# total_back = (n // 15) * 200
# balance = total_pay - total_back
#   出力
print((n * 800) - ((n // 15) * 200))

Submission status: Accepted

Solution code:
#   AtCoder abc055 a

#   入力
n = int(input())

#   処理
total_pay = n * 800
total_back = (n // 15) * 200
balance = total_pay - total_back
#   出力
print(balance)

Submission status: Accepted

Solution code:
S = int(input())
          
#金額
x = S * 800
y = 200 * (S // 15)
print(x-y)

Submission status: Accepted

Solution code:
unit_price = 800
reward_money = 200

meals = int(input())

print(unit_price * meals - meals // 15 * reward_money)

Submission status: Accepted

Solution code:
meals = int(input())

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

Submission status: Accepted

Solution code:
unit_price = 800
reward_amount = 200

meals = int(input())

print(unit_price * meals - meals // 15 * reward_amount)

Submission status: Accepted

Solution code:
#1食800円
#15食食べると200円もらえる　N/15*200
#合計N食、金額x円,レストランからもらった金額y円
#x - y を求める
#標準入力

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

Submission status: Accepted

Solution code:
# 全て1食800円のレストラン
# 15食食べるごとにその場で200円もらえる
# 合計N食たべた。払った金額=x円、もらった金額をy円としてx-yを求める

# 入力されたNを数値に変換
N = int(input())

# 払った金額=x円を求める
x = 800 * N

# もらった金額=y円を求める
# 200円 * 回数Nを15で割った時の整数の商
y = 200 * (N // 15)

print(x-y)

Submission status: Accepted

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

# 合計金額及びキャッシュバック金額を取得
Cashsum = 800 * N 
Cashback = (N // 15) * 200

# 合計金額からキャッシュバック額を引いたものを出力
print(Cashsum - Cashback)

Submission status: Accepted

Solution code:
N = int(input())

answer = 800 * N - ( N//15 * 200 )

print(answer)

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

y = N // 15
x = N * 800

if y >= 1:
    print( x - (y * 200))
else:
    print(x)

Submission status: Accepted

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

print(int(x - y))

Submission status: Accepted

Solution code:
N= int(input())
x= 800 * N
if N < 15:
    y = 0
if 15 <= N < 30:
    y = 200
if 30 <= N < 45:
    y = 400
if 45 <= N < 60:
    y = 600
if 60 <= N < 75:
    y = 800
if 75 <= N <90:
    y = 1000
if 90 <= N <=100:
    y = 1200
print(x-y)

Submission status: Accepted

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

# 標準入力から食事回数（N）を取得する
input_num = int(input())

# x - y （円）を計算し出力する。
x = input_num * 800 # x：今までに払った金額
y = int(input_num / 15) * 200  # y：レストランからもらった金額
result = x - y  # 差額

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

# 処理
x = 800 * N
y = N // 15 * 200

answer = x - y
print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

total_Money = x - y
print(total_Money)

Submission status: Accepted

Solution code:
N=int(input())

x=N*800

y=N//15*200

print(x-y)

Submission status: Accepted

Solution code:
# xの式： x = N * 800
# yの式： y = N // 15 * 200 '//で整数切り捨ての割り算

N = int(input())    # 食べた食事数Nを代入

x = N * 800 # 食事代xを計算

y = N // 15 * 200   # 15食毎の返金額yを計算

answer = x - y  # x - yの値

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

# (N食×800円) - (N割る15切り捨て*200円)
x = N * 800
y = N // 15 * 200
answer = x - y
print(answer)

Submission status: Accepted

Solution code:
n = int(input())

if n >= 15:
    x = n * 800
    y =( n // 15 ) * 200
    answer = x - y
    print(answer)
else:
    answer = n * 800
    print(answer)

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:
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:
#何回食べたか入力を受け取る
number = int(input())
#単価800円×回数
x = 800 * number
#15で割った商×200円
y = number // 15 * 200

total_price = x-y
print(total_price)

Submission status: Accepted

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

# 処理

total_pay = 800 * N
total_get =N // 15 * 200

# 出力
answer = total_pay - total_get
print(answer)

Submission status: Accepted

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

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())
# Nは食事数

x = N * 800
# xは合計金額
y = N // 15 * 200
# yは値引き金額
# //だと小数点以下切り捨て

print(x-y)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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:
N = int(input(''))
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:
#何回食べたか入力を受け取る
number = input()
#文字列から数値に変換
number = int(number)
#単価800円×回数
x = 800 * number
#15で割った商×200円
y = number // 15 * 200

total_price = x-y
print(total_price)

Submission status: Accepted

Solution code:
N = int(input())

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

print(x - y)

Submission status: Accepted

Solution code:
number = int(input())

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

print(x-y)

Submission status: Accepted

Solution code:
# 055A

N = int(input())

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

answer = x - y

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Restaurant

# N 今までに食べた食数
# x 今までに払った金額（円）
# y レストランからもらった金額（円）

N = int(input())
# print(N)

# x の計算 1食800円
x = N * 800
# print(x)

# y の計算 15食毎200円
y = int(N / 15) * 200
# print(y)

# x - y
answer = x - y

# 結果の表示
print(answer)

Submission status: Accepted

Solution code:
num_ate_food = int(input())

total_cost = num_ate_food * 800
cash_back = 0

if num_ate_food >= 15:
    cash_back = (num_ate_food // 15) * 200

total_paid = total_cost - cash_back
print(total_paid)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout


def main() -> None:
    line = int(stdin.readline())
    x = line * 800
    tmp = line / 15
    y = int(tmp) * 200
    rta = x - y
    print(rta)


main()

Submission status: Accepted

Solution code:
from sys import stdin, stdout

def main():
    line = stdin.readline()
    parts = line.split()
    X = int(parts[0])
    x = X*800
    y = 200*int(X/15)
    stdout.write(str(x-y))

main()

Submission status: Accepted

Solution code:
from sys import stdin,stdout

def main():
    line=stdin.readline()
    parts=line.split()
    a=int(parts[0])
    b=800*a
    c=int(a/15)*200
    stdout.write(str(int(b-c)))
main()

Submission status: Accepted

Solution code:
from sys import stdin, stdout


def main():
    line = stdin.readline()
    parts = line.split()
    n = int(parts[0])
    x = 800*n
    y = (int(n/15)) * 200



    stdout.write( str(x-y))


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N = int(readline())
    x = 800*N
    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 = 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())

ans = 0
for i in range(1, n+1):
    ans += 800
    if i % 15 == 0:
        ans -= 200

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]


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(200*(4*n-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())

payback = int((n//15) * 200)
charges = 800 * n

ans = charges - payback
print(ans)

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

Submission status: Accepted

Solution code:
n = int(input())
value = n*800
down = n/15

if(int(down) >= 1):
    print(value - (int(down) * 200))
else:
    print(value)

Submission status: Accepted

Solution code:
N=int(input())

cnt=N//15

ans=N*800-200*cnt

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(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:
from math import floor

N = int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
ans = 800 * n - 200 * (n // 15)
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:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
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 - 200 * (N // 15))

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

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

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


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


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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

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

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
print(800*N-((N//15)*200))

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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


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

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

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

retu = int(N / 15)

ans = N * 800 - retu * 200

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

ans = 0

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

print(ans)

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque, Counter
import math

# import copy
from bisect import bisect_left, bisect_right
import heapq

# sys.setrecursionlimit(1000000)

# input aliases
input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)


def nck(n, k, kaijyo):
    return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD


def npk(n, k, kaijyo):
    if k == 0 or k == n:
        return n % MOD
    return (kaijyo[n] * divide(kaijyo[n-k])) % MOD


def kaijyo(n):
    ret = [1]
    for i in range(1, n + 1):
        ret.append((ret[-1] * i)% MOD)
    return ret

def solve():

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

def main():
    n = getN()
    for _ in range(n):
        solve()


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())
print(800*a-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())
y_count = 0
x = 800*n

for i in range(1,n+1):
    if i%15==0:
        y_count+=1
    
print(x-y_count*200)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
n = I()
print(n * 800 - 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())
ans = 800*N-200*(N//15)
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:
import sys
from collections import defaultdict, deque, Counter
import math
 
# import copy
from bisect import bisect_left, bisect_right
# import heapq
 
# sys.setrecursionlimit(1000000)
 
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]
 
INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)
 
def search(pros,tgt,g,d):
    tmp = 0
    cnt = 0
    rest = []
    for i in range(d):
        if tgt % 2 == 1:
            tmp += 100 * (i+1) * pros[i][0] + pros[i][1]
            cnt += pros[i][0]
        else:
            rest.append((i+1,pros[i][0]-1))
        tgt //= 2
    # print(tmp)
    if tmp >= g:
        return cnt
    for ap, ac in rest[::-1]:
        if tmp + 100 * ap * ac >= g:
            cnt += math.ceil((g - tmp)/(100 * ap))
            return cnt
        else:
            cnt += ac
            tmp += 100 * ac * ap

    return INF

def main():

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

 
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

N = ini()


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


print(solve())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(x-y)

Submission status: Accepted

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

resolve()

Submission status: Accepted

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

a = 800*N
b = (N // 15)*200

print(a-b)

Submission status: Accepted

Solution code:
times = int(input())
tmp = times
count = 0
while tmp >= 15:
    tmp -= 15
    count += 1
print(times * 800 - count * 200)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

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

    print(x - y)

if __name__ == '__main__':
    main()

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

print(x-y)

Submission status: Accepted

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

n = int(input())

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

Submission status: Accepted

Solution code:
def actual(N):
    amount = 800 * N

    coupon = N // 15

    discount = 200 * coupon

    return amount - discount

N = int(input())
print(actual(N))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
import sys
import math
N = int(input())
if N < 0 or N > 100:
    sys.exit()

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

Submission status: Accepted

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