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:
x,y = map(int, input().split())
print((x+y)%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)%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:
x,y = map(int,input().split())
print((x+y)%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 > 23:
  print(a-24+b)
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())
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)

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if A+B>=24:
  print(A+B-24)
elif A+B<24:
  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())
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)%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 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())
t = a + b
if t >= 24:
    print(t - 24)
else:
    print(t)

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:
from sys import stdin
inp = lambda : stdin.readline().strip()

a, b = [int(x) for x in inp().split()]
print((a+b)%24)

Submission status: Accepted

Solution code:
print(sum(map(int,input().split()))%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:
a, b = input().split()

if int(a) + int(b) < 24:
    print(int(a) + int(b))
elif int(a) + int(b) >= 24:
    print(int(a) + int(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:

def main():
    a, b = list(map(int, input().split()))
    ans = a + b
    if ans >= 24:
        print((24-ans)*-1)
    else:
        print(ans)



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

    ans = a + b
    if ans >= 24:
        ans -= 24

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys


# \n
def input():
    return sys.stdin.readline().rstrip()


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Remaining Time 
def main():
    a, b = map(int, input().split())

    if a+b < 24:
        print(a+b)
    else:
        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:
# 057_a
A, B = map(int, input().split())

if (0 <= A & A <= 23) & (0 <= B & B <= 23):
    if (A + B) > 24:
        print((A + B) - 24)
    elif (A + B) == 24:
        print(0)
    else:
        print(A + B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    A, B = map(int, 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())

ans = a + b;

if ans >= 24:
    ans = ans - 24

print(ans)

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 if a+b < 24 else 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 - Remaining Time
# https://atcoder.jp/contests/abc057/tasks/abc057_a

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

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

print(result)

Submission status: Accepted

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


print((a+b)%24)

Submission status: Accepted

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

b=a[0]+a[1]
if b>=24:
  b-=24

print(b)

Submission status: Accepted

Solution code:
# 現在A時、B時間後に始まるコンテストの開始時刻

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

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

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

# 処理
start = A + B
if start >= 24:
    print(start - 24)
else:
    print(start)

Submission status: Accepted

Solution code:
# A - Remaining Time

# 現在時刻はA時で、コンテストはB時間後に始まる
# コンテストの開始時刻は、24時間表記で何時か？


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

answer = A + B

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

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

print((a + b) % 24)

Submission status: Accepted

Solution code:
# イルカはプログラミングコンテスト好きで、今日はAtCoderのコンテストに参加します。
# 現在時刻は、24時間表記(0:00〜23:59)でA時ちょうどであり、コンテストがちょうどB時間後に始まります。
# コンテストの開始時刻は、24時間表記で何時ちょうどでしょうか?

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:
#
# abc057 a
#
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """9 12"""
        output = """21"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """19 0"""
        output = """19"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """23 2"""
        output = """1"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

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

# 24時間表記に合わせて出力
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:
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())

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

Submission status: Accepted

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

if A + B < 24:
    print(A + B)
if A + B >= 24:
    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())

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:
    w = 0
elif A + B > 24:
    w = abs(24 - (A + B))
else:
    w = A + B


print(w)

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,a+b-24][a+b>=24])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 各数値の取得
A,B = map(int,input().split())

# 開始時間の計算と出力
start = A + B
if start < 24:
    print(start)
else:
    start = start - 24
    print(start)

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:
#   AtCoder abc057 a
#   ストレッチ課題

#   入力
a, b = map(int, input().split())

#   処理
if (a + b) >= 24:
    answer = (a + b) - 24
else:
    answer = a + b
print(answer)

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:
S_list = list(map(int,input().split()))
ans = S_list[0] + S_list[1]
if  ans <24 :
    result = ans
else:
    result = ans - 24
print(result)

Submission status: Accepted

Solution code:
# 057a

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

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

Submission status: Accepted

Solution code:
# イルカはプログラミングコンテスト好きで、今日はAtCoderのコンテストに参加します。
# 現在時刻は、24時間表記(0:00 〜23:59) で A時ちょうどであり、
# コンテストがちょうど B時間後に始まります。
# コンテストの開始時刻は、24時間表記で何時ちょうどでしょうか?

# 制約
# 0 ≦ A, B ≦ 23
# A, B は整数である。

# 標準入力から A時、B時を取得する
hour_a,hour_b = map(int,input().split())

# コンテストの開始時間を計算し出力する
contest_start_hour = 0  # コンテスト開始時間

contest_start_hour = hour_a + hour_b

if contest_start_hour >= 24:    # 日付変わってるよ～
    contest_start_hour -= 24

print(contest_start_hour)

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:
a,b = map(int,input().split())
b += a
if b>23:
    print(b-24)
else:
    print(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)
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:
def solve():
    A, B = map(int, input().split())
    print((A + B) % 24)


if __name__ == "__main__":
    solve()

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を整数で入力
a,b = map(int,input().split())
# a+bが24以上なら-24して表示
start_time = a + b
if start_time >=24:
    print(start_time - 24)
