Python 알고리즘
[알고리즘]백준 1076번
잠이와요
2023. 9. 26. 13:17
백준 1076번
https://www.acmicpc.net/problem/1076
one = input()
two = input()
three = input()
def check_num(number):
if number == 'black':
number = '0'
elif number=='brown':
number = '1'
elif number =='red':
number = '2'
elif number =='orange':
number = '3'
elif number == 'yellow':
number = '4'
elif number =='green':
number = '5'
elif number == 'blue':
number = '6'
elif number == 'violet':
number = '7'
elif number =='grey':
number = '8'
elif number == 'white':
number = '9'
return number
one = check_num(one)
two = check_num(two)
three = check_num(three)
three = int(three)
third = 1
for i in range(three):
third = 10*third
result = one+two
result = int(result)
result = result*third
print(result)
백준 1412번
https://www.acmicpc.net/status?user_id=seojimin1234&problem_id=1412&from_mine=1
N = int(input())
a=[]
col = 0
for i in range(N):
b = list(input())
a.append(b)
col = col+1
#양방향 도로를 일방향 도로로 바꾸겠다
for i in range(N):
for j in range(col):
if a[i][j] == 'Y' and a[j][i] =='Y':
a[i][j] = 'N'
a[j][i] = 'N'
count = 0
for i in range(N):
for j in range(col):
if a[i][j] == 'Y':
count = count+1
if count ==0:
print('YES')
else:
print('NO')
틀림....