'''
h,w=map(int,input().split())
a=[]
for i in range(h):
b=[0]*w
a.append(b)
n=int(input())
for i in range(n):
l,d,x,y=map(int,input().split())
p=x-1
q=y-1
for j in range(l):
a[p][q]=1
if d==0:
q=q+1
else:
p=p+1
for i in range(h):
for j in range(w):
print(a[i][j],end=' ')
print()
a=[]
for i in range(10):
b=list(map(int,input().split()))
a.append(b)
p=1
q=1
a[1][1]=9
while True:
if a[p][q]==2:
a[p][q]=9
break
a[p][q]=9
if a[p][q+1]!=1:
q=q+1
elif a[p+1][q]!=1:
p=p+1
else:
a[p][q]=9
break
for i in range(10):
for j in range(10):
print(a[i][j],end=' ')
print()
n=int(input())
a=[]
for i in range(n):
b=[0]*(i+1)
a.append(b)
a[i][0]=int(input())
for i in range(n):
for j in range(i+1):
if a[i][j]!=0:
continue
a[i][j]=a[i][j-1]-a[i-1][j-1]
for i in range(n):
for j in range(i+1):
print(a[i][j],end=' ')
print()
'''
top of page

실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
2025.08.31
2025.08.31
댓글 0개
좋아요
댓글(0)
bottom of page