資源簡介
西電python網絡處理上機題答案,在一個文件中。西電python網絡處理上機題答案,在一個文件中。西電python網絡處理上機題答案,在一個文件中。
代碼片段和文件信息
#?------------------------------
“““
#?1
#!/usr/bin/python3
ab=map(int?input().split())
print(a+b)
“““
#?------------------------------
“““
#?2
#!/usr/bin/python3
print(“Python?=?Pile?+?sensensen“)
“““
#?------------------------------
“““
#?3
#!/usr/bin/python3
a?b?c?=?map(int?input().split())
print(int(a?*?0.2?+?b?*?0.3?+?c?*?0.5))
“““
#?------------------------------
“““
#?4
#!/usr/bin/python3
import?math
n?=?int(input())
print(math.gamma(n))
“““
#?------------------------------
“““
#?5
#!/usr/bin/python3
a?=?str(input())
b?=?str(input())
if?len(a)?>?len(b):
????print(b?in?a)
else:
????print(a?in?b)
“““
#?------------------------------
“““
#?6
#!/usr/bin/python3
str=str(input())#輸入一個字符串
length=len(str)#求字符串長度
left=0#定義左右‘指針’
right=length-1
while?left<=right:#判斷
????if?str[left]==str[right]:
????????left+=1
????????right-=1
????else:
????????break;
if?left>right:
????print(“True“)
else?:
????print(“False“)
“““
#?------------------------------
“““
#?7
#!/usr/bin/python3
n?=?input()
if?n.isdigit():
????n?=?int(n)
????if?n<60:
????????print(‘F‘)
????elif?n<70:
????????print(‘D‘)
????elif?n<80:
????????print(‘C‘)
????elif?n<90:
????????print(‘B‘)
????elif?n<=100:
????????print(‘A‘)
????else:
????????print(“Error!“)
else:
????print(“Error!“)
“““
#?------------------------------
“““
#?8
#!/usr/bin/python3
def?gcd(pq):
????if?q?==?0:
????????return?p
????return?gcd(qp%q)
????
a?=?int(input())
b?=?int(input())
if?b>a:
????c=a
????a=b
????b=c
????
x?=?gcd(ab)
print(x)
“““
#?------------------------------
“““
#?9
#!/usr/bin/python3
n?=?int(input())
for?x?in?range(1n+1):
????if?x%2==0:
????????print(x)
“““
#?------------------------------
“““
#?10
#!/usr/bin/python3
n?=?int(input())
b?=?0
for?x?in?range(n):
????a?=?int(input())
????b?=?b+a
sum?=?b
mean?=?(“%.5f“?%?(b/n))
output=[]
output.append(str(sum))
output.append(str(mean))
print(“?“.join(output))
“““
#?------------------------------
“““
#?11
#!/usr/bin/python3
import?sys
sys.setrecursionlimit(3000)
def?recursion(n):??
????if?n?==?1:
????????return?1
????else:
????????return?n?*?recursion(n?-?1)
n?=?int(input())
output?=?0
if?n?==?0:
????print(int(1))
else:
????for?i?in?range(1?n?+?1):
????????output?=?output?+?int(recursion(i))??
????print(output)
“““
#?------------------------------
“““
#?12
#!/usr/bin/python3
x?=?input()
money?=?x[:-1]
lab?=?x[-1]
if?money.isdigit():
????if?lab?==?‘R‘?or?lab?==?‘r‘:
????????money?=?int(int(money)?/?6)
????????output?=?str(money)?+?‘D‘
????????print(output)
????elif?lab?==?‘D‘?or?lab?==?‘d‘:
????????money?=?int(int(money)?*?6)
????????output?=?str(money)?+?‘R‘
????????print(output)
????else:
????????print(“Error!“)
else:
????print(“Error!“)
“““
#?------------------------------
“““
#?13
#!/usr/bin/python3
scale?=?int(input())
print(“{:-^17}“.format(“start
- 上一篇:VMD變分模態分解算法
- 下一篇:python程序設計基礎課件
評論
共有 條評論