목록백준 (7)
Head vs breakz
[code] - 백준 수학 1193,2869,10250,2775,1712,2839,2292 python
1193 #1193 a = int(input()) count = 0 while (a > count) : a -= count count += 1 c = str((count+1)-a) d = str(a) if count%2 == 0 : print(d+"/"+c) elif count%2 != 0: print(c+"/"+d) 2869 #2869 import sys a, b, c = map(int, sys.stdin.readline().split()) print((c-b-1)//(a-b)+1) 10250 #10250 T = int(input()) for i in range(T): a,b,c = map(int,input().split()) if c%a == 0 : print((a*100)+(c//a)) else :..
[code] - 백준 함수 15596,4673,1065번 python
15596 #함수 #15596 def solve(a): return sum(a) 4673 #4673 a = [1 + i for i in range(10000)] for i in range(10000) : b = list(str(i)) c = 0 for j in range(len(b)): c += int(b[j]) d = c +i if d in a : a.remove(d) for i in range(len(a)): print(a[i]) 1065 #1065 a = int(input()) b = [1 + i for i in range(a)] for j in range(len(b)+1): if j < 100 : pass elif j//100-(j%100)//10 != (j%100)//10-(j%100)%10 :..
[code] - 백준 1차열배열 10818,2582,2577,3053,1546,8958,4344 python
10818 #1차원 배열 #10818 a = int(input()) b = list(map(int, input().split())) print(str(min(b))+" "+str(max(b))) 2582 #2562 a = [] for i in range(9): b = int(input()) a.append(b) print(max(a)) print(a.index(max(a))+1) 2577 #2577 a = int(input()) b = int(input()) c = int(input()) d = a*b*c e = list(str(d)) for i in range(10): print(e.count(str(i))) 3053 #3053 a = [] for i in range(10): b = int(input(..
[code] - 백준 실습1 10039,5543,10817,2523,2446,10996, python
10039 #실습1 #10039 b=0 for i in range(5): a = int(input()) if a < 40 : a = 40 b += a print(int(b/5)) 5543 #5543 a=[] b=[] for i in range(3): c = int(input()) a.append(c) for j in range(2): d = int(input()) b.append(d) print(min(a)+min(b)-50) 10817 #10817 a=map(int,input().split()) b=sorted(b) print(b[1]) 2523 #2523 a= int(input()) for i in range(1,a+1): print(i*"*") for i in range(a-1,0,-1): prin..