CodeUp
코드업 6091~6098(파이썬 100제)
vluevy
2021. 7. 22. 22:19
728x90
반응형
//6091
a,b,c=map(int,input().split())
d=1
while d%a!=0 or d%b!=0 or d%c!=0:
d+=1
print(d)
//6092
n=int(input())
a=input().split()
for i in range(1,24):
count=0
for j in a:
if int(i)==int(j):
count+=1
print(count,end=' ')
//6093
n=int(input())
a=input().split()
for i in range(n-1,-1,-1):
print(a[i],end=' ')
//6094
n=int(input())
a=list(map(int,input().split()))
k=a[0]
for i in a:
if k>i:
k=i
print(k)
//6095
바둑판에 흰 돌 놓기
###2차원배열 d생성
d=[]
for i in range(20):
d.append([])
for j in range(20):
d[i].append(0)
###입력
n=int(input())
for i in range(n):
x, y = input().split()
d[int(x)][int(y)] = 1
###출력
for i in range(1,20):
for j in range(1,20):
print(d[i][j],end=' ')
print()
//6096
바둑알 십자 뒤집기
d=[[0 for j in range(20)] for i in range(20)]
for i in range(1,20):
a=[int(x) for x in input().split()]
for j in range(1,20):
d[i][j]=a[j-1]
n=int(input())
for i in range(n):
x,y=map(int,input().split())
for j in range(1,20):
if d[x][j]==0:
d[x][j]=1
else:
d[x][j]=0
if d[j][y]==0:
d[j][y]=1
else:
d[j][y]=0
###print('-----')
for i in range(1,20):
for j in range(1,20):
print(d[i][j],end=' ')
print()
//6097
설탕과자 뽑기
h,w = map(int,input().split())
n = int(input())
board=[[0]*w for _ in range(h)]
for i in range(n):
l,d,x,y = map(int,input().split())
if(d==0):
for j in range(l):
board[x-1][y-1+j]=1
else:
for j in range(l):
board[x-1+j][y-1]=1
for i in range(h):
for j in range(w):
print(board[i][j],end=' ')
print()
//6098
성실한 개미
m=[[]*10 for _ in range(10)]
for i in range(10):
m[i]=list(map(int,input().split()))
x=1
y=1
m[x][y]=9
while True:
if (m[x][y]==2):
m[x][y]=9
break
if (m[x][y+1]!=1):
m[x][y]=9
y+=1
else:
if(m[x+1][y]!=1):
m[x][y]=9
x+=1
else:
m[x][y]=9
break
for i in range(10):
for j in range(10):
print(m[i][j],end=' ')
print()
기초 100제라고 해놓고 98제가 끝이다
반응형