[2단원 연습문제 풀이] 파이썬으로 쉽게 풀어 쓴 자료구조

AP과제로 직접 열심히 작성해 본 코드 ㅠㅠ

'연습문제'여서 쉬운 문제들이 대부분 이였으나, 뒤로 갈수록 사고력을 요구하는 코드들이 많았다...!

어렵거나 궁금한 코드가 있다면 댓글로 물어보세요!!!

#2.1
for n in range (9):
  print(6*(n+1))

#2.2
n = 1
while n < 9:
    print(6 * n)
    n += 1

#2.3
for n in range (9,0,-1):
  print(6*n)

#2.4
a=int(input())
a=32+1.8*a
print(a)

#2.5
def CtoF(C):
  F=32+1.8*C
  return F
C_input=int(input())
a=CtoF(C_input)
print (a)

#2.6
A = [1,2,3,4]
A.reverse()
print(A)

#2.7
A = [1,2,3,4]
print(sum(A))

#2.8
msg="Data Structures in Python"
print(msg)
print(msg.upper())
print(msg.lower())

#2.9
price = {'콩나물해장국':4500, '갈비탕':9000, '돈가스':8000}
price['팟타이']=7000
print(price)

#2.10
price = {'콩나물해장국':4500, '갈비탕':9000, '돈가스':8000}
price['팟타이']=7000
for menu in price:
    price[menu] -= 500
print(price)

#2.11
n = int(input())
sum = 0
for i in range(n):
    sum = sum + (i+1)
print(int(sum))

#2.12
n = int(input())
sum = 0
for i in range(1, n + 1):
    sum += 1/i
print(sum)

#2.13
n=int(input())
k=int(input())
def c (n,k):
  if k==0 or k==n:
    return 1
  return c(n-1,k-1)+c(n-1,k)
result = c(n,k)
print(result)

#2.14
n=int(input())
k=int(input())
def com(n,k):
  tmp1, tmp2 =1,1
  for i in range(k):
    tmp1*=n
    n-=1
    tmp2*=i+1
  return tmp1
print(com(n,k))

#2.15
def reverse(s):
    if len(s) <= 1:
        return s
    else:
        return reverse(s[1:]) + s[0]
print(reverse("ABCDE"))

#2.16
def printNum(n):
  if n==0:
    return
  printNum(n-1)
  print(n)

n=int(input())
printNum(n)
print('\n----------')
def printRevNum(n):
  if n==0:
    return
  print(n)
  printRevNum(n-1)

n=int(input())
printRevNum(n)

#2.17
n = int(input())
cnt = {k: 0 for k in range(n+1)}
def Fibo(n):
    global cnt
    cnt[n] += 1
    if n == 1 or n == 0:
        return n
    else:
        return Fibo(n-1) + Fibo(n-2)
Fibo(n)
for k, v in cnt.items():
    print(f'Fibo({k})={v}번')