pythoncomp

㈠ 关于python的问题,好的高奖励!

import random

class NumberG:

def __init__(self, trytimes = 10):
self.num = str(random.randint(1000,9999))
self.trytimes = trytimes

def comp(self, n):
nset, rs = set(list(self.num)), []
for i,c in enumerate(n):
rs.append(
'Y' if c==self.num[i] else (
'H' if c in (nset - set(self.num[i]))
else 'N'
)
)
print ''.join(rs)
return True if n == self.num else False

def run(self, trytimes = None):
trytimes = trytimes or self.trytimes
while trytimes:
if not self.comp(raw_input('Try a number:')):
trytimes -= 1
else:
print 'OK', 10 - trytimes

if __name__ == '__main__':
numberg = NumberG()
numberg.run()

㈡ Python的py如和转换成pyc

单独写一个python文件，假设命名为comp.py，内容如下：

importpy_compile
py_compile.compile(r'路径ASA.py')

代码中“路径”修改为你放asa.py的文件路径，然后执行comp.py，会在目录下生成名字为__pycache__的文件夹，pyc文件就在此文件内。

㈢ Python 解决你的实际问题可以在哪些地方找资料

Python 标准库：
应该浏览一下这份文档，它为标准库中的类型、函数和模块提供了完整（尽管很简略）的参考资料。标准的 Python 发布版包括了 大量 的附加模块。其中有针对读取 Unix 邮箱、接收 HTTP 文档、生成随机数、解析命令行选项、写 CGI 程序、压缩数据以及很多其它任务的模块。略读一下库参考会给你很多解决问题的思路。
安装 Python 模块 展示了如何安装其他 Python 用户编写的附加模块。
Python 语言参考： 详细说明了 Python 语法和语义。
它读起来很累，不过对于语言本身，有份完整的手册很有用。
其它 Python 资源：
http://www.python.org： Python 官方网站。它包含代码、文档和 Web 上与 Python 有关的页面链接该网站镜像于全世界的几处其它问题，类似欧洲、日本和澳大利亚。
镜像可能会比主站快，这取决于你的地理位置。
http://docs.python.org： 快速访问 Python 的文档。
http://pypi.python.org： Python 包索引，以前昵称为奶酪店，索引了可供下载的，用户创建的 Python 模块。如果你发布了代码，可以注册到这里，这样别人可以找到它。
http://code.activestate.com/recipes/langs/python/： Python 食谱是大量的示例代码、大型的集合，和有用的脚本。
值得关注的是这次资源已经结集成书，名为《Python 食谱》（O’Reilly & Associates, ISBN 0-596-00797-3。）
http://scipy.org: The Scientific Python 项目包括数组快速计算和处理模块，和大量线性代数、傅里叶变换、非线性solvers、随机数分布，统计分析以及类似的包。
与 Python 有关的问题，以及问题报告，可以发到新闻组 comp.lang.python ，或者发送到邮件组 [email protected] 。新闻组和邮件组是开放的，所以发送的消息可以自动的跟到另一个之后。每天有超过 120 个投递（高峰时有数百）,提问（以及回答）问题，为新功能提建议，发布新模块。在发信之前，请查阅 常见问题 (亦称 FAQ)，或者在 Python 源码发布包的 Misc/ 目录中查阅。邮件组也可以在 http://mail.python.org/pipermail/ 访问。FAQ回答了很多被反复提到的问题，很可能已经解答了你的问题。
Next Previous

㈣ Python中 1. 编写函数，要求输入x与y，返回x和y的平方差 2. 计算1到100的平方的和

1、

defpfc(x,y):
returnx**2-y**2

2、

sum(map(lambdax:x**2,range(101)))

3、

defcomp100(n):
returnTrueifn<100elseFalse

㈤ 讲解：COMP6714、python、python、FRIPython|R

