python-algorithm1422 [백준] 20673 1 2 3 4 5 p=int(input()) q=int(input()) if p 2021. 3. 12. [백준] 20499 1 2 3 k,d,a=map(int, input().split('/')) if k+a 2021. 3. 12. [백준] 3507 1 2 3 ate=int(input()) if ate>198: print(0) else: print(199-ate) cs 2021. 3. 11. [백준] 2975 1 2 3 4 5 6 7 8 while 1: a,b,c=input().split() a,c=int(a),int(c) if a == 0 and c == 0: break s=a-c if b!='W': s=a+c if s 2021. 3. 11. [백준] 20353 1 2 import math print( math.sqrt(int(input()))*4) cs 2021. 3. 11. [백준] 20233 1 2 3 4 5 6 7 8 9 10 a=int(input()) x=int(input()) b=int(input()) y=int(input()) t=int(input()) if t>30: ans= a+((t-30)*x)*21 else: ans=a if t>45: ans2= b+((t-45)*y)*21 else: ans2=b print(ans, ans2) cs 2021. 3. 11. [백준] 20232 1 2 3 4 5 6 7 8 9 10 11 12 winners=[] for i in range(25): winners.append('ITMO') winners[1]='SPbSU' winners[2]='SPbSU' winners[5]='SPbSU' winners[11]='PetrSU, ITMO' winners[12]='SPbSU' winners[13]='SPbSU' winners[23]='SPbSU' winners[18]='SPbSU' n=int(input())-1995 print(winners[n]) cs 2021. 3. 9. [백준] 19602 1 2 3 4 5 6 a=int(input()) b=int(input()) c=int(input()) ans=a+2*b+3*c if ans 2021. 3. 9. [백준] 18414 1 2 3 4 da,b,c=map(int,input().split()) if b 2021. 3. 9. [백준] 18411 1 2 tmp=sorted(list(map(int, input().split()))) print(sum(tmp[1:3])) cs 2021. 3. 9. [백준] 18408 1 2 3 tmp=list(map(int, input().split())) if sum(tmp)/3>1.6: print(2) else: print(1) cs 숫자를 카운팅해도 되고 저처럼 합으로 해도 구현되구요 2021. 3. 9. [백준] 18330 1 2 3 4 5 n=int(input()) k=int(input())+60 if n 2021. 3. 8. 이전 1 ··· 73 74 75 76 77 78 79 ··· 119 다음
