쏘ing
[Python] CLASS 1 - B3 본문
[백준 2438] 별 찍기 - 1
https://www.acmicpc.net/problem/2438

풀이
num = int(input())
for i in range(num):
print('*'*(i+1))
[백준 2439] 별 찍기 - 2
https://www.acmicpc.net/problem/2439

풀이 1
num = int(input())
for i in range(1, num+1):
print(' ' * (num-i), end="")
print('*' * i)
풀이 2
num = int(input())
for i in range (num):
a = "*"*(i+1)
# 오른쪽 정렬
b = a.rjust(num, " ")
print(b)
[백준 2739] 구구단
https://www.acmicpc.net/problem/2739

풀이
num = int(input())
for i in range (9):
print(num, '*', i + 1, '=', num * (i + 1))
[백준 2741] N 찍기
https://www.acmicpc.net/problem/2741

풀이
num = int(input())
for i in range (num):
print(i+1)
[백준 2742] 기찍 N
https://www.acmicpc.net/problem/2742

풀이
num = int(input())
for i in range (num):
print(num - i)
[백준 2884] 알람 시계
https://www.acmicpc.net/problem/2884

풀이
hour, min = map(int, input().split())
if(min >= 45):
print(hour, min - 45)
else:
if(hour == 0):
hour = 24
min = min + 60 - 45
print(hour - 1, min)
[백준 10818] 최소, 최대
https://www.acmicpc.net/problem/10818

풀이
num = int(input())
num_list = list(map(int, input().split()))
print(min(num_list), max(num_list))
[백준 10871] X보다 작은 수
https://www.acmicpc.net/problem/10871

풀이
count, num = map(int, input().split())
num_list = list(map(int, input().split()))
for i in num_list:
if i < num:
print(i, end=" ")
[백준 10950] A + B - 3
https://www.acmicpc.net/problem/10950

풀이
num = int(input())
for _ in range (num):
a, b = map(int, input().split())
print(a + b)
[백준 10951] A + B - 4
https://www.acmicpc.net/problem/109501

풀이
while True:
try:
a, b = map(int, input().split())
print(a + b)
except:
break
[백준 10952] A + B - 5
https://www.acmicpc.net/problem/109502

풀이
while True:
a, b = map(int, input().split())
if a == 0 and b == 0:
break
print(a + b)
'알고리즘 > CLASS 1' 카테고리의 다른 글
[Python] CLASS 1 - B2 (0) | 2022.02.08 |
---|---|
[Python] CLASS 1 - B4 (0) | 2022.02.08 |
[Python] CLASS 1 - B5 (0) | 2022.02.08 |