# a+bが24より小さければそのまま表示
else:
    print(start_time)

Submission status: Accepted

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

Submission status: Accepted

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

total_time= a + b

# 処理&出力
if total_time >= 24:
    answer = (total_time) % 24
elif a+b < 24:
    answer = total_time

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Remaining Time

# 現在の時刻は、24時間表記（0:00 ~ 23:59）で A時 ちょうど
# コンテストはちょうど B 時間後に始まる

# コンテストの開始時刻は、24時間表記で何時ちょうどですか？

# A B を標準入力から得る
A, B = map(int, input().split())
# print(A, B)

# A + B が24を超えた場合、 (A + B) - 24 を行う必要がある。

# (A + B) % 24 ⇔ (A + B) を 24 で 割った余りを表示
# こうすることで、24以上の時も同様に表示できる

answer = (A + B) % 24

# 結果を出力
print(answer)

Submission status: Accepted

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

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

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())
 
if A+B>=24:
  print(A+B-24)
else:
  print(A+B)

Submission status: Accepted

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

time = A + B

if time < 24:
    print(time)
else:
    print(time - 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:
current_time, remain_hour = map(int, input().split())

start_time = current_time + remain_hour

if start_time >= 24:
    start_next_day_time = start_time - 24
    print(start_next_day_time)
else:
    print(start_time)

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:
# coding = SJIS

a, b = map(int,input().split())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
A, B = map(int, input().split())
ans = (A + B) % 24
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = (int(T) for T in 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 = input().split()
a = int(a)
b = int(b)
print((a+b)%24)

Submission status: Accepted

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

def main():
    a, b = map(int, input().split())
    val = a + b
    if val >= 24: val -= 24
    print(val)


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())
print((a+b)%24)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y = map(int, input().split())
import math
print(math.ceil((x+y)%24))

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    a, b = i_map()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

t = a + b

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

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print((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:
print(sum(map(int, input().split())) % 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:
a,b=map(int,input().split())
if a+b<24:
  print(a+b)
else:
  print(a+b-24)

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


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:
print(eval(input().replace(" ","+"))%24)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = 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)
else:
  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:
# # 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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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


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


def solve():
    A, B = read_ints()
    return (A+B)%24


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

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:
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)
else:
    print(a + b - 24)

Submission status: Accepted

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

def main():

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

    ans = (A + B) % 24

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b= input().split()
a,b=int(a),int(b)
if a+b <24:
    print(a+b)
elif a+b>=24:
    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)

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():
    A, B = map(int, readline().split())

    print((A + B) % 24)

    return


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())
ans=(a+b)%24
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(0)
elif a + b > 24:
    print(a + b - 24)
else:
    print(a + b)

Submission status: Accepted

Solution code:
import itertools,collections
def main():
    a,b=map(int, input().split())
    if(a+b>23):
        print(abs(24-(a+b)))
    else:
        print(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 = list(map(int, input().split()))
b = a[0] + a[1]
print(b if b < 24 else b-24)

Submission status: Accepted

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

print(a[0]+a[1] if a[0]+a[1] < 24 else a[0]+a[1]-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().rstrip().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())
c = a+b
if c >=24:
  c += -24
print(c)

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

A,B = I()
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 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())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B=map(int, 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-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=[int(i) for i in input().split()]


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

Submission status: Accepted

Solution code:
print(sum(list(map(int,input().split())))%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)
else:
  print(a+b-24)

Submission status: Accepted

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

c = a + b 

if c < 24:
    print(c)
elif c == 24:
    print('0')
else:
    print(c-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())
print(x+y if (x+y) < 24 else x+y-24)

Submission status: Accepted

Solution code:
print(eval(input().replace(*' +'))%24)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = input().split(" ")
h = int(a)+int(b)
if h>= 24:
    print(h -24)
else:
    print(h)

Submission status: Accepted

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

time = (a+b)%24

print(time)

Submission status: Accepted

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

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:
#入力
lst = input().split()

time = int(lst[0]) + int(lst[1])

if 24 <= time:
   time = time - 24

#出力
print(time)

Submission status: Accepted

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

Submission status: Accepted

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

print((N+M)%24)

Submission status: Accepted

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

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

Submission status: Accepted

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

print((A+B)%24) #剰余

Submission status: Accepted

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

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():
    A, B = map(int, input().split())

    print(A + B) if A + B < 24 else 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)
else:
	print(a+b-24)

Submission status: Accepted

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

st12 = A + B

if (st12 < 24):
    print(st12)

elif (st12 >= 24):
    st0 = st12 - 24
    print(st0)

Submission status: Accepted

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

a, b = map(int, input().split())

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

Submission status: Accepted

Solution code:
def actual(A, B):
    return (A + B) % 24

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
A,B = map(int,input().split())
if A < 0 or A > 24 or B < 0 or B > 24:
    sys.exit()

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

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())
ans = (A+B)%24

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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)

A, B = mapint()
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=sum(list(map(int,input().split())));print(n-24 if n>=24 else n)