๐Ÿงฉ Algorithm/SWEA

[SWEA] 1948. ๋‚ ์งœ ๊ณ„์‚ฐ๊ธฐ (Python/D2)

devCloud 2024. 10. 18. 22:02
728x90

[๋ฌธ์ œ ๋งํฌ] ๐Ÿ‘‡

 

SW Expert Academy

SW ํ”„๋กœ๊ทธ๋ž˜๋ฐ ์—ญ๋Ÿ‰ ๊ฐ•ํ™”์— ๋„์›€์ด ๋˜๋Š” ๋‹ค์–‘ํ•œ ํ•™์Šต ์ปจํ…์ธ ๋ฅผ ํ™•์ธํ•˜์„ธ์š”!

swexpertacademy.com

 

 

Solution

test_case = int(input())
for tc in range(1, test_case + 1):
    month1, day1, month2, day2 = map(int, input().split())
    days = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
    sum = 0
    month = month2 - month1
    day = 1
    if (month1 == month2):
        day += day2 - day1
    else:
        for i in range(month1 + 1, month2): 
            day += days[i]
        day += days[month1] - day1 + day2
    print("#%d %d" %(tc, day))

 

 

๐Ÿ‘ฉ‍๐Ÿ’ป ํšŒ๊ณ 

๋‹ค์‹œ ํ’€์–ด๋ด์•ผ ํ•  ๋ฌธ์ œ


 

728x90