코드업 6063 ~ 6098

낙원·2022년 11월 3일
2

Codeup

목록 보기
7/8
post-thumbnail

6063

a, b = map(int, input().split())

print(a if a>=b else b)

6064

a, b, c= map(int, input().split())

print(a if a < b and a < c else b if b < c else c)

6065

a, b, c= map(int, input().split())

if a % 2 == 0:
    print(a)
    
if b % 2 == 0:
    print(b)
    
if c % 2 == 0:
    print(c)

6066

a, b, c= map(int, input().split())

if a % 2 == 0:
    print("even")
else:
    print("odd")
    
if b % 2 == 0:
    print("even")
else:
    print("odd")
    
if c % 2 == 0:
    print("even")
else:
    print("odd")

6067

a = int(input())

if a < 0:
    if a % 2 == 0:
        print('A')
    else:
        print('B')
else:
    if a % 2 == 0:
        print('C')
    else:
        print('D')

6068

a = int(input())

if a >= 90:
    print('A')
elif a >= 70:
    print('B')
elif a >= 40:
    print('C')
else:
    print('D')

6069

a = input()

if a == 'A':
    print("best!!!")
elif a == 'B':
    print("good!!")
elif a == 'C':
    print("run!")
elif a == 'D':
    print("slowly~")
else:
    print("what?")

6070

a = int(input())

if a == 12 or a == 1 or a == 2:
    print("winter")
elif a == 3 or a == 4 or a == 5:
    print("spring")
elif a == 6 or a == 7 or a == 8:
    print("summer")
else:
    print("fall")

6071

while True:
    a = int(input())

    if a == 0:
        break

    print(a)

6072

a = int(input())

while a != 0:
    print(a)
    a -= 1

6073

a = int(input())

while a != 0:
    a -= 1
    print(a)

6074

c = ord(input())
t = ord('a')

while t <= c:
    print(chr(t), end=' ')
    t += 1

6075

a = int(input())

st = 0

while st != a + 1:
    print(st)
    st += 1

6076

a = int(input())

for i in range(a + 1):
    print(i)

6077

a = int(input())
s = 0

for i in range(a + 1):
    if i % 2 == 0:
        s += i

print(s)

6078

while True:
    a = input()

    if a != 'q':
        print(a)
    else:
        print(a)
        break

6079

k = int(input())
s = 0
i = 1

while True:
    s += i

    if s >= k:
        break

    i += 1

print(i)

6080

a, b = map(int, input().split())

for i in range(1,a+1):
    for j in range(1, b+1):
        print(i, j)

6081

n = int(input(), 16)

for i in range(1, 16) :
  print('%X'%n, '*%X'%i, '=%X'%(n*i), sep='')

6082

a = int(input())

for i in range(1, a + 1):
    if i % 10 == 3 or i // 10 == 3 or i % 10 == 6 or i // 10 == 6 or i % 10 == 9 or i // 10 == 9:
        print('X', end = ' ')
    else:
        print(i, end= ' ')

6083

r, g, b = map(int,input().split())

count=0

for i in range(r):
    for j in range(g):
        for k in range(b):
            print('%d %d %d' %(i,j,k))
            
            count = count + 1
            
print(count)

6084

h, b, c, s = map(int, input().split())

result = h * b * c * s / 8 / 1024 / 1024

print(format(result, '.1f'),"MB")

6085

w,h,b = input().split()
res=int(w)*int(h)*int(b)/1024/1024/8

print('%.2f'%res,"MB")

6086

a = int(input())

s = 0
i = 1

while True:
    s += i
    i += 1

    if s >= a:
        break

print(s)

6087

a = int(input())

for i in range(1, a + 1):
    if i % 3 == 0:
        continue
    else:
        print(i, end= ' ')

6088

a, b, c = map(int, input().split())

s = a

for i in range(1,c):
    s += b

print(s)

6089

a, b, c = map(int, input().split())

s = a

for i in range(1,c):
    s *= b

print(s)

6090

a, b, c, d = map(int, input().split())

s = a

for i in range(d - 1):
    s = s * b + c

print(s)

6091

a, b, c= map(int, input().split())

i = 2

while True:
    if i % a == 0 and i % b == 0 and i % c == 0:
        break

    i += 1

print(i)

6092

n = int(input())
a = input().split()

for i in range(n):
    a[i] = int(a[i])

k = []
for i in range(24):
    k.append(0)

for i in range(n):
    k[a[i]] += 1

for i in range(1,24):
    print(k[i],end=' ')

6093

n = int(input())

k = input().split()

for i in range(n-1, -1, -1):
  print(k[i], end=' ')

6094

n = int(input())

k = input().split()

minnum = 10001

for i in range(n):
    if minnum > int(k[i]):
        minnum = int(k[i])

print(minnum)

6095

k=[]

for i in range(20) :
  k.append([])
  for j in range(20) : 
    k[i].append(0)

n = int(input())

for i in range(n) :
  x, y = input().split()
  k[int(x)][int(y)] = 1

for i in range(1, 20) :
  for j in range(1, 20) : 
    print(k[i][j], end=' ')
  print()

6096

board = []

for i in range(19):
    board.append([])
    for j in range(19):
        board[i].append(0)

for i in range(19):
    board[i] = list(map(int, input().split()))

n = int(input())

for i in range(n):
    x, y = map(int, input().split())

    for j in range(19):
        if board[x-1][j] == 0:
            board[x-1][j] = 1
        else:
            board[x-1][j] = 0
            
        if board[j][y-1] == 0:
            board[j][y-1] = 1
        else:
            board[j][y-1] = 0

for i in range(19):
    for j in range(19):
        print(board[i][j], end=" ")
    print()

6097

height, width = map(int, input().split())

board = []

for i in range(height + 1):
    board.append([])
    for j in range(width + 1):
        board[i].append(0)


k = int(input())

for i in range(k):
    mak, direct, x, y = map(int, input().split())

    if direct == 0:     #가로
        for j in range(mak):
            board[x][y + j] = 1
    else:               #세로
        for j in range(mak):
            board[x + j][y] = 1


for i in range(1, height+1) :
    for j in range(1, width+1) :
        print(board[i][j], end=' ')
    print()

6098

board = []

for i in range(10):
    board.append([])
    for j in range(10):
        board[i].append(0)

for i in range(10) :
  a=input().split()
  for j in range(10) :
    board[i][j]=int(a[j])

x, y = 1, 1

while True:
    if (board[x][y] == 0):  #경로 표시
        board[x][y] = 9
    elif (board[x][y] == 2):#목적지 도착
        board[x][y] = 9
        break

    #아래랑 오른쪽 막혀있을 경우 끝
    if ((board[x][y+1] == 1 and board[x+1][y] == 1)):
        break
    
    if (board[x][y+1] != 1):    #아래 벽 없을 경우
        y = y + 1
    elif (board[x+1][y] != 1):  #오른쪽 벽 없을 경우
        x = x + 1
    
    
for i in range(10):
    for j in range(10):
        print(board[i][j], end=' ')
    print()

0개의 댓글