a, b = map(int, input().strip().split(' '))
answer = ('*' * a +'\n')*b
print(answer)
์ ์ผ ์์ ์ ์ ๊ฑฐํ๊ธฐ
def solution(arr):
arr.remove(min(arr))
return arr if arr else [-1]
def solution(n):
sqrt = n**0.5
return (sqrt+1)**2 if int(sqrt) == sqrt else -1
์ ์ ๋ด๋ฆผ์ฐจ์์ผ๋ก ๋ฐฐ์นํ๊ธฐ
def solution(n):
return int(''.join(sorted([x for x in str(n)], reverse = True)))
์์ฐ์ ๋ค์ง์ด ๋ฐฐ์ด๋ก ๋ง๋ค๊ธฐ
def solution(n):
return [int(x) for x in str(n)][::-1]
def solution(s):
s = s.lower().split(' ')
answer = ''
for word in s :
answer += ''.join(x.upper() if i % 2 == 0 else x for i, x in enumerate(word)) + ' '
return answer[:-1]
def solution(N, stages):
failure_rate = {}
total_players = len(stages)
for stage in range(1, N + 1):
players_at_stage = stages.count(stage)
if total_players > 0:
failure_rate[stage] = players_at_stage / total_players
total_players -= players_at_stage
else:
failure_rate[stage] = 0
# ์คํจ์จ์ ๊ธฐ์ค์ผ๋ก ๋ด๋ฆผ์ฐจ์ ์ ๋ ฌํ๋, ์คํจ์จ์ด ๊ฐ์ ๊ฒฝ์ฐ ์คํ
์ด์ง ๋ฒํธ๊ฐ ์์ ์์ผ๋ก ์ ๋ ฌ
return sorted(failure_rate, key=lambda x: failure_rate[x], reverse=True)