얄루의 개발일기🥑

import base64 t = int(input()) for tc in range(1,t+1): s = input() enc = s.encode("UTF-8") dec = base64.b64decode(enc) print(f'#{tc} {dec.decode("UTF-8")}')

import sys input = sys.stdin.readline n = int(input()) timetable = [list(map(int,input().split())) for _ in range(n)] dp = [0 for _ in range(n+1)] for i in range(n-1,-1,-1): if i + timetable[i][0] > n: dp[i]= dp[i+1] else: dp[i] = max(timetable[i][1] +dp[i+timetable[i][0]],dp[i+1]) print(dp[0]) # 뒤에서부터 살펴보면서 주어진 시간보다 더 뒤에 있는 것들은 수행할 수 없으니 if문으로 구분해가며 진행한다.

n, m = map(int, input().split()) def two_count(n): two = 0 while n != 0: n = n // 2 two += n return two def five_count(n): five = 0 while n != 0: n = n // 5 five += n return five print(min(two_count(n) - two_count(n - m) - two_count(m), five_count(n) - five_count(n - m) - five_count(m)))

t = int(input()) for tc in range(1,t+1): n = int(input()) a=b=c=d=e=0 while n % 2 == 0: a += 1 n //= 2 while n % 3 == 0: b += 1 n //= 3 while n % 5 == 0: c += 1 n //= 5 while n % 7 == 0: d += 1 n //= 7 while n % 11 == 0: e += 1 n //= 11 print(f"#{tc} {a} {b} {c} {d} {e}")

t = int(input()) for tc in range(1, t+1): n = int(input()) lst = '' for i in range(n): alpha, num = input().split() lst += alpha*int(num) print(f'#{tc}') for i in range(0,len(lst),10): print(lst[i:i+10])

def gcd(a,b): while b!=0: n = a%b a = b b = n return a n = int(input()) rings = list(map(int,input().split())) for i in range(1, n): g = gcd(rings[0],rings[i]) print(f"{rings[0]//g}/{rings[i]//g}") #기약분수 문제로 분자, 분모에 최대공약수를 나눠서 푸는 문제.

def solution(left, right): answer = 0 #약수가 짝수면 더하고 / 약수가 홀수면 빼고 for i in range(left,right+1): cnt = 0 for j in range(1,i+1): if i % j == 0: cnt+=1 if cnt % 2 == 0: answer += i else: answer -= i return answer

def solution(arr): answer = [] for i in range(len(arr)): if i == 0: answer.append(arr[i]) elif arr[i] != arr[i-1]: answer.append(arr[i]) return answer def solution(arr): answer = [] for i in range(len(arr)): if i == 0: answer.append(arr[i]) elif arr[i] != arr[i-1]: answer.append(arr[i]) else: continue return answer

def solution(clothes): answer = 0 cloths = {} for name,clothtype in clothes: if clothtype in cloths: cloths[clothtype] += 1 else: cloths[clothtype] = 1 answer = 1 for key, value in cloths.items(): #각 아이템의 개수를 한 개씩 뽑아오기. answer *= (value + 1) #해당 아이템을 착용하지 않을 경우를 고려해서 +1 return answer - 1 #모두 입지 않은 경우를 고려해서 -1

n, k = map(int, input().split()) wv = [[0,0]] dp = [[0]*(k+1) for _ in range(n+1)] for i in range(n): wv.append(list(map(int, input().split()))) for i in range(1, n+1): for j in range(1, k+1): w = wv[i][0] v = wv[i][1] if j < w: dp[i][j] = dp[i-1][j] else: dp[i][j] = max(dp[i-1][j], dp[i-1][j-w]+v) print(dp[n][k])