Problem:


Score : 100 points

Problem Statement

How many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?

Constraints

1≤M≤23

M is an integer.

Input

Input is given from Standard Input in the following format:

M

Output

If we have x hours until New Year at M o'clock on 30th, December, print x.

Sample Input 1

21

Sample Output 1

27

We have 27 hours until New Year at 21 o'clock on 30th, December.

Sample Input 2

12

Sample Output 2

36



Sample input:
21


Sample output:
27

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,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
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():
    M=I()
    print(24-M+24)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    M = int(input())
    print(48 - M)


main()

Submission status: Accepted

Solution code:
M = int(input())
ans = 48 - M

print(ans)

Submission status: Accepted

Solution code:
a=int(input())
print(int(24+(24-a)))

Submission status: Accepted

Solution code:
x = int(input())
print(24+24-x)

Submission status: Accepted

Solution code:
m = int(input())
ans = 24 - m + 24
print (ans)

Submission status: Accepted

Solution code:
#84a
print(24+(24-int(input())))

Submission status: Accepted

Solution code:
from sys import stdin
from itertools import combinations
from math import factorial
import numpy as np
import math

n = int(stdin.readline().rstrip())

print(24-n+24)

Submission status: Accepted

Solution code:
def examA():
    N = I()
    ans = 48-N
    print(ans)


import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

Solution code:
y = int(input())

print(48-y)

Submission status: Accepted

Solution code:
M = int(input())

print(24 + (24 - M))

Submission status: Accepted

Solution code:
m  = int(input())
print(48 - m)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")

def main():
    m=int(input())
    print(48-m)

main()

Submission status: Accepted

Solution code:
n = int(input())

print(24-n+24)

Submission status: Accepted

Solution code:
input = int(input())
print(48 - input)

Submission status: Accepted

Solution code:
#New Year
a = int(input())
print(48-a)

Submission status: Accepted

Solution code:
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics

def main():
    m = int(sys.stdin.readline().rstrip())
    print(48 - m)

if __name__ == "__main__":
    # execute only if run as a script
    main()

Submission status: Accepted

Solution code:
M = int(input())
print((24-M)+24)

Submission status: Accepted

Solution code:
print(24-int(raw_input()) + 24)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
M = int(input())
print(48-M)

Submission status: Accepted

Solution code:
# A - New Year
m = int(input())
print(24 - m + 24)

Submission status: Accepted

Solution code:
#asddddddddddddddddddddddddddddddddddddddddd
n = int(input())
print(48-n)

Submission status: Accepted

Solution code:
M = int(input())

untill_newyear = 24 + (24-M)
print(untill_newyear)

Submission status: Accepted

Solution code:
M = int(input())
print(24- M + 24)

Submission status: Accepted

Solution code:
m = int(input())
print( 48 - m )

Submission status: Accepted

Solution code:
m = int(raw_input())
  
print(24-m + 24)

Submission status: Accepted

Solution code:
m=int(input())
n=24-m
print(n+24)

Submission status: Accepted

Solution code:
N = int(input())
print(24+24-N)

Submission status: Accepted

Solution code:
number = int(input())
h=48-number
print(h)

Submission status: Accepted

Solution code:
s=int(input());print(48-s)

Submission status: Accepted

Solution code:
N = int(input())
print(24 - N + 24)

Submission status: Accepted

Solution code:
print(48 - int(input()) )

Submission status: Accepted

Solution code:
M=int(input())
print(24-M+24)

Submission status: Accepted

Solution code:
def new_year(M):
    return 48-M

M=int(input())
print(new_year(M))

Submission status: Accepted

Solution code:
M=int(input())

def new_year(M):
    return 48-M

print(new_year(M))

Submission status: Accepted

Solution code:
M=input()
M=int(M)
ans=48-M
print(ans)

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a=INT()
    print(48-a)
if __name__ == '__main__':
    do()

Submission status: Accepted

Solution code:
#2019/10/03
M = int(open(0).read())
print(48-M)

Submission status: Accepted

Solution code:
M = int(input())
ans = 24 + (24-M)
print(ans)

Submission status: Accepted

Solution code:
m = int(input())