COMP6714 ASSIGNMENT 1DUE ON 20:59 29 NOV, 2019 (FRI)Q1. (25 marks)Consider the following pseudo code which performs list intersection based on the divideand-conquerparadigm. Note that the input lists are not necessarily sorted.Algorithm 1: Intersect(A, B)1 if ... then/* Deal with the boundary case */2 ...;3 return ...;4 else/* Recursively break down each list into two parts and recurse */5 ...;6 return ...;(1) Complete the above pseudo code. You can assume that you can invoke the followingmember methods on a List object L:• L.len returns the length of the list L.You can also use the usually indexing and slicing operation on the list (as inpython).(2) Think of a method to divide each input list into k sub-lists (k2) without changingthe main logic of the algorithm you implemented in the first part. You should beable to describe the only change succinctly.Q2. (25 marks)Consider the scenario of dynamic inverted index construction. Assume that t sub-indexes(each of M pages) will be created if one chooses the no-merge strategy.(1) Show that if the logarithmic merge strategy is used, it will result in at most dlog2 tesub-indexes.(2) Prove that the total I/O cost of the logarithmic merge is O(t · M · log2 t).12 DUE ON 20:59 29 NOV, 2019 (FRI)Q3. (25 marks)The following list of Rs and Ns represents relevant (R) and nonrelevant (N) returneddocuments in a ranked list of 20 documents retrieved in response to a query from a collectionof 10, 000 documents. The top of the ranked list is on the left of the list. This list shows 6relevant documents. Assume that there are 8 relevant documents in total in the collection.RRNNN NNNRN RNNNR NNNNR(Note that spaces above are just added to make the list easier to read)(1) What is the precision of the system on the top-20?(2) What is the F1 on the top-20?(3) What is/are the uninterpolated precision(s) of the system at 25% recall?(4) What is the interpolated precision at 33% recall?(5) Assume that these 20 documents are the complete result set of the system. Whatis the MAP for the query?Assume, now, instead, that the system returned the entire 10, 000 documents in a rankedlist, and these arCOMP6714代做、python程序语言代写、代做pythe the first 20 results returned.(6) What is the largest possible MAP that this system could have?(7) What is the smallest possible MAP that this system could have?(8) In a set of experiments, only the top-20 results are evaluated by hand. The resultin (5) is used to approximate the range (6) to (7). For this example, how large (inabsolute terms) can the error for the MAP be by calculating (5) instead of (6) and(7) for this query?Q4. (25 marks)Suppose we have a document collection with an extremely small vocabulary with only6 words w1, w2,...,w6. The following table shows the estimated background languagemodel p(w|C) using the whole collection of documents (2nd column) and the word countsfor document d1 (3rd column) and d2 (4th column), where c(w, di) is the count of word win document di. Let Q = {w1, w2, w3, w4, w5, w6} be a query.Word p(w|C) c(w, d1) c(w, d2)w1 0.800 2 7w2 0.100 3 1w3 0.025 1 1w4 0.025 2 1w5 0.025 2 0w6 0.025 0 0(1) Suppose we do not smooth the language model for d1 and d2. Compute the likelihoodof the query for both d1 and d2, i.e., p(Q|d1) and p(Q|d2) (Do not computethe log-likelihood. You should use the scientific notation (e.g., 0.0061 should be6.1 ⇥ 103)Which document would be ranked higher?COMP6714 ASSIGNMENT 1 3(2) Suppose we now smooth the language model for d1 and d2 using the Jelinek-Mercersmoothing method with= 0.8 (i.e., p(w|d) = ·pmle(w|Md)+(1)·pmle(w|Mc)).Recompute the likelihood of the query for both d1 and d2, i.e., p(Q|d1) and p(Q|d2)(Do not compute the log-likelihood. You should use the scientific notation) Whichdocument would be ranked higher?Submission InstructionsYou need to write your solutions to the questions in a pdf file named ass1.pdf. Youmust• include your name and student ID in the file, and• the file can be opened correctly on CSE machines.You need to show the key steps to get the full mark.Note: Collaboration is allowed. However, each person must independently write uphis/her own solution.You can then submit the file by give cs6714 ass1 ass1.pdf. The file size is limitedto 5MB.Late Penalty: -10% per day for the first two days, and -20% per day for the followingdays.转自：http://www.daixie0.com/contents/3/4354.html

㈥ python 从文件读数并比较大小

file_a = open("a.txt")
file_b = open("b.txt", 'w')
comp_num = 10 # 此为固定数
num = file_a.readline()[: -1]
while num:
if float(num) > comp_num:
file_b.write(num + ' -1\n')
else:
file_b.write(num + ' 1\n')
num = filea.readline()[: -1]
file_a.close()
file_b.close()

㈦ Python求平均数大学计算机题

math=87
eng=72
comp=93
average=int((math+eng+comp)/3)
print('math=87,eng=72,comp=93,average=%s'%average)

㈧ python这道题啥意思怎么做

python这道题是面向对象的用法考查，以复数类的构建为例，结合一点复数知识填入而可，排版和代码如图，注意填入的缩进（选中的代码是题目内容，没选中的是测试代码，效果如下）

㈨ python sort()用法

Python中的sort()方法用于数组排序，下面以实例形式对此加以详细说明：

一、基本形式

列表有自己的sort方法，其对列表进行原址排序，既然是原址排序，那显然元组不可能拥有这种方法，因为元组是不可修改的。

x=[4,6,2,1,7,9]x.sort()
printx#[1,2,4,6,7,9]

如果需要一个排序好的副本，同时保持原有列表不变，怎么实现呢

x=[4,6,2,1,7,9]
y=x[:]
y.sort()
printy#[1,2,4,6,7,9]
printx#[4,6,2,1,7,9]

注意：y = x[:] 通过分片操作将列表x的元素全部拷贝给y，如果简单的把x赋值给y：y = x，y和x还是指向同一个列表，并没有产生新的副本。

另一种获取已排序的列表副本的方法是使用sorted函数：

x=[4,6,2,1,7,9]
y=sorted(x)
printy#[1,2,4,6,7,9]
printx#[4,6,2,1,7,9]

sorted返回一个有序的副本，并且类型总是列表，如下：

printsorted('Python')#['P','h','n','o','t','y']

二、自定义比较函数

可以定义自己的比较函数，然后通过参数传递给sort方法：

defcomp(x,y):
ifx<y:
return1
elifx>y:
return-1
else:
return0
nums=[3,2,8,0,1]
nums.sort(comp)
printnums#降序排序[8,3,2,1,0]
nums.sort(cmp)#调用内建函数cmp，升序排序
printnums#降序排序[0,1,2,3,8]

三、可选参数

sort方法还有两个可选参数：key和reverse
1、key在使用时必须提供一个排序过程总调用的函数：

x=['mmm','mm','mm','m']
x.sort(key=len)
printx#['m','mm','mm','mmm']

2、reverse实现降序排序，需要提供一个布尔值：

y=[3,2,8,0,1]
y.sort(reverse=True)
printy#[8,3,2,1,0]

㈩ Lambda表达式的Python表达式

Lambda表达式是Python中一类特殊的定义函数的形式，使用它可以定义一个匿名函数。与其它语言不同，Python的Lambda表达式的函数体只能有唯一的一条语句，也就是返回值表达式语句。其语法如下：
lambda 形参列表 : 函数返回值表达式语句
下面是个Lambda表达式的例子： #!/usr/bin/envpythonli=[{age:20,name:def},{age:25,name:abc},{age:10,name:ghi}]li=sorted(li,key=lambdax:x[age])print(li)如果不用Lambda表达式，而要写成常规的函数，那么需要这么写： #!/usr/bin/envpythondefcomp(x):returnx[age]li=[{age:20,name:def},{age:25,name:abc},{age:10,name:ghi}]li=sorted(li,key=comp)print(li)