**10/9**
a,d,n=map(int,input().split())
res=0
for i in range (a,n):
res=a+d*i
print(res)
a,r,n=map(int,input().split())
res=a
for i in range (1,n):
res=res*r
print(res)
a,m,d,n=map(int,input().split())
res=a
for i in range (1,n):
res=res*m+d
print(res)
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)
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
d=[]
for i in range (24):
d.append(0)
for i in range(n):
d[a[i]]+=1
for i in range(1,24):
print(d[i],end=' ')
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
d=[]
for i in range(24):
d.append(0)
for i in range(n):
d[a[i]]+=1
for i in range(n-1,-1,-1):
print(a[i],end=' ')
n=int(input())
k=map(int,input().split())
a=min(k)
print(a)
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
min=a[0]
for i in range(0,n):
if a[i]<min:
min=a[i]
print(min)
#d= [ [0 for i in range(20)] for j in range(20)]
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()
d=[]
#d.append([0 for i in range(20)])
for i in range(19):
a = list ( map(int,input().split()) )
# a.insert(0,0)
d.append(a)
n=int(input())
for i in range(n):
x,y=input().split()
for j in range(19):
if d[j][int(y)-1]==0:
d[j][int(y)-1]=1
else:
d[j][int(y)-1]=0
if d[int(x)-1][j]==0:
d[int(x)-1][j]=1
else:
d[int(x)-1][j]=0
for i in range(19):
for j in range(19):
print(d[i][j],end=' ')
print()
h,w=map(int,input().split())
n=int(input())
q=[]
for i in range(h):
q.append([])
for j in range(w):
q[i].append(0)
for i in range(n):
l,d,x,y=map(int,input().split())
for j in range (l):
if d==1:
q[x+j-1][y-1]=1
else:
q[x-1][y+j-1]=1
for i in range(h):
for j in range(w):
print(q[i][j],end=' ')
print()
d=[]
for i in range(10):
a=list ( map(int,input().split()) )
d.append(a)
x=1
y=1
while True:
if (d[x][y]==0):
d[x][y]=9
elif (d[x][y]==2):
d[x][y]=9
break
if ((d[x][y+1]==1)and (d[x+1][y]==1)):
break
elif (d[x][y+1]!=1):
y+=1
elif (d[x+1][y]!=1):
x+=1
for i in range(10):
for j in range(10):
print(d[i][j],end=' ')
print()
'''
'''
c언어 문법 -> 끝
1. c언어 중간고사 대비
2. c언어 과제나 수업내용 질문
3. python 중간고사대비
4. python 과제나수업내용 질문
5.....?? c자료구조 나가기
'''
'''
def base_n_w(a,n):
result=''
while a>0:
tmp = str(a%n)
if a%n>=10 :
tmp = chr(a%n+55)
result=tmp+result
a//=n
return result
'''
'''
def base_n_w(a,n):
result=''
'''
'''
def base_n_r(a,n):
if a==0:
return ''
remainder=a%n
if remainder >= 10:
return base_n_r(a//n, n) + chr(55+remainder)
else:
return base_n_r(a//n,n)+str(remainder)
'''
'''
def sum_digit_w(n):
result=0
while n>0:
result+=n%10
n//=10
return result
'''
'''
def sum_digit_f(n):
result=0
for digit in str(n):
result+=int(digit)
return result
'''
'''
def sum_digit_r(n):
if n==0:
return 0
else:
return n%10+sum_digit_r(n//10)
'''
'''
def count_divisors_w(n):
cnt=0
i=1
while i<=n:
if n==0:
cnt+=1
elif n%i==0:
cnt+=1
i+=1
return cnt
'''
'''
def count_divisors_f(n):
cnt=0
for a in range(1,n+1):
if n==0:
cnt=cnt+1
elif n%a==0:
cnt=cnt+1
return cnt
'''
def count_divisors_r(n):
if n==0:
return 1
else:
top of page
실제 작동 상태를 확인하려면 라이브 사이트로 이동하세요.
2024.10.09
2024.10.09
댓글 0개
좋아요
댓글(0)
bottom of page