181742025-10-09 17:45:32birozsÁtvágás (75 pont)python3Accepted 75/75432ms7128 KiB
N = int(input())
T = [0] * (N+1)
for i in range(N-1):
    A,B = map(int,input().split())
    T[A] += 1
    T[B] += 1
print(T.count(1)-2,end=" ")
print(N-max(T)-1)
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/016ms2868 KiB
2Accepted0/016ms3064 KiB
3Accepted0/037ms3116 KiB
4Accepted4/416ms3064 KiB
5Accepted4/416ms2968 KiB
6Accepted4/416ms3076 KiB
7Accepted4/416ms3016 KiB
8Accepted4/416ms3048 KiB
9Accepted4/416ms2924 KiB
10Accepted4/4400ms6196 KiB
11Accepted4/4414ms6560 KiB
12Accepted4/4428ms6960 KiB
13Accepted4/4409ms7084 KiB
14Accepted4/4409ms7096 KiB
15Accepted4/4423ms6964 KiB
16Accepted4/4409ms6964 KiB
17Accepted4/4419ms7060 KiB
18Accepted5/5425ms6964 KiB
19Accepted6/6432ms7128 KiB
20Accepted6/6409ms6964 KiB
21Accepted2/216ms2996 KiB