python-algorithm1422 [백준] 16204 1 2 N,M,K=map(int,input().split()) print(min(M,K)+min(N-M,N-K)) cs 2020. 12. 17. [백준] 15921 1 2 3 4 5 n=int(input()) if n==0: print("divide by zero") else: print("1.00") cs 2020. 12. 16. [백준] 15873 1 2 3 4 5 6 7 8 9 10 a=input() if len(a)==2: print(int (a[0])+int (a[1])) elif len(a)==3: if int (a[-1])==0: print(10+int (a[0])) else: print(10+int(a[-1])) else: print(20) cs 2020. 12. 16. [백준] 15726 1 2 a,b,c=map(int, input().split()) print(max(int (a*b/c),int(a/b*c))) cs 2020. 12. 16. [백준] 15700 1 2 a,b=map(int, input().split()) print(a*b//2) cs 2020. 12. 16. [백준] 15680 1 2 3 N=int(input()) if N==0: print("YONSEI") else : print("Leading the Way to the Future") cs 2020. 12. 16. [백준] 14924 1 2 a,b,c=map(int, input().split()) print( int ((c/ (2*a))*b)) cs 2020. 12. 16. [백준] 14681 1 2 3 4 5 6 a = int(input()) b=int (input()) if a>0 and b>0 : print(1) if a>0 and b 2020. 12. 16. [백준] 14623 1 2 3 a=int(input(),2) b=int(input(),2) print (bin(a*b)[2:]) cs 2020. 12. 16. [백준] 14470 1 2 3 4 5 6 7 8 9 10 a=int(input()) b=int(input()) c=int(input()) d=int(input()) e=int(input()) if a 2020. 12. 16. [백준] 13866 1 2 a,b,c,d=map(int,input().split()) print(abs( a+b+c+d-(max(a,b,c,d))*2-(min(a,b,c,d))*2)) cs 2020. 12. 16. [백준] 11948 1 2 3 4 5 6 7 a=int(input()) b=int(input()) c=int(input()) d=int(input()) e=int(input()) f=int(input()) print(max(a+b+c,a+b+d,a+c+d,b+c+d)+max(e,f)) cs 2020. 12. 16. 이전 1 ··· 112 113 114 115 116 117 118 119 다음
[백준] 13866
1 2 a,b,c,d=map(int,input().split()) print(abs( a+b+c+d-(max(a,b,c,d))*2-(min(a,b,c,d))*2)) cs
2020. 12. 16.
