Submission #1868394


Source Code Expand

import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache, reduce
from operator import xor
INF = float("inf")
sys.setrecursionlimit(10**7)

# 4近傍(右, 下, 左, 上)
dy4, dx4 = [0, -1, 0, 1], [1, 0, -1, 0]


def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W


def main():
    n, a, b = map(int, input().split())
    k = a + b - n
    print(max(0, k))


if __name__ == '__main__':
    main()

Submission Info

Submission Time
Task A - 動画検索
User MitI_7
Language Python (3.4.3)
Score 100
Code Size 722 Byte
Status AC
Exec Time 27 ms
Memory 3956 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 12
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, hand_01.txt, hand_02.txt, hand_03.txt, random_01.txt, random_02.txt, random_03.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
hand_01.txt AC 27 ms 3956 KB
hand_02.txt AC 26 ms 3956 KB
hand_03.txt AC 26 ms 3956 KB
random_01.txt AC 26 ms 3952 KB
random_02.txt AC 26 ms 3952 KB
random_03.txt AC 26 ms 3956 KB
sample_01.txt AC 26 ms 3956 KB
sample_02.txt AC 26 ms 3952 KB
sample_03.txt AC 26 ms 3952 KB