Submission #579497

Source Code Expand

def solve():
    n, m = map(int, input().split())

    #12時の位置に対し、長針、短針がなす角をl, sとする
    #l, sの差の絶対値を求め、それを360度から引いた値と比べて小さい値を返す

    s = 360/60 * m
    n = n % 12
    l =  360/12 * n + 30/60 * m

    d = abs(s-l)
    return min(d, 360-d)
    
if __name__ == "__main__":
    print(solve())

Submission Info

Submission Time
Task B - 時計盤
User junk
Language Python (3.4.2)
Score 100
Code Size 408 Byte
Status AC
Exec Time 131 ms
Memory 6820 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 35
Set Name Test Cases
Sample subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt
All 0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 30.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt
Case Name Status Exec Time Memory
0.txt AC 131 ms 6800 KiB
1.txt AC 95 ms 6688 KiB
10.txt AC 92 ms 6684 KiB
11.txt AC 94 ms 6820 KiB
12.txt AC 100 ms 6688 KiB
13.txt AC 102 ms 6688 KiB
14.txt AC 99 ms 6788 KiB
15.txt AC 92 ms 6816 KiB
16.txt AC 93 ms 6696 KiB
17.txt AC 100 ms 6692 KiB
18.txt AC 92 ms 6692 KiB
19.txt AC 90 ms 6692 KiB
2.txt AC 89 ms 6688 KiB
20.txt AC 99 ms 6680 KiB
21.txt AC 96 ms 6692 KiB
22.txt AC 92 ms 6684 KiB
23.txt AC 91 ms 6688 KiB
24.txt AC 90 ms 6688 KiB
25.txt AC 98 ms 6720 KiB
26.txt AC 94 ms 6692 KiB
27.txt AC 92 ms 6692 KiB
28.txt AC 93 ms 6820 KiB
29.txt AC 99 ms 6688 KiB
3.txt AC 92 ms 6688 KiB
30.txt AC 94 ms 6692 KiB
4.txt AC 95 ms 6808 KiB
5.txt AC 95 ms 6732 KiB
6.txt AC 95 ms 6792 KiB
7.txt AC 95 ms 6688 KiB
8.txt AC 93 ms 6692 KiB
9.txt AC 93 ms 6684 KiB
subtask0_1.txt AC 100 ms 6724 KiB
subtask0_2.txt AC 96 ms 6692 KiB
subtask0_3.txt AC 97 ms 6672 KiB
subtask0_4.txt AC 93 ms 6692 KiB