print(24 * 2 - m)

Submission status: Accepted

Solution code:
def aa084():
    m = int(input()) # 1-23
    print(24 - m + 24)

aa084()

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    m = int(input().rstrip('\n'))
    print(24 - m + 24)


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    m = int(input())
    print(48 - m)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/python3

import sys
# input = sys.stdin.readline
sys.setrecursionlimit(100000)
MOD = 10 ** 9 + 7

#N = int(input())
#A = [int(x) for x in input().split()]
#V = [[0] * 100 for _ in range(100)]

M = int(input())
print(48 - M)

Submission status: Accepted

Solution code:
m = int(input())
print(24 + (24 - m))

Submission status: Accepted

Solution code:
n = int(input())
print((24-n)+24)

Submission status: Accepted

Solution code:
i = int(input())
print((24-i)+24)

Submission status: Accepted

Solution code:
print(24-int(input())+24)

Submission status: Accepted

Solution code:
# ABC094 A - New Year
print(48-int(input()))

Submission status: Accepted

Solution code:
m = int(input())
ny = 48-m
print(ny)

Submission status: Accepted

Solution code:
M = int(input())

print(24+(24-M))

Submission status: Accepted

Solution code:
n=int(input())
print(48 - n)

Submission status: Accepted

Solution code:
a = input()
x = int(a)
print(48-x)

Submission status: Accepted

Solution code:
a = input()
a = int(a)
print(48-a)

Submission status: Accepted

Solution code:
M=input()
M=int(M)
x=48-M
print(x)

Submission status: Accepted

Solution code:
a=int(input())
b=24-a
a=b+24
print(a)

Submission status: Accepted

Solution code:
first = input()
m = int(first)
print(48-m)

Submission status: Accepted

Solution code:
m = int(input())
print((24 - m) + 24 )

Submission status: Accepted

Solution code:
print(24*2 - int(input()))

Submission status: Accepted

Solution code:
m = int(input())
print((24 - m) + 24)

Submission status: Accepted

Solution code:
print(48-int(input().strip()))

Submission status: Accepted

Solution code:
N =int(input())
print(48-N)

Submission status: Accepted

Solution code:
M = int(input())

print(24 * 2 - M)

Submission status: Accepted

Solution code:
#時間を入力
M=int(input())

#新年までの時間H
H=(24-M)+24

#時間を出力
print(H)

Submission status: Accepted

Solution code:
M = int(input())

print(24+24-M)

Submission status: Accepted

Solution code:
M = int(input())

ans = 24 + 24 - M
print(ans)

Submission status: Accepted

Solution code:
M = int(input())

print(24-M + 24)

Submission status: Accepted

Solution code:
m = int(input())
print(24 + (24-m))

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
print(48-int(input()))

Submission status: Accepted

Solution code:
a=int(input())
b=48-a
print(b)

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""


N =  int(sys.stdin.readline())
print(24 + (24 - N))

Submission status: Accepted

Solution code:
a = int(input())
print(48 - a)

Submission status: Accepted

Solution code:
M = int(input())
X = 24 + (24-M)
print(X)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def main():
    N = int(input())
    print(48 - N)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
M = int(input())
print(24 + 24 - M)

Submission status: Accepted

Solution code:
M =int(input())
print(48-M)

Submission status: Accepted

Solution code:
m = int(input())
if 1 <= m <= 23:
    print(24 + 24 - m)
else:
    print('hoge!')

Submission status: Accepted

Solution code:
import sys
from statistics import *
from collections import *
from operator import itemgetter

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

m = ni()
print(24 + 24 - m)

Submission status: Accepted

Solution code:
print(24 * 2 - int(input()))

Submission status: Accepted

Solution code:
m = input()

ans = 48-int(m)
print(ans)

Submission status: Accepted

Solution code:
def resolve():
    m = int(input())
    print(48 - m)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

m = int(input())

print(48-m)

Submission status: Accepted

Solution code:
a=int(input())
b=24-a
c=24+b
print(c)

Submission status: Accepted

Solution code:
M = int(input())
r = 48-M
print(r)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
  M = int(input())
  print(24-M+24)

Submission status: Accepted

