Submission #3224027
Source Code Expand
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def main():
A, B = map(int, input().split())
print((A + B) % 24)
if __name__ == '__main__':
main()
Submission Info
Submission Time |
|
Task |
A - Remaining Time |
User |
MitI_7 |
Language |
Python (3.4.3) |
Score |
100 |
Code Size |
782 Byte |
Status |
AC |
Exec Time |
27 ms |
Memory |
3948 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
27 ms |
3948 KB |
sample_02.txt |
AC |
27 ms |
3948 KB |
sample_03.txt |
AC |
27 ms |
3944 KB |
subtask_1_1.txt |
AC |
27 ms |
3948 KB |
subtask_1_2.txt |
AC |
27 ms |
3944 KB |
subtask_1_3.txt |
AC |
27 ms |
3948 KB |
subtask_1_4.txt |
AC |
27 ms |
3948 KB |
subtask_1_5.txt |
AC |
27 ms |
3944 KB |
subtask_1_6.txt |
AC |
27 ms |
3944 KB |
subtask_1_7.txt |
AC |
27 ms |
3948 KB |