Advertisement
wonseokb

Untitled

Apr 18th, 2019
97
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 4.07 KB | None | 0 0
  1. #1-1
  2.  
  3. while 1:
  4.     n = int(input("자연수를 입력하시오:"))
  5.     if n == 0:
  6.         break
  7.     print(n, end = ' ')
  8.     while n != 1:
  9.         n = 3 * n + 1 if n % 2 else n // 2
  10.         print(n, end = ' ')
  11.     print("\n")
  12. print("Bye, ....")
  13.  
  14. #1-2
  15.  
  16. N = int(input("자연수를 입력하세요:"))
  17. sum=0
  18. for num in range(1, N+1):
  19.     if (num%3==0 or num%5==0):
  20.         sum+=num
  21. print("1부터 {}까지 3의 배수와 5의배수의 총합은 {}이다. ".format(N, sum))
  22.  
  23. #1-3
  24.  
  25. num = int(input("자연수를 입력하시오 : "))
  26. sum=0
  27.  
  28. for i in range(1, num+1):
  29.     if num % i==0:
  30.         sum+=i
  31.  
  32. print("{}의 약수의 총합은 {}이다.".format(num, sum))
  33.  
  34. #1-4
  35.  
  36. N = int(input("자연수를 입력하시오 : "))
  37. varN=N
  38. decomp = ""
  39.  
  40. for i in range(2, N+1):
  41.     while varN % i == 0:
  42.         varN = int(varN / i)
  43.         decomp=decomp+ str(i) + " "
  44.  
  45. print("{}의 소인수분해는 {}입니다.".format(N, decomp))
  46.  
  47. # 1-5
  48.  
  49. n = int(input("자연수를 입력하시오 :"))
  50. r = int(input("0이상인 정수를 입력하시오(앞의 입력숫자보다 같거나 작은) :"))
  51.  
  52. k = 1
  53. l = 1
  54. for i_1 in range(n-r+1,n+1) :
  55.     k = k*(i_1)
  56. for i_2 in range(1,r+1) :
  57.     l = l*(i_2)
  58. c = int(k/l)
  59. print("{} C {} 는 {} 입니다".format(n, r, c))
  60.  
  61. #2-1
  62.  
  63. # grading for score
  64. def  grading(score):
  65.  
  66.     if score >= 90:
  67.         grade = 'A'
  68.     elif score >= 80:
  69.         grade = 'B'
  70.     elif score >= 70:
  71.         grade = 'C'
  72.     elif score >= 60:
  73.         grade = 'D'
  74.     else:
  75.         grade = 'F'
  76.     print("{} for {}\n".format(grade, score))
  77.  
  78. while 1:
  79.     try:
  80.         score = int(input("Score ? "))
  81.         if 0 <= int(score) <= 100:
  82.             grading(int(score))
  83.         else:
  84.             print("Bye....")
  85.             break
  86.     except (TypeError, ValueError):
  87.         print("숫자를 입력하세요.")
  88.  
  89. #2-2
  90.  
  91. import random
  92.  
  93. while 1:
  94.     nswr = random.randint(1, 32)
  95.     for i in range(1, 6):
  96.         guess = int(input("[{}] ? ".format(i)))
  97.         if guess == nswr:
  98.             print("Congraduations !")
  99.             break
  100.         elif guess > nswr:
  101.             print("Big")
  102.         else:
  103.             print("Small")
  104.     rspns = input("More Game(y/n) ? ")
  105.     if rspns[0] == 'n':
  106.         break
  107. print("Bye, ....")
  108.  
  109. #2-3
  110.  
  111. import random
  112.  
  113. def FindMin(aList):
  114.     nLen = len(aList)
  115.     minNdx = 0
  116.     for ndx in range(1, nLen):
  117.         if aList[ndx] < aList[minNdx]:
  118.             minNdx = ndx
  119.     return minNdx
  120.  
  121. random.seed()
  122. aList = [random.randint(1, 100) for i in range(20)]
  123. print(aList)
  124. nMin = FindMin(aList)
  125. print("aList[{}] = {}".format(nMin, aList[nMin]))
  126.  
  127. #2-4
  128.  
  129. import random
  130.  
  131. def FindMin(aList):
  132.     minNdx, nLen = 0, len(aList)
  133.     for ndx in range(1, nLen):
  134.         if aList[ndx] < aList[minNdx]:
  135.             minNdx = ndx
  136.     return minNdx
  137.  
  138. def FindMax(aList):
  139.     maxNdx, nLen = 0, len(aList)
  140.     for ndx in range(1, nLen):
  141.         if aList[ndx] > aList[maxNdx]:
  142.             maxNdx = ndx
  143.     return maxNdx
  144.  
  145. def SortList1(aList):
  146.     nLen = len(aList)
  147.     for ndx in range(nLen - 1):
  148.         minNdx = ndx + FindMin(aList[ndx:])
  149.         aList[ndx], aList[minNdx] = aList[minNdx], aList[ndx]
  150.  
  151. def SortList2(aList):
  152.     nLen = len(aList)
  153.     for ndx in range(nLen - 1):
  154.         nLocalLen, nLastNdx = nLen - ndx, nLen - ndx - 1
  155.         maxNdx = FindMax(aList[:nLocalLen])
  156.         aList[nLastNdx], aList[maxNdx] = aList[maxNdx], aList[nLastNdx]
  157.  
  158. random.seed()
  159. aList1 = [random.randint(1, 99) for i in range(20)]
  160. aList2 = list(aList1)   ## copy aList1
  161. print(aList1)
  162. SortList1(aList1)
  163. print(aList1)
  164. SortList2(aList2)
  165. print(aList2)
  166.  
  167. #2-5
  168.  
  169. def CipherMsg(msg):
  170.     if msg.isalpha():
  171.         base = ord('A' if msg.isupper() else 'a')
  172.         msg = chr(base + (ord(msg) - base + key + 26) % 26)
  173.     return msg
  174.  
  175. key = 3
  176. while 1:
  177.     sMsg = input("Msg ? ")
  178.     if len(sMsg) == 0:
  179.         break
  180.     if sMsg[0] == '!':
  181.         key = int(sMsg[1:])
  182.     else:
  183.         print("      ", end='')
  184.         for msg in sMsg:
  185.             print(CipherMsg(msg), end='')
  186.         print()
  187.     print()
  188. print("Bye, ...")
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement