๐ฃ ์ด๋ชจํฐ์ฝ ํ ์ธ ํ์ฌ
1. ๋ฌธ์ ๋งํฌ
2023 KAKAO BLIND RECRUITMENT: ์ด๋ชจํฐ์ฝ ํ ์ธ ํ์ฌ
2. ์ฝ๋
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
# ์ด๋ชจํฐ์ฝ ํ๋ฌ์ค ๊ฐ์
, ํ๋งค์ก
# return ์ด๋ชจํฐ์ฝ ํ๋ฌ์ค ๊ฐ์
์, ๋งค์ถ์ก
from itertools import product
def purchase_emoticons(discount, new_discount, new_price):
rst = 0
for i in range(len(new_discount)):
if new_discount[i] >= discount:
rst += new_price[i]
return int(rst)
def solution(users, emoticons):
answer = [0, 0]
discount_rate = [0.1, 0.2, 0.3, 0.4]
prod = product(discount_rate, repeat=len(emoticons))
for p in prod:
tmp = [0, 0]
new_discount = list(zip(p, emoticons))
new_price = list(map(lambda x : (1-x[0]) * x[1], new_discount))
for discount, price_lim in users:
money = purchase_emoticons(discount / 100, p, new_price)
if money >= price_lim: tmp[0] += 1
else: tmp[1] += money
if tmp[0] > answer[0] or (tmp[0] == answer[0] and tmp[1] > answer[1]):
answer = tmp[:]
return answer
This post is licensed under CC BY 4.0 by the author.