Solution code:
M = int(input())
answer = abs (24-M) + 24
print(answer)

Submission status: Accepted

Solution code:
print(48-int(input()))

Submission status: Accepted

Solution code:
print(48-int(input()))

Submission status: Accepted

Solution code:
print(2 * 24 - int(input()))

Submission status: Accepted

Solution code:
m = int(input())
x = 48 - m
print(x)

Submission status: Accepted

Solution code:
def main():
    M = int(input())
    return 48 - M

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

Submission status: Accepted

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

M = int(input())

print(24 + 24 - M)

Submission status: Accepted

Solution code:
def main():
    m=int(input())
    print(48-m)
main()

Submission status: Accepted

Solution code:
#coding:utf-8
m = int(input())
print((24-m) + 24)

Submission status: Accepted

Solution code:
M = int(input())
print(24-M+24)

Submission status: Accepted

Solution code:
def test():
    m = int(input())
    print(24 + 24 - m)


if __name__ == "__main__":
    test()

Submission status: Accepted

Solution code:
t = int(input())
print(48 - t)

Submission status: Accepted

Solution code:
m = int(input())
print(24 * 2 - m)

Submission status: Accepted

Solution code:
M=int(input())

print(24-M+24)

Submission status: Accepted

Solution code:

def main():


    M = int(input())

    print(48-M)



    


if __name__== "__main__":
    main()

Submission status: Accepted

Solution code:
a = int(input())

print(48-a)

Submission status: Accepted

Solution code:
N = int(input())
print(24*2-N)

Submission status: Accepted

Solution code:

m = int(input())
print(24 + 24-m)

Submission status: Accepted

Solution code:
print (48 - int(input()))

Submission status: Accepted

Solution code:
print(48-int(input()))

Submission status: Accepted

Solution code:
w=int(input())
print(48-w)

Submission status: Accepted

Solution code:
#12/30日のM時から24時になるまでの時間たす24時間

m = input()
m = int(m)

#24-mが1日の残り時間
#x = 24-m+24 =

x = 48-m
print(x)

Submission status: Accepted

Solution code:
#ABC085
n = int(input())
print(48-n)

Submission status: Accepted

Solution code:

print(48 - int(input()))

Submission status: Accepted

Solution code:
#84

M = int(input())
print(48-M)

Submission status: Accepted

Solution code:
M = int(input())
year = 24 + (24 - M)
print(year)

Submission status: Accepted

Solution code:
M = int(input())
print (24-M+24)

Submission status: Accepted

Solution code:
m=int(input())
print(24-m+24)

Submission status: Accepted

Solution code:
M = int(input())
print(24-M + 24)

Submission status: Accepted

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

# input
M = int(input())

# solve & output
print(48 - M)

Submission status: Accepted

Solution code:
M = int(input())

print(str(24+24-M))

Submission status: Accepted

Solution code:
m = int(input())

print(24 + 24 - m)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

N = int(input())

print(48 - N)

Submission status: Accepted

Solution code:
i1 = int(input())
print(24-i1+24)

Submission status: Accepted

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

m = int(input())
print(48 - m)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
N = int(input())

print(24 + (24 - N))

Submission status: Accepted

Solution code:
a = int(input())
print(24 - a + 24)

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
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

M = INT()
b = 24 - M
ans = 24 + b
print(ans)

Submission status: Accepted

Solution code:
print( 48 - int(input()))

Submission status: Accepted

Solution code:
M = int(input());
print(48-M);

Submission status: Accepted

Solution code:
import sys

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    m = int(input())

    print(24 - m + 24)

Submission status: Accepted

Solution code:
m = int(input())
ans = 24 + 24 -m
print(ans)

Submission status: Accepted

Solution code:
M=int(input())
print(24*2-M)

Submission status: Accepted

Solution code:
M = int(input())
 
print(24 + 24 - M)

Submission status: Accepted

Solution code:
M = int(input())

print(24 + 24 - M)

Submission status: Accepted

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

M = int(input())

# print(M)

print(24 - M + 24)

Submission status: Accepted

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


def solve(M: int):
    print(48 - M)
    return


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x=int(input())
print((24-x)+24)

Submission status: Accepted

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

