problem_id
stringlengths 8
8
| id
int64 107k
56M
| submission_code
stringlengths 13
515k
|
|---|---|---|
abc057_a | 4,762,451 | a,b=map(int,input().split())
print((a+b)%24)
|
abc057_a | 1,183,083 | a,b=map(int,input().split())
print((a+b)%24)
|
abc057_a | 6,211,963 | x,y=map(int,input().split())
print((x+y)%24) |
abc057_a | 1,180,859 | a, b = map(int, raw_input().split())
print (a + b) % 24
|
abc057_a | 25,821,704 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 4,647,033 | a,b=map(int,input().split());print((a+b)%24) |
abc057_a | 4,818,341 | A,B=map(int,input().split())
print((A+B)%24)
|
abc057_a | 4,796,066 | #!usr/bin/env python3
from collections import defaultdict
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
a,b = LI()
print((a+b)%24)
#B
#C
"""
n = I()
ans = int(math.log10(n)+1)
for i in range(2,int(n**0.5)+1):
if n%i == 0:
ans = min(ans, max(int(math.log10(i)+1),int(math.log10(n//i)+1)))
print(ans)
"""
#D
"""
n,a,b = LI()
v = LI()
v.sort()
v = v[::-1]
ans = v[:a]
d = {}
d[ans[-1]] = 0
if ans[0] != ans[-1]:
for i in ans:
if i == ans[-1]:
d[i] += 1
k = d[i]
d[i] = 0
for i in v:
if i == ans[-1]:
d[i] += 1
c = 1
for j in range(min(k,d[ans[-1]]-k)):
c *= d[ans[-1]]-j
c //= j+1
else:
for i in v:
if i == ans[-1]:
d[i] += 1
c = 0
for k in range(a,min(d[ans[-1]],b)+1):
p = 1
for j in range(min(k,d[ans[-1]]-k)):
p *= d[ans[-1]]-j
p //= j+1
c += p
print(sum(ans)/a)
print(c)
"""
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
|
abc057_a | 16,268,939 | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
A,B = MI()
print((A+B) % 24)
|
abc057_a | 5,205,928 | A,B = map(int,input().split())
print((A+B)%24) |
abc057_a | 5,288,173 | a,b=map(int,input().split());print((a+b)%24) |
abc057_a | 4,362,023 | a,b=map(int, input().split())
print(a+b if a+b < 24 else a+b-24) |
abc057_a | 5,446,264 | a, b = input().split()
a, b = int(a), int(b)
print((a+b)%24) |
abc057_a | 20,246,352 | a,b = map(int,input().split())
print((a+b)%24) |
abc057_a | 3,817,198 | print(sum(list(map(int, input().split())))%24) |
abc057_a | 10,696,110 | A,B=map(int,input().split())
print((A+B)%24)
|
abc057_a | 6,033,438 | a, b = map(int, input().split())
print((a+b)%24) |
abc057_a | 7,722,886 | a,b = map(int,input().split())
print((a + b) % 24) |
abc057_a | 7,197,830 | A, B = map(int, input().split())
print((A + B) % 24)
|
abc057_a | 8,290,077 | a, b = map(int, input().split())
print((a+b)%24) |
abc057_a | 8,969,241 | a,b = map(int,input().split())
print((a+b)%24) |
abc057_a | 8,444,827 | A, B = map(int, input().split())
print((A+B)%24) |
abc057_a | 6,309,038 |
A,B = map(int,input().split())
print ((A+B) % 24 )
|
abc057_a | 11,207,994 | import math
a,b=map(int,input().split())
print((a+b)%24)
|
abc057_a | 9,148,133 | A, B = list(map(int, input().split()))
print((A+B)%24) |
abc057_a | 4,277,326 | a, b = map(int, input().split())
print((a+b)%24) |
abc057_a | 9,649,438 | a, b = map(int, input().split())
print((a + b) % 24) |
abc057_a | 9,797,381 | 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() |
abc057_a | 9,830,581 | A, B = map(int, input().split())
print((A+B)%24) |
abc057_a | 14,861,137 | a,b = map(int,input().split())
x = (a+b)%24
print(x)
|
abc057_a | 8,218,361 | A, B = map(int, input().split())
print((A + B) % 24) |
abc057_a | 15,667,158 | a,b=map(int,input().split())
print((a+b)%24)
|
abc057_a | 14,875,936 | A, B = map(int, input().split())
print((A + B) % 24) |
abc057_a | 11,485,239 | a,b = map(int,input().split())
print((a+b)%24) |
abc057_a | 12,019,769 | a, b = map(int, input().split())
print((a + b) % 24) |
abc057_a | 13,392,223 | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
def main():
A,B=map(int,input().split())
print((A+B)%24)
if __name__ == '__main__':
main()
|
abc057_a | 12,676,838 | a,b=map(int,input().split())
print((a+b)%24)
|
abc057_a | 14,216,786 | a,b = map(int,input().split())
print((a+b)%24) |
abc057_a | 16,440,466 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 13,646,827 | a, b = map(int, input().split())
print((a + b) % 24) |
abc057_a | 13,762,820 | a, b = map(int, input().split())
if a + b < 24:
print(a + b)
else:
print(a + b - 24)
|
abc057_a | 15,800,394 | A,B=map(int,input().split())
print((A+B)%24) |
abc057_a | 14,472,514 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 16,630,228 | print(sum(map(int,input().split()))%24)
|
abc057_a | 15,361,696 | a,b=map(int,input().split())
ans=(a+b)%24
print(ans) |
abc057_a | 16,079,425 | a, b = map(int, input().split())
print((a + b) % 24) |
abc057_a | 21,869,734 | a,b=map(int,input().split())
if a+b<=23:
print(a+b)
else:
print(a+b-24) |
abc057_a | 20,571,520 | A,B = map(int,input().split())
print((A+B)%24) |
abc057_a | 18,227,751 | A,B=map(int,input().split())
print((A+B)%24) |
abc057_a | 17,323,895 | import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
def solve():
a, b = inl()
return (a + b) % 24
print(solve())
|
abc057_a | 18,489,924 | A,B=map(int,input().split())
print((A+B)%24) |
abc057_a | 18,645,160 | from sys import stdin
from functools import reduce
import itertools
import math
# = int(stdin.readline().rstrip())
# = [int(x) for x in stdin.readline().rstrip().split()]
# = stdin.readline().rstrip()
# = [x for x in stdin.readline().rstrip().split()]
a, b = [int(x) for x in stdin.readline().rstrip().split()]
print((a+b)%24)
|
abc057_a | 5,183,958 | a,b = map(int,input().split())
ans = (a+b)%24
print(ans) |
abc057_a | 24,172,419 | A,B = map(int,input().split())
start = A+B
if(start >= 24):
print(start-24)
else:
print(start) |
abc057_a | 19,928,526 | #!/Users/amitani/Library/PyPy/pypy3.6-v7.3.0-osx64/bin/pypy3
import sys
def solve(A: int, B: int):
print((A + B)% 24)
return
# Generated by 1.1.7.1 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()
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
solve(A, B)
if __name__ == '__main__':
main()
|
abc057_a | 20,994,963 | a, b = map(int, input().split())
a += b
a %= 24
print(a) |
abc057_a | 24,212,557 | import sys
import math
from collections import deque,Counter
#sys.setrecursionlimit(10**7)
int1=lambda x: int(x)-1
inp=lambda :int(input())
mi=lambda :map(int,input().split())
li=lambda :list(mi())
mi1=lambda :map(int1,input().split())
li1=lambda :list(mi1())
mis=lambda :map(str,input().split())
lis=lambda :list(mis())
pr=print
from collections import defaultdict
"""
#初期値 0
d=defaultdict(int)
#初期値 1
d=defaultdict(lambda:1)
"""
mod=10**9+7
Mod=998244353
INF=10**18
ans=0
a,b=mi()
print((a+b)%24) |
abc057_a | 2,624,904 | a, b = [int(i) for i in input().split()]
print((a + b) % 24) |
abc057_a | 2,623,782 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 24,264,260 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 33,511,247 | print(sum(list(map(int,input().split())))%24) |
abc057_a | 28,644,090 | a, b = map(int, input().split())
print((a+b)%24) |
abc057_a | 26,384,770 | a, b = map(int,input().split())
print((a+b)%24) |
abc057_a | 1,188,647 | time = list(map(int, input().split()))
print((time[0] + time[1]) % 24)
|
abc057_a | 24,472,950 | A, B = map(int, input().split())
print((A + B) % 24) |
abc057_a | 23,632,791 | a, b = map(int, input().split())
print((a + b) % 24) |
abc057_a | 26,557,985 | print(sum(map(int, input().split())) % 24) |
abc057_a | 25,070,199 | print(sum(map(int,input().split()))%24) |
abc057_a | 26,887,165 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 27,028,587 | a,b = map(int,input().split())
print((a+b)%24) |
abc057_a | 4,654,688 | a,s=map(int,input().split())
print((a+s)%24) |
abc057_a | 27,500,851 | a, b = map(int, input().split())
print((a + b) % 24) |
abc057_a | 29,405,118 | a, b = map(int, input().split())
a += b
a %= 24
print(a)
|
abc057_a | 29,405,555 | import sys
input = sys.stdin.readline
def iinput(): return int(input())
def sinput(): return input().rstrip()
def i0input(): return int(input()) - 1
def linput(): return list(input().split())
def liinput(): return list(map(int, input().split()))
def miinput(): return map(int, input().split())
def li0input(): return list(map(lambda x: int(x) - 1, input().split()))
def mi0input(): return map(lambda x: int(x) - 1, input().split())
INF = 10**20
MOD = 1000000007
a, b = liinput()
ans = a + b
if ans >= 24:
ans -= 24
print(ans) |
abc057_a | 27,952,196 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 27,951,392 | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def IR(n):
return [I() for _ in range(n)]
def LIR(n):
return [LI() for _ in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def main():
a,b = LI()
a += b
print(a%24)
return
if __name__ == "__main__":
main()
|
abc057_a | 33,849,097 | import sys
input = sys.stdin.readline
def iinput(): return int(input())
def sinput(): return input().rstrip()
def i0input(): return int(input()) - 1
def linput(): return list(input().split())
def liinput(): return list(map(int, input().split()))
def miinput(): return map(int, input().split())
def li0input(): return list(map(lambda x: int(x) - 1, input().split()))
def mi0input(): return map(lambda x: int(x) - 1, input().split())
INF = 10**20
MOD = 1000000007
a, b = miinput()
print((a + b) % 24) |
abc057_a | 25,464,718 | print(eval(input().replace(' ','+'))%24) |
abc057_a | 29,826,092 | a, b = map(int, input().split())
print((a+b)%24) |
abc057_a | 29,845,979 | A,B=map(int,input().split())
print((A+B)%24) |
abc057_a | 32,286,392 | import sys
input = sys.stdin.readline
def iinput(): return int(input())
def sinput(): return input().rstrip()
def i0input(): return int(input()) - 1
def linput(): return list(input().split())
def liinput(): return list(map(int, input().split()))
def miinput(): return map(int, input().split())
def li0input(): return list(map(lambda x: int(x) - 1, input().split()))
def mi0input(): return map(lambda x: int(x) - 1, input().split())
INF = 10**20
MOD = 1000000007
A, B = liinput()
print((A + B) % 24) |
abc057_a | 38,356,406 | a,b = map(int,input().split())
print((a+b)%24) |
abc057_a | 32,810,145 | a, b = map(int, input().split())
print((a+b)%24) |
abc057_a | 30,193,834 | A,B = map(int,input().split())
print((A+B)%24) |
abc057_a | 7,722,883 | a,b = map(int,input().split())
print((a + b) % 24) |
abc057_a | 10,206,494 | a,b = map(int,input().split())
print((a+b)%24) |
abc057_a | 39,217,701 | print(sum(map(int, input().split())) % 24) |
abc057_a | 39,299,303 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 34,319,050 | def main():
from sys import stdin, setrecursionlimit
# setrecursionlimit(1000000)
input = stdin.readline
def iinput(): return int(input())
def sinput(): return input().rstrip()
def i0input(): return int(input()) - 1
def linput(): return list(input().split())
def liinput(): return list(map(int, input().split()))
def miinput(): return map(int, input().split())
def li0input(): return list(map(lambda x: int(x) - 1, input().split()))
def mi0input(): return map(lambda x: int(x) - 1, input().split())
INF = 1000000000000000000
MOD = 1000000007
print(sum(liinput()) % 24)
main() |
abc057_a | 39,815,286 | A,B=map(int,input().split())
print((A+B)%24) |
abc057_a | 42,044,803 | print(sum(list(map(int,input().split())))%24) |
abc057_a | 45,098,928 | import random
import sys
# sys.setrecursionlimit(10**8)设置最大递归次数
class FastIO:
def __init__(self):
return
@staticmethod
def read_int():
return int(sys.stdin.readline().strip())
@staticmethod
def read_float():
return float(sys.stdin.readline().strip())
@staticmethod
def read_ints():
return map(int, sys.stdin.readline().strip().split())
@staticmethod
def read_floats():
return map(float, sys.stdin.readline().strip().split())
@staticmethod
def read_ints_minus_one():
return map(lambda x: int(x) - 1, sys.stdin.readline().strip().split())
@staticmethod
def read_list_ints():
return list(map(int, sys.stdin.readline().strip().split()))
@staticmethod
def read_list_floats():
return list(map(float, sys.stdin.readline().strip().split()))
@staticmethod
def read_list_ints_minus_one():
return list(map(lambda x: int(x) - 1, sys.stdin.readline().strip().split()))
@staticmethod
def read_str():
return sys.stdin.readline().strip()
@staticmethod
def read_list_strs():
return sys.stdin.readline().strip().split()
@staticmethod
def read_list_str():
return list(sys.stdin.readline().strip())
@staticmethod
def st(x):
return sys.stdout.write(str(x) + '\n')
@staticmethod
def lst(x):
return sys.stdout.write(" ".join(str(w) for w in x) + '\n')
@staticmethod
def round_5(f):
res = int(f)
if f - res >= 0.5:
res += 1
return res
@staticmethod
def max(a, b):
return a if a > b else b
@staticmethod
def min(a, b):
return a if a < b else b
@staticmethod
def ceil(a, b):
return a // b + int(a % b != 0)
def ask(self, lst):
# CF交互题输出询问并读取结果
self.lst(lst)
sys.stdout.flush()
res = self.read_int()
# 记得任何一个输出之后都要 sys.stdout.flush() 刷新
return res
def out_put(self, lst):
# CF交互题输出最终答案
self.lst(lst)
sys.stdout.flush()
return
@staticmethod
def accumulate(nums):
n = len(nums)
pre = [0] * (n + 1)
for i in range(n):
pre[i + 1] = pre[i] + nums[i]
return pre
@staticmethod
def get_random_seed():
# 随机种子避免哈希冲突
return random.randint(0, 10 ** 9 + 7)
class Solution:
def __init__(self):
return
@staticmethod
def main(ac=FastIO()):
a, b = ac.read_ints()
ac.st((a+b)%24)
return
Solution().main()
|
abc057_a | 7,029,132 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 43,331,925 | print(sum(list(map(int,input().split())))%24) |
abc057_a | 46,034,446 | a,b=map(int,input().split())
print((a+b)%24) |
abc057_a | 19,842,690 | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())
A,B = MI()
print((A+B) % 24)
|
abc057_a | 34,824,523 | a,b=map(int,input().split());print((a+b)%24) |
abc057_a | 23,662,561 | a, b = map(int, input().split())
print((a + b) % 24) |
abc057_a | 1,243,998 |
a, b = map(int, input().split(" "));
print( (a+b) % 24);
|
abc057_a | 1,180,829 | import sys
stdin = sys.stdin
def na(): return map(int, stdin.readline().split())
def ns(): return stdin.readline().strip()
a,b = na()
print((a+b)%24) |