Problem:


Score : 100 points

Problem Statement

Dolphin loves programming contests. Today, he will take part in a contest in AtCoder.

In this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as "21 o'clock".

The current time is A o'clock, and a contest will begin in exactly B hours.
When will the contest begin? Answer in 24-hour time.

Constraints

0 \leq A,B \leq 23

A and B are integers.

Input

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

A B

Output

Print the hour of the starting time of the contest in 24-hour time.

Sample Input 1

9 12

Sample Output 1

21

In this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.

Sample Input 2

19 0

Sample Output 2

19

The contest has just started.

Sample Input 3

23 2

Sample Output 3

1

The contest will begin at 1 o'clock the next day.



Sample input:
9 12


Sample output:
21

Submission status: Accepted

Solution code:
A,B = map(int, input().split())
ans = (A + B) % 24
print(ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
a+=b;
if a>23:
    print(a-24)
else :
    print(a)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print((a+b)%24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print(A+B-24 if A+B >= 24 else A+B)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b>=24:
    print((a+b)-24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    a,b=map(int,input().split())
    print((a+b)%24)

Submission status: Accepted

Solution code:
def main():
    A, B = map(int, input().split())

    next = A + B
    if next >= 24:
        next -= 24

    print(next)
main()

Submission status: Accepted

Solution code:
# AtCoder
A, B = map(int, input().split())
ans = A + B
if ans > 24:
    ans = ans - 24

if ans == 24:
    print(0)
else:
    print(ans)

Submission status: Accepted

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

print((a + b) % 24)

Submission status: Accepted

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

print((a+b) % 24)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
ans=a+b
if ans<24:
    print(ans)
else:
    ans-=24
    print(ans)

Submission status: Accepted

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

print((a+b)%24)

Submission status: Accepted

Solution code:
# solution

n, m = map(int, input().split())

print((n + m) % 24)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if (a+b)<24:
    print(a+b)
else:
    print(a+b-24)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ans = (a+b)%24
print(ans)

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
print(a + b) if a + b < 24 else print(a + b - 24)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a + b <= 23:
    print(a + b)
else:
    print((a + b) - 24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

AB = A + B
if AB >= 24:
    print(AB - 24)
else:
    print(AB)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print((A + B) % 24)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

print((A+B) % 24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
T = A+B
if (T < 24):
    print(T)
else:
    print(T-24)

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
print((a+b)%24)

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a + b >= 24:
  print(a + b - 24)
else:
  print(a + b)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
time = x + y
if time < 24:
    print(str(time))
else:
    print(str(time - 24))

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if (a+b) < 24:
  print(a+b)
else:
  print(a+b-24)

Submission status: Accepted

Solution code:
a,b=[int(i) for i in input().split()]


print((a+b)%24)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if 24<=A+B:
  print((A+B)-24)
else:
  print(A+B)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print(A+B if A+B<24 else A+B-24)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if (A+B)>=24:
    print(A+B-24)
else:
    print(A+B)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A+B < 24:
    print(A+B)
else:
    print(A+B-24)

Submission status: Accepted

Solution code:
# -*- encoding: utf-8 -*-
# A - Remaining Time
# 標準入力の取得
A,B = list(map(int, input().split()))

# 開始時刻の算出
print((A + B) % 24)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a + b < 24:
    print(a+b)
else:
    print(a+b-24)

Submission status: Accepted

Solution code:
a,b= map(int,input().split())
print((a+b)%24)

Submission status: Accepted

Solution code:
A, B = [int(x) for x in input().split()]
print((A + B) % 24)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


A, B = MI()
print((A + B) % 24)

Submission status: Accepted

Solution code:
a,b = map(int,input().split()) 
ans = a + b
print(ans%24)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

a, b = na()

print((a + b) % 24)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print(a+b if a+b<=23 else a+b-24)

Submission status: Accepted

Solution code:
def main():
  a,b = map(int,input().split())
  print((a+b)%24)
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc057/tasks/abc057_a

A, B = map(int, input().split())

start = A + B

if start >= 24:
    start -= 24

print(start)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

if A + B <24:
	answer= A + B
elif A + B >= 24:
	answer = (A + B) - 24
print(answer)

Submission status: Accepted

Solution code:
A, B = list(map(int,input().split()))

print((A+B) % 24)

Submission status: Accepted

Solution code:
import sys

a, b = map(int, sys.stdin.readline().split())

def main():
    print((a + b) % 24)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

print((a+b)%24)

Submission status: Accepted

Solution code:
# ABC 057: A – Remaining Time
a, b = [int(s) for s in input().split()]
print(a + b if a + b <= 23 else a + b - 24)

Submission status: Accepted

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

sum = a + b
print(int(sum%24))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
r = a + b
if r >= 24:
	r = r - 24
print(r)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if (a + b < 24):
    print(a + b)
else:
    print(a + b - 24)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())

ans=A+B

if ans>=24:
    print(ans-24)
else:
    print(ans)

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    print((a[0]+a[1] )%24)

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

a,b = iim()

print((a+b)%24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
result = (A + B) % 24

print(result)

Submission status: Accepted

Solution code:

a,b = map(int,input().split())
if a + b < 24:
    print(a + b)
else:
    print(a+b-24)

Submission status: Accepted

Solution code:
A,B=map(int,input().split());print((A+B)%24)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
print(A+B if A+B<24 else A+B-24)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if A+B<24:
  print(A+B)
else:
  print(A+B-24)

Submission status: Accepted

Solution code:
a,b=list(map(int,input().split()))
k=(a+b)%24
print(k)

Submission status: Accepted

Solution code:
A,B = [int(i) for i in input().split()]

ans = int((A+B)%24)

print(ans)

Submission status: Accepted

Solution code:
import math

a,b=map(int,input().split())
print((a+b)%24)

Submission status: Accepted

Solution code:
A, B = map(int,input().split())

print((A + B) % 24)

Submission status: Accepted

Solution code:
A,B = map(int, input().split())
print((A+B)%24)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
print(A+B if (A+B)<24 else A+B-24)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())

print((A+B)%24)

Submission status: Accepted

Solution code:
a,b=map(int,raw_input().split())
if a+b <24:
  print a+b
elif a+b>=24:
  print a+b-24

Submission status: Accepted

Solution code:
x=eval(input().replace(' ','+'));print(x%24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

print(A+B if A+B<24 else A+B-24)

Submission status: Accepted

Solution code:
import math

A,B=list(map(int, input().split()))

print((A+B)%24)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a+b<=23:
  print(a+b)
else:
  print(a+b-24)

Submission status: Accepted

Solution code:
a,b = [int(x) for x in input().split()]

if a + b < 24:
    print(a+b)
else:
    print(a+b-24)

Submission status: Accepted

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

print((a + b)%24)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
print((N + K) % 24)

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B = list(map(int, sys.stdin.buffer.readline().split()))
    print((A+B)%24)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

if a + b >= 24:
    print(a + b - 24)
else:
    print(a + b)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print((A+B) % 24)

Submission status: Accepted

Solution code:
#ABC057.A
A,B = map(int,input().split())
if A+B <24:
    print(A+B)
else:
    print(A+B-24)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if (a+b >= 24):
  print((a+b)-24)
else:
  print(a+b)

Submission status: Accepted

Solution code:
#abc057 a 
a,b=map(int,input().split())
print((a+b)%24)

Submission status: Accepted

Solution code:
a, b = [int(i) for i in input().split()]
tmp = a + b
if tmp >= 24:
  print(tmp % 24)
else:
  print(tmp)

Submission status: Accepted

Solution code:
a,b=(map(int,input().split()))
a=a+b
if a>23:
  print(a-24)
else:
  print(a)

Submission status: Accepted

Solution code:
time, rem = list(map(int, input().split()))
if time + rem > 23:
	time = time - 24
print(time + rem)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
ans=a+b
if ans>=24:
    ans=ans-24
print(ans)

Submission status: Accepted

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    a,b=MI()
    print((a+b)%24)

main()

Submission status: Accepted

Solution code:
A,B = map(int,input().split())

X= A + B

if X >= 24:
  Y= X - 24
  print(Y)
  
else:
  print(X)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
c = a + b
if c >= 24:
    print(c - 24)
else:
    print(c)

Submission status: Accepted

Solution code:
# A - Remaining Time
a,b=list(map(int,input().split()))
if (a+b)>=24:
    print(a+b-24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
a, b = list(map(int,input().split()))
print(a+b if a+b < 24 else a+b-24)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(int((a + b) %24))

Submission status: Accepted

Solution code:
a,b=map(int, input().strip().split())
print((a+b)%24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

print((A+B)%24)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
print( (A+B) % 24)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a+b <= 23:
    print(a+b)
else:
    print(a+b-24)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
a, b = map(int,input().split())

print((a+b) % 24)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
C=A+B
if C>=24:
    print(C-24)
else:
    print(C)

Submission status: Accepted

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

if (a+b)>=24:
    print(a+b-24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print((a+b) % 24)

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
if a + b < 24:
  print(a + b)
else:
  print(a + b - 24)

Submission status: Accepted

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

if (a+b) >=24:
    print(a+b - 24)
else:
    print(a+b)

Submission status: Accepted

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


def solve(A: int, B: int):
    print((A + B) % 24)


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

print((A+B)%24)

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a+b>23:
    print(a+b-24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
a,b = (int(x) for x in input().split())

if (a+b)<24:
    print(a+b)
else:
    print((a+b)%24)

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
t=a+b
if a+b>23:
  print(a+b-24)
else:
  print(a+b)

Submission status: Accepted

Solution code:
a,b=map(int,input().split());
tmp=a+b
if tmp>=24:
  print((a+b-24))
else:
  print((a+b))

Submission status: Accepted

Solution code:
# A
a, b = map(int, input().split())

if a+b >= 24:
    print(a+b-24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
a , b = map(int, input().split())
if a+b >= 24:
	print ((a + b) - 24)
else:
  	print (a + b)

Submission status: Accepted

Solution code:
a,b =map(int,input().split())
print((a+b)%24)

Submission status: Accepted

Solution code:
#057_A
a,b=map(int,input().split())
print((a+b)%24)

Submission status: Accepted

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

x = a + b

if x < 24:
  print(x)
else:
  print(x - 24)

Submission status: Accepted

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

print((a+b) % 24)

Submission status: Accepted

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

if a+b<24:
    print(a+b)
else:
    print(a+b-24)

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    a, b = map(int, input().split())

    print(str((a+b) % 24))

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

ans = A + B

if ans >= 24:
    ans -= 24

print(ans)

Submission status: Accepted

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

A,B = [int(i) for i in input().rstrip().split()]
print( (A+B) % 24 )

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print(a+b) if a+b<=23 else print(a+b-24)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a + b >= 24:
  print((a + b) - 24)
else:
  print(a + b)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print((a + b) - 24 if (a + b) >= 24 else a + b)

Submission status: Accepted

Solution code:
A, B = [int(_) for _ in input().split()]
print((A + B)%24)

Submission status: Accepted

Solution code:
def main():
    now_time, start_in = map(int, input().split())
    print((now_time + start_in) % 24)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#python3
def main():
    a, b = map(int, input().split())
    print((a+b)%24)
main()

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
#print(sorted(B)[0])
print((A+B)%24)

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
ans = (a + b)%24
 
print(ans)

Submission status: Accepted

Solution code:
def solve():
    A, B = map(int, input().split())

    # print(A, B)

    return (A + B) % 24


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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

print((A + B) % 24)

Submission status: Accepted

Solution code:
print(sum(list(map(int, input().split()))) % 24)

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))

print((a+b)%24)

Submission status: Accepted

Solution code:
a,b=list(map(int,input().split()))
if (a+b)>=24:
    print((a+b)-24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
# 57

A, B = map(int, input().split())

s = A + B

if s >= 24:
  print(s-24)
else:
  print(s)

Submission status: Accepted

Solution code:
[a,b]=list(map(int,input().split()))
ans=a+b
if ans>=24:
    ans-=24
print(ans)

Submission status: Accepted

Solution code:
#ABC057 A

a,b = map(int,input().split())
print((a + b)%24)

Submission status: Accepted

Solution code:
A,B = map(int, input().split())
if A + B > 23:
    print(A + B - 24)
else:
    print(A + B)

Submission status: Accepted

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

if a + b < 24:
    print(a + b)
else:
    print(a + b - 24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print(A+B -24*((A+B)//24) if A+B >=24 else A+B)

Submission status: Accepted

Solution code:
A, B = map(int,input().split())

if A + B < 24:
    print (A + B)
else:
    print((A + B) -24)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a+b >= 24:
    print(a+b - 24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a+b<24: print(a+b)
else: print((a+b)%24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split(' '))
print(A + B - 24 if A + B >= 24 else A + B)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())

ans=A+B
if ans>=24:
    ans = ans - 24

print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a+b >= 24:
    print(a+b-24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 057
# A - Remaining Time
A, B = map(int, input().split())
print((A+B)%24)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a+b)>=24:
    print(a+b-24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
if A+B >=24:
  print(A+B-24)
else:
  print(A+B)

Submission status: Accepted

Solution code:
A, B = list(map(int, input().split()))
if A + B >= 24:
    print(A+B-24)
else:
    print(A+B)

Submission status: Accepted

Solution code:
# 入力　数字2つ
A, B = map(int, input().split())

C = A + B
if C < 24 :
    print(C)
else :
    print(C-24)

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
print((a+b) % 24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
C = A+B
if C<=23:
  print(C)
else:
  print(C-24)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if a[0] + a[1] >= 24:
  print(a[0] + a[1] -24)
else:
  print(a[0] + a[1])

Submission status: Accepted

Solution code:
a, b = [int(i) for i in input().split()]
if a+b >= 24:
    print(a+b-24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
if (x+y)>=23:
    print((x+y)%24)
else:
    print(x+y)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a + b > 24:
    print(a + b - 24)
elif a + b == 24:
    print(0)
else:
    print(a + b)

Submission status: Accepted

Solution code:
h, dh = map(int, input().split())
print((h + dh) % 24)

Submission status: Accepted

Solution code:
A, B = [int(i) for i in input().split()]
print((A+B) % 24)

Submission status: Accepted

Solution code:
A,B = list(map(int,input().split()))
ans = A + B
if ans >= 24:
    ans -= 24
print(ans)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A + B <= 23:
  print(A + B)
else:
  print((A + B) - 24)

Submission status: Accepted

Solution code:
def coder(a,b):
    if a + b < 24:
        return a + b
    else:
        return ((a + b) % 24)

def main():
    a , b = map(int, input().split())
    print(coder(a , b))

if __name__ == '__main__':
    main()

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
from bisect import bisect

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

A, B = MAP()

print(range(24)[(A+B)%24])

Submission status: Accepted

Solution code:
a, b = tuple(map(int, input().split()))

print((a+b)%24)

Submission status: Accepted

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


def main():
    A, B = map(int, input().split())
    print((A + B) % 24)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b<24:
    print(a+b)
elif a+b>=24:
    print(a+b-24)

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 31, Jan, 2020
"""

import sys
import itertools

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

A,B = map(int, readline().decode('utf8').split())

print((A+B)%24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

time_r = A + B
time = 0

if time_r >= 24:
    time = time_r - 24
else:
    time = time_r

print(time)

Submission status: Accepted

Solution code:
A, B = map(int,input().split())

if A + B >= 24:
    print(A + B - 24)
else:
    print(A + B)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a+b < 24:
    print(a+b)
else:
    print((a+b)-24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

a = A + B
if 23 < a:
    a = a - 24
    
print(a)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    a,b=MI()
    print((a+b)%24)
main()

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

ans = (A + B) % 24

print(ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b<=23:
    print(a+b)
else:
    print(a+b-24)

Submission status: Accepted

Solution code:
n,m = map(int,input().split())

print((n+m)%24)

Submission status: Accepted

Solution code:
arr = input().split()
arr = list(map(int,arr))

print((arr[0] + arr[1]) % 24)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
ab=a+b
if ab>=24:
    print(ab-24)
else:
    print(ab)

Submission status: Accepted

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

ans = a+b
if ans >= 24:
    ans -= 24
print(ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
res=a+b
if res<24:
  print(res)
else:
  print(res-24)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
A,B = [int(i) for i in input().split()]
print((A+B)%24)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())

ans = x + y

if ans > 23:
  print(ans%24)
else:
  print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ans = a + b
if ans >= 24:
    print(ans % 24)
else:
    print(ans)

Submission status: Accepted

Solution code:
A, B =map(int, input().split())
print((A+B)%24)

Submission status: Accepted

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

if a+b>=24:
    print(a+b-24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
ans = a + b if a + b < 24 else a + b - 24
print(ans)

Submission status: Accepted

Solution code:
x,y=list(map(int,input().split()))
if (x+y)>=24:
  print (x+y-24)
else:
  print (x+y)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
a,b=map(int,input().split())
print((a+b)%24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

print(int((A + B) % 24))

Submission status: Accepted

Solution code:
A, B = map(int, input().split())

print((A + B)%24)

Submission status: Accepted

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

if a + b >=  24:
	print( a + b - 24)
else:
	print(a + b)

Submission status: Accepted

Solution code:
print(sum(map(int, input().split()))%24)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(a+b if a+b<24 else (a+b)-24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
r = (A + B) % 24
print(int(r))

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
x = a+b
if x >= 24:
    x -= 24
print(x)

Submission status: Accepted

Solution code:
time = input().split()

time_i = [int(s) for s in time]

t = time_i[0] + time_i[1]

if(t <= 23):
    print(t)
else:
    print(t-24)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a+b < 24:
    print(a+b)
else:
    print(a+b-24)

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
if a+b>=24:
  print(a+b-24)
else:
  print(a+b)

Submission status: Accepted

Solution code:
N, M = map(int,input().split())

Answer = (N+M)%24

print(Answer)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a+b >=24:
	print((a+b)-24)
else:
	print(a+b)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a + b >= 24:
    print((a+b) - 24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
answer = A + B
mod = 24
print(answer % mod)

Submission status: Accepted

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

if a+b >=  24:
  print(a+b-24)
else:
  print(a+b)

Submission status: Accepted

Solution code:
x, y= list(map(int, input().split()))
#a,b,c = list(input().split())
if x+y < 24:
    print(x+y)
else:
    print(x+y-24)

Submission status: Accepted

Solution code:
a, b = (int(i) for i in input().split())
print((a+b)%24)

Submission status: Accepted

Solution code:
A, B = [int(s) for s in input().split()]

print((A + B) % 24)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
time=A+B
ans=time%24
print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
A, B = [int(x) for x in input().split()]
if A + B >= 24:
    print(A + B -24)
else:
    print(A + B)

Submission status: Accepted

Solution code:
a, b = map(lambda x: int(x), input().split())
print((a + b)%24)

Submission status: Accepted

Solution code:
a=sum(map(int,input().split()))
print(a if a<=23 else a-24)

Submission status: Accepted

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

a=(a+b)%24
print(a)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a + b >= 24:
    print(a+b-24)
else:
    print(a+b)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
sum=a+b
print(sum if sum<24 else sum-24)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
time=a+b
print(time if time<=23 else time-24)

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    a,b = map(int,input().split())
    x = a + b
    if x<24:
        print(x)
    else:
        print(x-24)
    return

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
A, B = list(map(int, input().split()))
print((A+B)%24)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ans = (a+b) % 24
print(ans)

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
print(a+b if a+b <= 23 else a+b-24)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a+b)>=24:
	print((a+b)-24)
else:
	print(a+b)

Submission status: Accepted

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

print((a+b)%24)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
n=a+b
if n>=24:
  n+=(-24)
print(n)

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
if (a+b)<24:
    print(a+b)
else:
    print(a+b-24)

Submission status: Accepted

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

print(a+b if a+b<24 else a+b-24)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf')
ans = 0 ;count = 0 ;pro = 1

a,b=map(int,input().split())
print((a+b)%24)