M = n()

print(48 - M)

Submission status: Accepted

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


def solve(M: int):
    print(48-M)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    M = int(next(tokens))  # type: int
    solve(M)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def abc():
    n = int(input())
    print(48 - n)


abc()

Submission status: Accepted

Solution code:
X=int(input())
print(48-X)

Submission status: Accepted

Solution code:
from collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint
import bisect
import copy
import fractions
import itertools
import math
import queue
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers): return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): return reduce(LCM, numbers)
def LCM(m, n): return (m * n // fractions.gcd(m, n))


print(48 - int(input()))

Submission status: Accepted

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

m = int(input())

print(48-m)

Submission status: Accepted

Solution code:
n = int(input())
print(int(24+(24-n)))

Submission status: Accepted

Solution code:
M = int(input())

print(24 - M + 24)

Submission status: Accepted

Solution code:
print (48-int(input()))

Submission status: Accepted

Solution code:
s = int(input())

ans = (24-s ) + 24
print(ans)

Submission status: Accepted

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


def solve(M: int):
    ret = 48 - M
    print(ret)
    return


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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
M = input()
M = int(M)

X = 24 - M + 24

print(X)

Submission status: Accepted

Solution code:
# 2019/05/29
# AtCoder Beginner Contest 084 - A

# Input
m = int(input())

ans = 48 - m

# Output 
print(ans)

Submission status: Accepted

Solution code:
m=int(input())

answer=(24-m)+24

print(answer)

Submission status: Accepted

Solution code:
a=int(input())

print(48-a)

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

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

Submission status: Accepted

Solution code:
print(abs(24-int(input()))+24)

Submission status: Accepted

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

print(48-int(input()))

Submission status: Accepted

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

#A
def A():
    m = II()
    print(48-m)
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    a = II()
    ans = inf
    b = 0
    for k in range(1, 10 ** 5):
        b += a
        ans = min(ans, sum(list(map(int, list(str(b))))))
    print(ans)
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

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

Submission status: Accepted

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

M = int(input())


print(48-M)

Submission status: Accepted

Solution code:

M = int(input())

print(48 - M)

Submission status: Accepted

Solution code:
M = int(input())
print(str(24-M+24))

Submission status: Accepted

Solution code:
import math
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


n = int(input())
print(48-n)

Submission status: Accepted

Solution code:
M = int(input())
print(24 + 24 - M)

Submission status: Accepted

Solution code:
import sys, os

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

def solve():
    m = f()[0]
    print(24*2 - m)

solve()

Submission status: Accepted

Solution code:
a = int(input())
ans = (48-a)
print(ans)

Submission status: Accepted

Solution code:

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

def submit():
    m = read_input()

    print(24 + 24 - m)

if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
a = int(input())
print((24-a)+24)

Submission status: Accepted

Solution code:
S = input()
a = 24 - S
b = a + 24
print b

Submission status: Accepted

Solution code:
M = input()
print(24 - int(M) + 24)

Submission status: Accepted

Solution code:
m=int(input())

print(int(48-m))

Submission status: Accepted

Solution code:
print(48-int(input()))

Submission status: Accepted

Solution code:
N = int(input())
print((24-N)+24)

Submission status: Accepted

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

print(48 - int(input()))

Submission status: Accepted

Solution code:
M = int(input())
ans = 48 - M
print(ans)

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


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


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


def inps():
    return input()


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


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


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


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


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


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


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


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


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


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

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

    return wrapper


m=inp()
print(24 + 24-m)

Submission status: Accepted

Solution code:
x = int(input())
print(24+24-x)

Submission status: Accepted

Solution code:
# ABC084A - New Year
print(48 - int(input()))

Submission status: Accepted

Solution code:
print(48 -int(input()))

Submission status: Accepted

Solution code:
M = int(input())
print(24*2 - M)

Submission status: Accepted

Solution code:
m=48-int(input())
print(m)

Submission status: Accepted

Solution code:
m=int(input())
m=abs(m-24)
print(m+24)

Submission status: Accepted

Solution code:
h = int(input())

print(24 + (24 - h))

Submission status: Accepted

Solution code:
t = int(input())

print(24+(24-t))

Submission status: Accepted

Solution code:
#coding: utf-8

a = int(input())

print((24 - a) + 24)

Submission status: Accepted

Solution code:
#coding: utf-8

a = int(input())

print(24 - a + 24)

Submission status: Accepted

Solution code:
M = input()
M = int(M)

print(48-M)

Submission status: Accepted

Solution code:
a = int(input())
print((24-a)+24)

Submission status: Accepted

Solution code:
M=input()
M=int(M)

print(48-M)

Submission status: Accepted

Solution code:
#084 A

N =int(input())
print(24 * 2 -N)

Submission status: Accepted

Solution code:
def main():
    print(24 * 2 - int(input()))


main()

Submission status: Accepted

Solution code:
M = int(input(""))
print(48-M)

Submission status: Accepted

Solution code:
M = int(input())

print(24 + 24- M)

Submission status: Accepted

Solution code:

M = int(input())
print(48-M)

Submission status: Accepted

Solution code:
m = int(input())
x = (24 * 2) - m
print(x)

Submission status: Accepted

Solution code:
a =  int(input())
print(24-a + 24)

Submission status: Accepted

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

def main():
	M = int(input())
	
	tmp = 24 - M
	print(24 + tmp)
	
	
if __name__ == "__main__":
	main()

Submission status: Accepted

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

def main():
	M = int(input())
	
	tmp = 24 - M
	print(24 + tmp)
	
	
if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
k = list(map(int,input().split()))
print(48-k[0])

Submission status: Accepted

Solution code:
n = int(input())
print(24 - n + 24)

Submission status: Accepted

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

#A
def A():
    m = I()
    print(48-m)
    return

#B
def B():
    return

#C
def C():
    n = I()
    a = LIR(n-1)
    for i in range(n):
        t = 0
        x = i
        while x < n-1:
            if t < a[x][1]:
                t = a[x][1]
            t += (a[x][2]-t)%a[x][2]
            t += a[x][0]
            x += 1
        print(t)

#D
def D():
    def check(n):
        if n == 1:
            return False
        i = 2
        while i*i <= n:
            if n%i == 0:
                return False
            i += 1
        return True
    f = [0 for i in range(100001)]
    for i in range(1,100001):
        f[i] += f[i-1]
        if check(i):
            if check((i+1)//2):
                f[i] += 1
    q = I()
    for i in range(q):
        l,r = LI()
        print(f[r]-f[l-1])

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

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

Submission status: Accepted

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

m = int(input())

print(48 - m)

Submission status: Accepted

Solution code:
I = int(input())
print(24+24-I)

Submission status: Accepted

Solution code:
def solve(string):
    return str(48 - int(string))


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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
M = int(input())
print(24 - M + 24)

Submission status: Accepted

Solution code:
time=int(input())
print((24-time)+24)

Submission status: Accepted

Solution code:
N = int(input())
print(24+(24-N))

Submission status: Accepted

Solution code:
M = int(input())

theEndOfYear = 24 + (24 - M)

print(theEndOfYear)

Submission status: Accepted

Solution code:
n=int(input())
a=24-n
print(24+a)

Submission status: Accepted

Solution code:
a=input()
a=int(a)

print(24+24-a)

Submission status: Accepted

Solution code:
print(str(48-int(input())))

Submission status: Accepted

Solution code:
#84
m = int(input())
print(48-m)

Submission status: Accepted

Solution code:
#84A
m = int(input())
print(48-m)

Submission status: Accepted

Solution code:
def new_year(M: int)->int:
    return 48-M


if __name__ == "__main__":
    M = int(input())
    ans = new_year(M)
    print(ans)

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc084/tasks/abc084_a

import itertools
import collections
import bisect

def main():
    M = int(input())
    print(24 + 24 - M)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

def main():
  input = sys.stdin.readline
  n = int(input())
  print(48-n)


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
# A
m = int(input())
print(48-m)

Submission status: Accepted

Solution code:
def main():
    M = int(input())
    print(48-M)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
print(24 + 24 - N)

Submission status: Accepted

Solution code:
from sys import stdin
a=int(stdin.readline().rstrip())
print(48-a)