목록백준 알고리즘 (34)

power-girl0-0

[ 8958 ] OX퀴즈

num = int(input()) for i in range(num): ox = list(str(input())) score = 0 cnt = 1 for j in ox: if(j == 'O'): score += cnt cnt += 1 else: cnt = 1 print(score)
백준 알고리즘/python 2021. 3. 2. 12:24
[ 1546 ] 평균

import sys total = 0 num = int(input()) score = list(map(int, sys.stdin.readline().split())) max = max(score) for i in range(len(score)): result=score[i]/max*100 total += result print("%.2f"%(total/num))
백준 알고리즘/python 2021. 3. 2. 11:51
[ 3052 ] 나머지

arr = [] for i in range(10): num = int(input()) arr.append(num % 42) arr=set(arr) print(len(arr))
백준 알고리즘/python 2021. 3. 2. 11:05
[ 2577 ] 숫자의 개수

a= int(input()) b= int(input()) c= int(input()) num = str(a*b*c) for i in range(10): print(num.count(str(i)))
백준 알고리즘/python 2021. 3. 2. 01:02
[ 2562 ] 최댓값

max = 0 cnt = 0 for i in range(9): cnt +=1 num = int(input()) if(max < num): max = num location = cnt print(max, location)
백준 알고리즘/python 2021. 3. 2. 00:56
[ 10818 ] 최소, 최대

import sys n = int(input()) num= list(map(int, sys.stdin.readline().split())) max = num[0] min = num[0] for i in range(n): if maxnum[i]: min = num[i] print(min, max)
백준 알고리즘/python 2021. 3. 2. 00:37
[ 1110 ] 더하기 사이클

n = int(input()) total = n cnt = 0 while(True): a= total//10 b= total%10 c=(a+b)%10 total = (b*10)+c cnt += 1 if(n == total): print(cnt) break
백준 알고리즘/python 2021. 3. 1. 14:00
[ 10951 ] A+B - 4

import sys while(True): try: a,b = map(int,sys.stdin.readline().split()) except: break print(a+b)
백준 알고리즘/python 2021. 2. 28. 17:08
Prev 1 2 3 4 5 Next